oj.uz

답안 #203566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203566 2020-02-21T10:34:30 Z kig9981 Unique Cities (JOI19_ho_t5) C++17
4 / 100
 2000 ms 111820 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;

vector<int> adj[200000], Q[400000], tree[400000];
int res, N, node_cnt, st_cnt, STP[200000], num[200000], num_rev[200000], ST[400000][19], SZ[400000], depth[200000], parent[200000], P[400000][18], dist[400000], sdist[400000], ans[200000], C[200000], CC[400000], cnt[200001];

void dfs(int c)
{
	STP[c]=st_cnt;
	ST[st_cnt][0]=num[c]=node_cnt++;
	num_rev[num[c]]=c;
	for(int i=1;i<19;i++) ST[st_cnt][i]=min(ST[st_cnt][i-1],ST[max(st_cnt-(1<<i-1),0)][i-1]);
	st_cnt++;
	for(auto n: adj[c]) if(num[n]==-1) {
		parent[n]=c;
		depth[n]=depth[c]+1;
		dfs(n);
		ST[st_cnt][0]=num[c];
		for(int i=1;i<19;i++) ST[st_cnt][i]=min(ST[st_cnt][i-1],ST[max(st_cnt-(1<<i-1),0)][i-1]);
		st_cnt++;
	}
}

int LCA(int a, int b)
{
	int d;
	if(STP[a]>STP[b]) swap(a,b);
	d=SZ[STP[b]-STP[a]+1];
	a=STP[a]; b=STP[b];
	return num_rev[min(ST[a+(1<<d)-1][d],ST[b][d])];
}

int get_dist(int a, int b)
{
	b=b<N ? b:parent[b-N];
	return depth[a]+depth[b]-2*depth[LCA(a,b)];
}

void solve(int c)
{
	for(auto n: adj[c]) if(num[n]>num[c]) {
		solve(n);
		if(dist[c]<dist[n]+1) {
			sdist[c]=dist[c];
			dist[c]=dist[n]+1;
		}
		else if(sdist[c]<dist[n]+1) sdist[c]=dist[n]+1;
	}
	P[c][0]=c;
	for(auto n: adj[c]) if(num[n]>num[c] && sdist[c]<dist[n]+1)  {
		int np=n;
		for(int i=17;i>=0;i--) if(get_dist(c,P[np][i])<=sdist[c]) np=P[np][i];
		if(get_dist(c,np)>sdist[c]) P[c][0]=np;
		else if(get_dist(c,P[np][0])>sdist[c]) P[c][0]=P[np][0];
	}
	for(int j=1;j<18;j++) P[c][j]=P[P[c][j-1]][j-1];
}

void solve2(int c)
{
	int m=N+c, sm=N, tm=N;
	for(int j=1;j<18;j++) P[N+c][j]=P[P[N+c][j-1]][j-1];
	for(auto n: adj[c]) if(num[n]>num[c]) {
		if(dist[m]<dist[n]) {
			tm=sm;
			sm=m;
			m=n;
		}
		else if(dist[sm]<dist[n]) {
			tm=sm;
			sm=n;
		}
		else if(dist[tm]<dist[n]) tm=n;
	}
	for(auto n: adj[c]) if(num[n]>num[c]) {
		int np;
		dist[N+n]=dist[m]==dist[n] ? dist[sm]+1:dist[m]+1;
		if(m==n) {
			np=sm;
			for(int i=17;i>=0;i--) if(get_dist(c,P[np][i])<=dist[tm]+1) np=P[np][i];
			if(get_dist(c,np)>dist[tm]+1) P[N+n][0]=np;
			else if(get_dist(c,P[np][0])>dist[tm]+1) P[N+n][0]=P[np][0];
		}
		else if(sm==n) {
			np=m;
			for(int i=17;i>=0;i--) if(get_dist(c,P[np][i])<=dist[tm]+1) np=P[np][i];
			if(get_dist(c,np)>dist[tm]+1) P[N+n][0]=np;
			else if(get_dist(c,P[np][0])>dist[tm]+1) P[N+n][0]=P[np][0];
		}
		else {
			np=m;
			for(int i=17;i>=0;i--) if(get_dist(c,P[np][i])<=dist[sm]+1) np=P[np][i];
			if(get_dist(c,np)>dist[sm]+1) P[N+n][0]=np;
			else if(get_dist(c,P[np][0])>dist[sm]+1) P[N+n][0]=P[np][0];
		}
		solve2(n);
	}
}

