The time limit for D1C is incredibly tight. My $$$O(n \log V + q \log^2 n)$$$ solution failed to pass (373689679), yet an optimized brute-force approach managed to get through (373668849). :(

I see. I hadn't come across that blog before. Thanks for sharing.

Auto comment: topic has been updated by Getaway_Car (previous revision, new revision, compare).

Codeforces is not an appropriate platform for expressing patriotism.

And please use English, as using other languages may confuse readers.

I genuinely don’t understand why comments like these receive upvotes.

I believe that it's better to have a round than not have one.

Well, maybe not — given the number of cheaters, the strange Div. 1 problem arrangement, and C1/2 being much harder than they should’ve been. :(

If there are some hints before the solution, it will become better.

One of my friends' $$$O(nq)$$$ code also passed. I guess the test data is random. And here is the hack:

#include <bits/stdc++.h>
#define rep(i, s, e) for(int i = s; i <= e; ++i)
using namespace std;
int main() {
	freopen("data.txt", "w", stdout);
	printf("10000\n");
	rep(i, 1, 10000) printf("1 1 1\n");
	printf("500000\n");
	rep(i, 1, 500000) printf("1\n");
	return 0;
}