답안 #57845 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57845	2018-07-16T10:15:18 Z	red1108	트리 (KOI16_tree)	C++17	55 / 100	2000 ms	25940 KB

tree

#include <stdio.h>
#include <vector>
#include <set>
using namespace std;
int n,q;
vector<int> tree[200010];
int seg[800010],par[200010],cnt=0,si=1,color[200010],ccnt=1,bumo[200010],cut[200010];
pair<int,int> range[200010];
int checkcnt=0;
void dfs(int x)
{
    range[x].first=++cnt;
    for(auto i:tree[x]) dfs(i);
    range[x].second=cnt;
}
void rename(int x,int newc)
{
    checkcnt++;
    color[x]=newc;
    for(auto i:tree[x]) if(!cut[i]) rename(i,newc);
}
void gang(int x, int k)
{
    x=x+si-1;
    int delta=k-seg[x];
    while(x)
    {
        seg[x]+=delta;
        x/=2;
    }
}
int getsize(int x, int l, int r, int s, int e)
{
    if(l>r||e<l||r<s)return 0;
    if(s<=l&&r<=e)return seg[x];
    return getsize(x*2,l,(l+r)/2,s,e)+getsize(x*2+1,(l+r)/2+1,r,s,e);
}
int main()
{
    int i,a,b,c,flag,tmp,sip,sia;
    scanf("%d %d", &n,&q);
    while(si<n)si*=2;
    for(i=2; i<=n; i++)
    {
        scanf("%d", &a);
        bumo[i]=a;
        tree[a].emplace_back(i);
    }
    for(i=1;i<=n;i++) color[i]=1;
    par[1]=1;
    dfs(1);
    for(i=1;i<=n;i++) gang(i,1);
    for(i=1;i<=q;i++,flag=0)
    {
        scanf("%d %d %d", &a, &b, &c);
        if(color[a]==color[b])
        {
            printf("YES\n");
            flag=1;
        }
        else printf("NO\n");
        if(c==0) continue;
        if(!flag) a=b;
        if(cut[a]) continue;
        cut[a]=1;
        sia=getsize(1,1,si,range[a].first+1,range[a].second)+1;
        gang(range[a].first,(-1)*sia+1);
        sip=getsize(1,1,si,range[par[color[a]]].first+1,range[par[color[a]]].second)+1;
        if(sip<sia)
        {
            par[ccnt+1]=par[color[a]];
            tmp=color[a];
            rename(par[color[a]],++ccnt);
            par[tmp]=a;
        }
        else
        {
            rename(a,++ccnt);
            par[ccnt]=a;
        }
    }
}

Compilation message

tree.cpp: In function 'int main()':
tree.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n,&q);
     ~~~~~^~~~~~~~~~~~~~~~