void dfs2(int c)
{
	CC[c]=2;
	if(++cnt[C[c<N ? c:parent[c-N]]]==1) res++;
	for(auto i: Q[c]) ans[i]=res;
	for(auto n: tree[c]) if(CC[n]==0) dfs2(n);
	if(--cnt[C[c<N ? c:parent[c-N]]]==0) res--;
}

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 M;
	cin>>N>>M;
	memset(P,-1,sizeof(P));
	for(int i=2;i<400000;i<<=1) SZ[i+1]=1;
	for(int i=2;i<400000;i++) SZ[i]+=SZ[i-1];
	dist[P[N][0]=N]=-1;
	for(int i=1;i<N;i++) {
		int a, b;
		cin>>a>>b;
		adj[--a].push_back(--b);
		adj[b].push_back(a);
		P[N+i][0]=N+i;
		num[i]=-1;
	}
	dfs(0); solve(0); solve2(0);
	for(int i=0;i<N;i++) {
		cin>>C[i];
		if(dist[i]>dist[N+i]+1) {
			int c=i;
			for(int j=17;j>=0;j--) if(get_dist(i,P[c][j])<=dist[N+i]+1) c=P[c][j];
			if(get_dist(i,c)>dist[N+i]+1) Q[c].push_back(i);
			else if(get_dist(i,P[c][0])>dist[N+i]+1) Q[P[c][0]].push_back(i);
		}
		else if(dist[i]<dist[N+i]+1) {
			int c=N+i;
			for(int j=17;j>=0;j--) if(get_dist(i,P[c][j])<=dist[i]) c=P[c][j];
			if(get_dist(i,c)>dist[i]) Q[c].push_back(i);
			else if(get_dist(i,P[c][0])>dist[i]) Q[P[c][0]].push_back(i);
		}
	}
	for(int i=0;i<2*N;i++) tree[P[i][0]].push_back(i);
	CC[N]=2;
	for(int i=0;i<2*N;i++) if(CC[i]==0) {
		int r=P[P[i][17]][17];
		for(;CC[r]==0;r=P[r][0]) {
			CC[r]=1;
			if(++cnt[C[r<N ? r:parent[r-N]]]==1) res++;
		}
		for(;CC[r]==1;r=P[r][0]) dfs2(r);
		for(;CC[r]==2;r=P[r][0]) {
			CC[r]=3;
			if(--cnt[C[r<N ? r:parent[r-N]]]==0) res--;
		}
	}
	for(int i=0;i<N;i++) cout<<ans[i]<<'\n';
	return 0;
}

Compilation message

joi2019_ho_t5.cpp: In function 'void dfs(int)':
joi2019_ho_t5.cpp:21:77: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  for(int i=1;i<19;i++) ST[st_cnt][i]=min(ST[st_cnt][i-1],ST[max(st_cnt-(1<<i-1),0)][i-1]);
                                                                            ~^~
joi2019_ho_t5.cpp:28:78: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   for(int i=1;i<19;i++) ST[st_cnt][i]=min(ST[st_cnt][i-1],ST[max(st_cnt-(1<<i-1),0)][i-1]);
                                                                             ~^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 53624 KB Output is correct
