oj.uz

Submission #116422

# Submission time Handle Problem Language Result Execution time Memory
116422 2019-06-12T12:38:12 Z kig9981 Regions (IOI09_regions) C++17
90 / 100
 8000 ms 72696 KB 
#include <bits/stdc++.h>
 
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
 
using namespace std;

const int rt=500;
vector<int> adj[200000], R[25000], O;
int node_cnt=-1, RV[200000], num[200000], fin[200000], sum[rt][200000], sum2[rt][200000], tree[200001], idx[200000];
long long ans1[rt][25000], ans2[rt][25000];

void add_tree(int n, int v)
{
	for(++n;n<=200000;n+=n&-n) tree[n]+=v;
}

int get_sum(int n)
{
	int ret=0;
	for(++n;n;n-=n&-n) ret+=tree[n];
	return ret;
}

int get_sum(int s, int e)
{
	return get_sum(e)-get_sum(s-1);
}

void dfs(int c)
{
	num[c]=++node_cnt;
	for(auto n: adj[c]) dfs(n);
	fin[c]=node_cnt;
}

void dfs2(int c, int idx)
{
	if(RV[c]==O[idx]) {
		sum[idx][c]++;
		sum2[idx][c]++;
	}
	for(auto n: adj[c]) {
		sum[idx][n]=sum[idx][c];
		dfs2(n,idx);
		sum2[idx][c]+=sum2[idx][n];
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int N, M, Q, p;
	cin>>N>>M>>Q>>RV[0];
	R[--RV[0]].push_back(0);
	for(int i=1;i<N;i++) {
		cin>>p>>RV[i];
		adj[--p].push_back(i);
		R[--RV[i]].push_back(i);
	}
	dfs(0);
	for(int i=0;i<M;i++) if(R[i].size()>=rt) {
		idx[i]=O.size();
		O.push_back(i);
		dfs2(0,O.size()-1);
	}
	for(int i=0;i<O.size();i++) for(int j=0;j<N;j++) {
		ans1[i][RV[j]]+=sum[i][j];
		ans2[i][RV[j]]+=sum2[i][j];
	}
	while(Q--) {
		int a, b;
		cin>>a>>b; --a; --b;
		if(R[a].size()>=rt) cout<<ans1[idx[a]][b]<<'\n';
		else if(R[b].size()>=rt) cout<<ans2[idx[b]][a]<<'\n';
		else {
			long long ans=0;
			for(auto r: R[b]) add_tree(num[r],1);
			for(auto r: R[a]) ans+=get_sum(num[r],fin[r]);
			for(auto r: R[b]) add_tree(num[r],-1);
			cout<<ans<<'\n';
		}
		cout.flush();
	}
	return 0;
}

Compilation message

regions.cpp: In function 'int main()':
regions.cpp:76:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<O.size();i++) for(int j=0;j<N;j++) {
              ~^~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5760 KB Output is correct
2 Correct 7 ms 5760 KB Output is correct
3 Correct 8 ms 5680 KB Output is correct
4 Correct 11 ms 5632 KB Output is correct
5 Correct 15 ms 5760 KB Output is correct
6 Correct 13 ms 5760 KB Output is correct
7 Correct 36 ms 5632 KB Output is correct
8 Correct 46 ms 5760 KB Output is correct
9 Correct 46 ms 6016 KB Output is correct
10 Correct 77 ms 6144 KB Output is correct
11 Correct 127 ms 6400 KB Output is correct
12 Correct 165 ms 6784 KB Output is correct
13 Correct 201 ms 6528 KB Output is correct
14 Correct 385 ms 7040 KB Output is correct
15 Correct 538 ms 9088 KB Output is correct

Subtask #2
75.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 1919 ms 17912 KB Output is correct
2 Correct 1825 ms 17484 KB Output is correct
3 Correct 3453 ms 20264 KB Output is correct
4 Correct 407 ms 7168 KB Output is correct
5 Correct 457 ms 8368 KB Output is correct
6 Correct 1386 ms 18668 KB Output is correct
7 Correct 2800 ms 9216 KB Output is correct
8 Correct 3046 ms 19208 KB Output is correct
9 Correct 4825 ms 14072 KB Output is correct
10 Execution timed out 8039 ms 17912 KB Time limit exceeded
11 Execution timed out 8010 ms 13944 KB Time limit exceeded
12 Correct 2781 ms 19384 KB Output is correct
13 Correct 3239 ms 20144 KB Output is correct
14 Correct 4255 ms 57528 KB Output is correct
15 Correct 5949 ms 25904 KB Output is correct
16 Correct 5798 ms 35172 KB Output is correct
17 Correct 5827 ms 72696 KB Output is correct