답안 #107534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107534	2019-04-25T01:46:34 Z	aer0park	트리 (KOI16_tree)	C++14	100 / 100	279 ms	27896 KB

tree

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
ll n,q,cnt=1,qy=1;
ll ind[200004],pw[200004],chd[200004],par[200004];
vector<ll> g[200004];  //원래 번호 
 
ll val(ll a)
{
	ll ret=0;
	while(a)
	{
		ret+=pw[a];
		a-=(a&-a);	
	}	
	return ret;
}
 
void upd(ll a,ll x)
{
	while(a<=n)
	{
		pw[a]+=x;
		a+=(a&-a);
	}	
}
 
void updrange(ll a,ll sz)
{
	upd(a,qy);
	upd(a+sz,-qy);
	qy+=(200004-a);
}
 
ll dfs(ll a,ll p)
{
	ll ret=1;
	ind[a]=cnt++,par[ind[a]]=ind[p];
	for(int i=0;i<g[a].size();i++)
		ret+=dfs(g[a][i],a);
	chd[ind[a]]=ret;
	return ret;
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
	cin>>n>>q;
	for(int i=2;i<=n;i++)
	{
		ll a;cin>>a;
		g[a].push_back(i);
	}    
	dfs(1,0);
	for(int i=0;i<q;i++)
	{
		ll b,c,d;cin>>b>>c>>d;
		if(d==0)
		{
			if(val(ind[b])==val(ind[c]))
				cout<<"YES"<<"\n";
			else
				cout<<"NO"<<"\n";
		}
		else
		{
			if(val(ind[b])==val(ind[c]))
			{
				cout<<"YES"<<"\n";
				ll f=ind[b];
				if(val(f)==val(par[f]))
					updrange(f,chd[f]);
			}
			else
			{
				cout<<"NO"<<"\n";
				ll f=ind[c];
				if(val(f)==val(par[f]))
					updrange(f,chd[f]);	
			}
		}
	}
    return 0;
}

Compilation message

tree.cpp: In function 'll dfs(ll, ll)':
tree.cpp:42:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[a].size();i++)
              ~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 KB	Output is correct
3	Correct	7 ms	5248 KB	Output is correct
4	Correct	8 ms	5248 KB	Output is correct
5	Correct	7 ms	5248 KB	Output is correct
6	Correct	8 ms	5248 KB	Output is correct
7	Correct	7 ms	5248 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	6 ms	5120 KB	Output is correct
10	Correct	7 ms	5120 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 KB	Output is correct
3	Correct	7 ms	5248 KB	Output is correct
4	Correct	8 ms	5248 KB	Output is correct
5	Correct	7 ms	5248 KB	Output is correct
6	Correct	8 ms	5248 KB	Output is correct
7	Correct	7 ms	5248 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	6 ms	5120 KB	Output is correct
10	Correct	7 ms	5120 KB	Output is correct
11	Correct	9 ms	5120 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	8 ms	5120 KB	Output is correct
14	Correct	8 ms	5120 KB	Output is correct
15	Correct	8 ms	5120 KB	Output is correct
16	Correct	8 ms	5120 KB	Output is correct
17	Correct	8 ms	5248 KB	Output is correct
18	Correct	7 ms	5120 KB	Output is correct
19	Correct	9 ms	5248 KB	Output is correct
20	Correct	6 ms	5120 KB	Output is correct
21	Correct	7 ms	5120 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 KB	Output is correct
3	Correct	7 ms	5248 KB	Output is correct
4	Correct	8 ms	5248 KB	Output is correct
5	Correct	7 ms	5248 KB	Output is correct
6	Correct	8 ms	5248 KB	Output is correct
7	Correct	7 ms	5248 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	6 ms	5120 KB	Output is correct
10	Correct	7 ms	5120 KB	Output is correct
11	Correct	9 ms	5120 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	8 ms	5120 KB	Output is correct
14	Correct	8 ms	5120 KB	Output is correct
15	Correct	8 ms	5120 KB	Output is correct
16	Correct	8 ms	5120 KB	Output is correct
17	Correct	8 ms	5248 KB	Output is correct
18	Correct	7 ms	5120 KB	Output is correct
19	Correct	9 ms	5248 KB	Output is correct
20	Correct	6 ms	5120 KB	Output is correct
21	Correct	7 ms	5120 KB	Output is correct
22	Correct	68 ms	8056 KB	Output is correct
23	Correct	70 ms	8064 KB	Output is correct
24	Correct	67 ms	8056 KB	Output is correct
25	Correct	67 ms	8028 KB	Output is correct
26	Correct	80 ms	8056 KB	Output is correct
27	Correct	81 ms	8056 KB	Output is correct
28	Correct	91 ms	8056 KB	Output is correct
29	Correct	82 ms	8160 KB	Output is correct
30	Correct	68 ms	8156 KB	Output is correct
31	Correct	70 ms	8184 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 KB	Output is correct
3	Correct	7 ms	5248 KB	Output is correct
4	Correct	8 ms	5248 KB	Output is correct
5	Correct	7 ms	5248 KB	Output is correct
6	Correct	8 ms	5248 KB	Output is correct
7	Correct	7 ms	5248 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	6 ms	5120 KB	Output is correct
10	Correct	7 ms	5120 KB	Output is correct
11	Correct	233 ms	27564 KB	Output is correct
12	Correct	250 ms	27608 KB	Output is correct
13	Correct	235 ms	27644 KB	Output is correct
14	Correct	244 ms	27720 KB	Output is correct
15	Correct	246 ms	27656 KB	Output is correct
16	Correct	232 ms	27592 KB	Output is correct
17	Correct	242 ms	27896 KB	Output is correct
18	Correct	242 ms	27640 KB	Output is correct
19	Correct	265 ms	27768 KB	Output is correct
20	Correct	264 ms	27740 KB	Output is correct
21	Correct	239 ms	27640 KB	Output is correct