2 Correct 38 ms 54136 KB Output is correct
3 Correct 37 ms 54008 KB Output is correct
4 Correct 41 ms 54264 KB Output is correct
5 Correct 39 ms 54188 KB Output is correct
6 Correct 44 ms 54392 KB Output is correct
7 Correct 38 ms 54264 KB Output is correct
8 Correct 43 ms 54264 KB Output is correct
9 Correct 39 ms 54264 KB Output is correct
10 Correct 56 ms 54264 KB Output is correct
11 Correct 39 ms 54264 KB Output is correct
12 Correct 36 ms 54264 KB Output is correct
13 Correct 38 ms 54392 KB Output is correct
14 Correct 37 ms 54264 KB Output is correct
15 Correct 37 ms 54264 KB Output is correct
16 Correct 39 ms 54264 KB Output is correct
17 Correct 42 ms 54392 KB Output is correct
18 Correct 40 ms 54264 KB Output is correct
19 Correct 38 ms 54264 KB Output is correct
20 Correct 53 ms 54392 KB Output is correct
21 Correct 39 ms 54264 KB Output is correct
22 Correct 47 ms 54256 KB Output is correct
23 Correct 39 ms 54264 KB Output is correct
24 Correct 40 ms 54268 KB Output is correct
25 Correct 46 ms 54264 KB Output is correct
26 Correct 38 ms 54264 KB Output is correct
27 Correct 37 ms 54392 KB Output is correct
28 Correct 41 ms 54392 KB Output is correct
29 Correct 45 ms 54312 KB Output is correct
30 Correct 38 ms 54392 KB Output is correct
31 Correct 39 ms 54392 KB Output is correct
32 Correct 40 ms 54268 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 548 ms 86720 KB Output is correct
2 Correct 1199 ms 99732 KB Output is correct
3 Correct 151 ms 63608 KB Output is correct
4 Correct 1000 ms 110460 KB Output is correct
5 Execution timed out 2091 ms 111820 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 796 ms 99088 KB Output is correct
2 Execution timed out 2088 ms 110940 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 53624 KB Output is correct
2 Correct 38 ms 54136 KB Output is correct
3 Correct 37 ms 54008 KB Output is correct
4 Correct 41 ms 54264 KB Output is correct
5 Correct 39 ms 54188 KB Output is correct
6 Correct 44 ms 54392 KB Output is correct
7 Correct 38 ms 54264 KB Output is correct
8 Correct 43 ms 54264 KB Output is correct
9 Correct 39 ms 54264 KB Output is correct
10 Correct 56 ms 54264 KB Output is correct
11 Correct 39 ms 54264 KB Output is correct
12 Correct 36 ms 54264 KB Output is correct
13 Correct 38 ms 54392 KB Output is correct
14 Correct 37 ms 54264 KB Output is correct
15 Correct 37 ms 54264 KB Output is correct
16 Correct 39 ms 54264 KB Output is correct
17 Correct 42 ms 54392 KB Output is correct
18 Correct 40 ms 54264 KB Output is correct
19 Correct 38 ms 54264 KB Output is correct
20 Correct 53 ms 54392 KB Output is correct
21 Correct 39 ms 54264 KB Output is correct
22 Correct 47 ms 54256 KB Output is correct
23 Correct 39 ms 54264 KB Output is correct
24 Correct 40 ms 54268 KB Output is correct
25 Correct 46 ms 54264 KB Output is correct
26 Correct 38 ms 54264 KB Output is correct
27 Correct 37 ms 54392 KB Output is correct
28 Correct 41 ms 54392 KB Output is correct
29 Correct 45 ms 54312 KB Output is correct
30 Correct 38 ms 54392 KB Output is correct
31 Correct 39 ms 54392 KB Output is correct
32 Correct 40 ms 54268 KB Output is correct
33 Correct 548 ms 86720 KB Output is correct
34 Correct 1199 ms 99732 KB Output is correct
35 Correct 151 ms 63608 KB Output is correct
36 Correct 1000 ms 110460 KB Output is correct
37 Execution timed out 2091 ms 111820 KB Time limit exceeded
38 Halted 0 ms 0 KB -