oj.uz

Submission #478177

# Submission time Handle Problem Language Result Execution time Memory
478177 2021-10-06T08:16:43 Z Abrar_Al_Samit Regions (IOI09_regions) C++17
35 / 100
 8000 ms 35392 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
const int MX = 200005;
struct FenwickTree {
    vector<int> bit;  // binary indexed tree
    int n = MX;

    int sum(int r) {
    	if(bit.empty()) bit.resize(n);
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    int sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }

    void add(int idx, int delta) {
    	if(bit.empty()) bit.resize(n);
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};
const int B = 447;
int N, R, Q;
vector <int> g[MX], region[MX];
int H[MX], st[MX], en[MX], timer=1, stwho[MX];
unordered_map <int, vector <long long>> prep;

void Flat(int v, int p) {
	stwho[timer] = v;
	st[v] = timer++;
	region[H[v]].push_back(st[v]);
	for(auto to : g[v]) if(to!=p) {
		Flat(to, v);
	}
	en[v] = timer-1;
}
int main() {
	cin >> N >> R >> Q;
	cin >> H[1];
	for(int i=2; i<=N; ++i) {
		int p; cin >> p >> H[i];
		g[p].push_back(i);
	}
	Flat(1, 1);
	vector <int> bigs;
	for(int i=1; i<=R; ++i) if(region[i].size()>B) {
		bigs.push_back(i);
	}
	FenwickTree A; 
	for(int all=1; all<=R; ++all) {
		for(auto it : region[all]) {
			A.add(st[it], 1);
		}
		for(auto b : bigs) {
			if(prep[b].empty()) prep[b].resize(R+1);
			for(auto it : region[b]) {
				prep[b][all] += A.sum(st[it], en[it]);
			}
		}
		for(auto it : region[all]) {
			A.add(st[it], -1);
		}
	}

	// O(Q(rootNlogN + logR))
	while(Q--) {
		int r1, r2;
		cin >> r1 >> r2;
		long long ans = 0;
		if(region[r1].size()>B) {
			ans = prep[r1][r2];
		} else {
			for(auto p1 : region[r1]) {
				auto it = upper_bound(region[r2].begin(), region[r2].end(), en[stwho[p1]]);
				auto it2 = lower_bound(region[r2].begin(), region[r2].end(), p1);
				ans += it-it2; 
			}
		}
		cout << ans << endl;
	}
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10440 KB Output is correct
2 Correct 7 ms 10440 KB Output is correct
3 Correct 9 ms 10440 KB Output is correct
4 Correct 11 ms 10440 KB Output is correct
5 Correct 15 ms 10440 KB Output is correct
6 Correct 26 ms 10568 KB Output is correct
7 Correct 31 ms 10516 KB Output is correct
8 Correct 48 ms 10568 KB Output is correct
9 Correct 69 ms 10968 KB Output is correct
10 Correct 104 ms 10964 KB Output is correct
11 Correct 151 ms 11208 KB Output is correct
12 Correct 176 ms 11688 KB Output is correct
13 Correct 234 ms 11336 KB Output is correct
14 Correct 291 ms 11984 KB Output is correct
15 Correct 281 ms 14436 KB Output is correct

Subtask #2
20.0 / 85.0

# Verdict Execution time Memory Grader output
1 Incorrect 2330 ms 15032 KB Output isn't correct
2 Incorrect 2731 ms 13792 KB Output isn't correct
3 Incorrect 3968 ms 16840 KB Output isn't correct
4 Correct 352 ms 11964 KB Output is correct
5 Correct 459 ms 13632 KB Output is correct
6 Execution timed out 8019 ms 16448 KB Time limit exceeded
7 Incorrect 6250 ms 15444 KB Output isn't correct
8 Execution timed out 8050 ms 26920 KB Time limit exceeded
9 Correct 2627 ms 19196 KB Output is correct
10 Execution timed out 8087 ms 35392 KB Time limit exceeded
11 Correct 4894 ms 18952 KB Output is correct
12 Execution timed out 8044 ms 20892 KB Time limit exceeded
13 Execution timed out 8039 ms 21056 KB Time limit exceeded
14 Execution timed out 8092 ms 24016 KB Time limit exceeded
15 Execution timed out 8083 ms 25152 KB Time limit exceeded
16 Execution timed out 8071 ms 30524 KB Time limit exceeded
17 Execution timed out 8080 ms 32700 KB Time limit exceeded