tree.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~
tree.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5172 KB	Output is correct
2	Correct	8 ms	5244 KB	Output is correct
3	Correct	9 ms	5336 KB	Output is correct
4	Correct	8 ms	5400 KB	Output is correct
5	Correct	8 ms	5400 KB	Output is correct
6	Correct	8 ms	5400 KB	Output is correct
7	Correct	9 ms	5400 KB	Output is correct
8	Correct	8 ms	5400 KB	Output is correct
9	Correct	9 ms	5460 KB	Output is correct
10	Correct	7 ms	5460 KB	Output is correct
11	Correct	7 ms	5460 KB	Output is correct
12	Correct	7 ms	5504 KB	Output is correct
13	Correct	7 ms	5504 KB	Output is correct
14	Correct	8 ms	5504 KB	Output is correct
15	Correct	6 ms	5596 KB	Output is correct
16	Correct	8 ms	5596 KB	Output is correct
17	Correct	7 ms	5596 KB	Output is correct
18	Correct	8 ms	5620 KB	Output is correct
19	Correct	7 ms	5620 KB	Output is correct
20	Correct	7 ms	5620 KB	Output is correct
21	Correct	8 ms	5620 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5172 KB	Output is correct
2	Correct	8 ms	5244 KB	Output is correct
3	Correct	9 ms	5336 KB	Output is correct
4	Correct	8 ms	5400 KB	Output is correct
5	Correct	8 ms	5400 KB	Output is correct
6	Correct	8 ms	5400 KB	Output is correct
7	Correct	9 ms	5400 KB	Output is correct
8	Correct	8 ms	5400 KB	Output is correct
9	Correct	9 ms	5460 KB	Output is correct
10	Correct	7 ms	5460 KB	Output is correct
11	Correct	7 ms	5460 KB	Output is correct
12	Correct	7 ms	5504 KB	Output is correct
13	Correct	7 ms	5504 KB	Output is correct
14	Correct	8 ms	5504 KB	Output is correct
15	Correct	6 ms	5596 KB	Output is correct
16	Correct	8 ms	5596 KB	Output is correct
17	Correct	7 ms	5596 KB	Output is correct
18	Correct	8 ms	5620 KB	Output is correct
19	Correct	7 ms	5620 KB	Output is correct
20	Correct	7 ms	5620 KB	Output is correct
21	Correct	8 ms	5620 KB	Output is correct
22	Correct	101 ms	6208 KB	Output is correct
23	Correct	95 ms	6288 KB	Output is correct
24	Correct	92 ms	6288 KB	Output is correct
25	Correct	93 ms	6288 KB	Output is correct
26	Correct	79 ms	6288 KB	Output is correct
27	Correct	93 ms	6308 KB	Output is correct
28	Correct	114 ms	6308 KB	Output is correct
29	Correct	96 ms	6308 KB	Output is correct
30	Correct	111 ms	6440 KB	Output is correct
31	Correct	96 ms	6440 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5172 KB	Output is correct
2	Correct	8 ms	5244 KB	Output is correct
3	Correct	9 ms	5336 KB	Output is correct
4	Correct	8 ms	5400 KB	Output is correct
5	Correct	8 ms	5400 KB	Output is correct
6	Correct	8 ms	5400 KB	Output is correct
7	Correct	9 ms	5400 KB	Output is correct
8	Correct	8 ms	5400 KB	Output is correct
9	Correct	9 ms	5460 KB	Output is correct
10	Correct	7 ms	5460 KB	Output is correct
11	Correct	843 ms	23664 KB	Output is correct
12	Correct	690 ms	23664 KB	Output is correct
13	Correct	726 ms	23664 KB	Output is correct
14	Correct	786 ms	23664 KB	Output is correct
15	Correct	716 ms	23744 KB	Output is correct
16	Correct	829 ms	24436 KB	Output is correct
17	Correct	499 ms	25940 KB	Output is correct
18	Correct	570 ms	25940 KB	Output is correct
19	Correct	462 ms	25940 KB	Output is correct
20	Correct	516 ms	25940 KB	Output is correct
21	Correct	817 ms	25940 KB	Output is correct

Subtask #5
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5172 KB	Output is correct
2	Correct	8 ms	5244 KB	Output is correct
3	Correct	9 ms	5336 KB	Output is correct
4	Correct	8 ms	5400 KB	Output is correct
5	Correct	8 ms	5400 KB	Output is correct
6	Correct	8 ms	5400 KB	Output is correct
7	Correct	9 ms	5400 KB	Output is correct
8	Correct	8 ms	5400 KB	Output is correct
9	Correct	9 ms	5460 KB	Output is correct
10	Correct	7 ms	5460 KB	Output is correct
11	Correct	7 ms	5460 KB	Output is correct
12	Correct	7 ms	5504 KB	Output is correct
13	Correct	7 ms	5504 KB	Output is correct
14	Correct	8 ms	5504 KB	Output is correct
15	Correct	6 ms	5596 KB	Output is correct
16	Correct	8 ms	5596 KB	Output is correct
17	Correct	7 ms	5596 KB	Output is correct
18	Correct	8 ms	5620 KB	Output is correct
19	Correct	7 ms	5620 KB	Output is correct
20	Correct	7 ms	5620 KB	Output is correct
21	Correct	8 ms	5620 KB	Output is correct
22	Correct	101 ms	6208 KB	Output is correct
23	Correct	95 ms	6288 KB	Output is correct
24	Correct	92 ms	6288 KB	Output is correct
25	Correct	93 ms	6288 KB	Output is correct
26	Correct	79 ms	6288 KB	Output is correct
27	Correct	93 ms	6308 KB	Output is correct
28	Correct	114 ms	6308 KB	Output is correct
29	Correct	96 ms	6308 KB	Output is correct
30	Correct	111 ms	6440 KB	Output is correct
31	Correct	96 ms	6440 KB	Output is correct
32	Correct	843 ms	23664 KB	Output is correct
33	Correct	690 ms	23664 KB	Output is correct
34	Correct	726 ms	23664 KB	Output is correct
35	Correct	786 ms	23664 KB	Output is correct
36	Correct	716 ms	23744 KB	Output is correct
37	Correct	829 ms	24436 KB	Output is correct
38	Correct	499 ms	25940 KB	Output is correct
39	Correct	570 ms	25940 KB	Output is correct
40	Correct	462 ms	25940 KB	Output is correct
41	Correct	516 ms	25940 KB	Output is correct
42	Correct	817 ms	25940 KB	Output is correct
43	Correct	268 ms	25940 KB	Output is correct
44	Correct	203 ms	25940 KB	Output is correct
45	Execution timed out	2064 ms	25940 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

답안 #57845

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 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
0 / 45.0