oj.uz

Submission #369366

# Submission time Handle Problem Language Result Execution time Memory
369366 2021-02-21T12:37:44 Z AmineWeslati Regions (IOI09_regions) C++14
65 / 100
 8000 ms 39020 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

const int C=800;
int N,R,Q; 
vi a(MX),adj[MX],cnt(MX,0),vec[MX],vec2[MX],in(MX),out(MX);
//unordered_map<int,int>mp[MX];
vi mp[MX];

//mp[x][y]
void dfs(int u, int c){
	for(auto v: adj[u]){
		mp[c][a[v]]++;
		dfs(v,c);
	}
}
void precompute1(){ //(N/C)*N
	FOR(i,1,R+1) if(cnt[i]>C){
		mp[i].resize(R+1);
		for(auto j: vec[i]) dfs(j,i);
	}
}

//in[u],out[u]
//vec2[c]
int cntr=0;
void euler(int u=1, int p=1){
	in[u]=++cntr;
	for(auto v: adj[u]) euler(v,u);
	out[u]=cntr;
}
void precompute2(){ //O(NlgN)
	euler();
	FOR(i,1,N+1) vec2[a[i]].pb(in[i]);
	FOR(i,1,R+1) sort(all(vec2[i]));
}


int solve(int l, int r, int c){
	if(l>r) return 0;
	return upper_bound(all(vec2[c]),r)-lower_bound(all(vec2[c]),l);
}

int main() {
    boost; IO();

    cin>>N>>R>>Q;
    FOR(i,1,N+1){
    	if(i>1){
    		int j; cin>>j;
    		adj[j].pb(i);
    	}
    	cin>>a[i];
    	vec[a[i]].pb(i);
    	cnt[a[i]]++;
    }

    precompute1();
    precompute2();

    //Q*C*lg(N)
    while(Q--){ 
    	int x,y; cin>>x>>y;
    	if(cnt[x]>C){
    		cout << mp[x][y] << endl;
    		cout.flush();
    	}
    	else{
    		int ans=0;
    		for(auto u: vec[x]){
    			int l=in[u],r=out[u];
    			ans+=solve(l+1,r,y);
    		}
    		cout << ans << endl;
    		cout.flush();
    	}
    }

    return 0;
}
//Change your approach

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 22252 KB Output is correct
2 Correct 16 ms 22252 KB Output is correct
3 Correct 17 ms 22272 KB Output is correct
4 Correct 24 ms 22252 KB Output is correct
5 Correct 23 ms 22252 KB Output is correct
6 Correct 33 ms 22380 KB Output is correct
7 Correct 42 ms 22380 KB Output is correct
8 Correct 46 ms 22508 KB Output is correct
9 Correct 76 ms 22764 KB Output is correct
10 Correct 100 ms 22892 KB Output is correct
11 Correct 153 ms 23048 KB Output is correct
12 Correct 157 ms 23532 KB Output is correct
13 Correct 226 ms 23148 KB Output is correct
14 Correct 383 ms 23660 KB Output is correct
15 Correct 358 ms 26012 KB Output is correct

Subtask #2
50.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 6658 ms 26088 KB Output is correct
2 Correct 3140 ms 24856 KB Output is correct
3 Execution timed out 8041 ms 27228 KB Time limit exceeded
4 Correct 360 ms 23672 KB Output is correct
5 Correct 354 ms 25184 KB Output is correct
6 Correct 1578 ms 24684 KB Output is correct
7 Correct 2021 ms 25452 KB Output is correct
8 Correct 1663 ms 30188 KB Output is correct
9 Correct 2884 ms 30036 KB Output is correct
10 Correct 5450 ms 34732 KB Output is correct
11 Correct 4734 ms 29372 KB Output is correct
12 Execution timed out 8037 ms 30884 KB Time limit exceeded
13 Execution timed out 8074 ms 29676 KB Time limit exceeded
14 Execution timed out 8063 ms 29420 KB Time limit exceeded
15 Execution timed out 8074 ms 33388 KB Time limit exceeded
16 Execution timed out 8050 ms 39020 KB Time limit exceeded
17 Execution timed out 8087 ms 37996 KB Time limit exceeded