Subtask #5
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	5248 KB	Output is correct
2	Correct	8 ms	5248 KB	Output is correct
3	Correct	7 ms	5248 KB	Output is correct
4	Correct	8 ms	5248 KB	Output is correct
5	Correct	7 ms	5248 KB	Output is correct
6	Correct	8 ms	5248 KB	Output is correct
7	Correct	7 ms	5248 KB	Output is correct
8	Correct	7 ms	5120 KB	Output is correct
9	Correct	6 ms	5120 KB	Output is correct
10	Correct	7 ms	5120 KB	Output is correct
11	Correct	9 ms	5120 KB	Output is correct
12	Correct	7 ms	5120 KB	Output is correct
13	Correct	8 ms	5120 KB	Output is correct
14	Correct	8 ms	5120 KB	Output is correct
15	Correct	8 ms	5120 KB	Output is correct
16	Correct	8 ms	5120 KB	Output is correct
17	Correct	8 ms	5248 KB	Output is correct
18	Correct	7 ms	5120 KB	Output is correct
19	Correct	9 ms	5248 KB	Output is correct
20	Correct	6 ms	5120 KB	Output is correct
21	Correct	7 ms	5120 KB	Output is correct
22	Correct	68 ms	8056 KB	Output is correct
23	Correct	70 ms	8064 KB	Output is correct
24	Correct	67 ms	8056 KB	Output is correct
25	Correct	67 ms	8028 KB	Output is correct
26	Correct	80 ms	8056 KB	Output is correct
27	Correct	81 ms	8056 KB	Output is correct
28	Correct	91 ms	8056 KB	Output is correct
29	Correct	82 ms	8160 KB	Output is correct
30	Correct	68 ms	8156 KB	Output is correct
31	Correct	70 ms	8184 KB	Output is correct
32	Correct	233 ms	27564 KB	Output is correct
33	Correct	250 ms	27608 KB	Output is correct
34	Correct	235 ms	27644 KB	Output is correct
35	Correct	244 ms	27720 KB	Output is correct
36	Correct	246 ms	27656 KB	Output is correct
37	Correct	232 ms	27592 KB	Output is correct
38	Correct	242 ms	27896 KB	Output is correct
39	Correct	242 ms	27640 KB	Output is correct
40	Correct	265 ms	27768 KB	Output is correct
41	Correct	264 ms	27740 KB	Output is correct
42	Correct	239 ms	27640 KB	Output is correct
43	Correct	184 ms	18680 KB	Output is correct
44	Correct	190 ms	18716 KB	Output is correct
45	Correct	207 ms	18680 KB	Output is correct
46	Correct	197 ms	18828 KB	Output is correct
47	Correct	157 ms	18680 KB	Output is correct
48	Correct	104 ms	16360 KB	Output is correct
49	Correct	104 ms	17032 KB	Output is correct
50	Correct	135 ms	17068 KB	Output is correct
51	Correct	279 ms	24804 KB	Output is correct

답안 #107534

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 13.0 / 13.0

Subtask #3 14.0 / 14.0

Subtask #4 19.0 / 19.0

Subtask #5 45.0 / 45.0

Subtask #1
9.0 / 9.0

Subtask #2
13.0 / 13.0

Subtask #3
14.0 / 14.0

Subtask #4
19.0 / 19.0

Subtask #5
45.0 / 45.0