답안 #57810 :: oj.uz

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

tree

#include <stdio.h>
#include <vector>
using namespace std;
int n,q;
vector<int> tree[200010];
int seg[800010],par[200010],cnt=0,si=1,color[800010],ccnt=1;
pair<int,int> range[200010];
bool cut[200010];
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)
{
    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;
    scanf("%d %d", &n, &q);
    while(si<n)
        si*=2;
    for(i=2; i<=n; i++)
    {
        scanf("%d", &a);
        tree[a].push_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++)
    {
        scanf("%d %d %d", &a, &b, &c);
        flag=0;
        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]==1)
            continue;
        cut[a]=1;
        int sip, sia;
        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]];
            int 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:45: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:50:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~
tree.cpp:63: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	5112 KB	Output is correct
2	Correct	7 ms	5280 KB	Output is correct
3	Correct	8 ms	5280 KB	Output is correct
4	Correct	7 ms	5340 KB	Output is correct
5	Correct	7 ms	5340 KB	Output is correct
6	Correct	8 ms	5340 KB	Output is correct
7	Correct	8 ms	5340 KB	Output is correct
8	Correct	7 ms	5456 KB	Output is correct
9	Correct	9 ms	5476 KB	Output is correct
10	Correct	7 ms	5476 KB	Output is correct

Subtask #2
13.0 / 13.0

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

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5112 KB	Output is correct
2	Correct	7 ms	5280 KB	Output is correct
3	Correct	8 ms	5280 KB	Output is correct
4	Correct	7 ms	5340 KB	Output is correct
5	Correct	7 ms	5340 KB	Output is correct
6	Correct	8 ms	5340 KB	Output is correct
7	Correct	8 ms	5340 KB	Output is correct
8	Correct	7 ms	5456 KB	Output is correct
9	Correct	9 ms	5476 KB	Output is correct
10	Correct	7 ms	5476 KB	Output is correct
11	Correct	9 ms	5476 KB	Output is correct
12	Correct	8 ms	5476 KB	Output is correct
13	Correct	8 ms	5476 KB	Output is correct
14	Correct	8 ms	5476 KB	Output is correct
15	Correct	10 ms	5476 KB	Output is correct
16	Correct	8 ms	5476 KB	Output is correct
17	Correct	6 ms	5476 KB	Output is correct
18	Correct	10 ms	5476 KB	Output is correct
19	Correct	8 ms	5476 KB	Output is correct
20	Correct	7 ms	5476 KB	Output is correct
21	Correct	8 ms	5476 KB	Output is correct
22	Correct	98 ms	6088 KB	Output is correct
23	Correct	92 ms	6088 KB	Output is correct
24	Correct	83 ms	6088 KB	Output is correct
25	Correct	100 ms	6088 KB	Output is correct
26	Correct	115 ms	6088 KB	Output is correct
27	Correct	83 ms	6088 KB	Output is correct
28	Correct	101 ms	6188 KB	Output is correct
29	Correct	78 ms	6316 KB	Output is correct
30	Correct	108 ms	6316 KB	Output is correct
31	Correct	102 ms	6316 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5112 KB	Output is correct
2	Correct	7 ms	5280 KB	Output is correct
3	Correct	8 ms	5280 KB	Output is correct
4	Correct	7 ms	5340 KB	Output is correct
5	Correct	7 ms	5340 KB	Output is correct
6	Correct	8 ms	5340 KB	Output is correct
7	Correct	8 ms	5340 KB	Output is correct
8	Correct	7 ms	5456 KB	Output is correct
9	Correct	9 ms	5476 KB	Output is correct
10	Correct	7 ms	5476 KB	Output is correct
11	Correct	877 ms	22708 KB	Output is correct
12	Correct	877 ms	22708 KB	Output is correct
13	Correct	831 ms	22708 KB	Output is correct
14	Correct	812 ms	22708 KB	Output is correct
15	Correct	906 ms	22708 KB	Output is correct
16	Correct	857 ms	22708 KB	Output is correct
17	Correct	578 ms	23724 KB	Output is correct
18	Correct	622 ms	23724 KB	Output is correct
19	Correct	635 ms	23724 KB	Output is correct
20	Correct	518 ms	23724 KB	Output is correct
21	Correct	762 ms	23724 KB	Output is correct

Subtask #5
0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	5112 KB	Output is correct
2	Correct	7 ms	5280 KB	Output is correct
3	Correct	8 ms	5280 KB	Output is correct
4	Correct	7 ms	5340 KB	Output is correct
5	Correct	7 ms	5340 KB	Output is correct
6	Correct	8 ms	5340 KB	Output is correct
7	Correct	8 ms	5340 KB	Output is correct
8	Correct	7 ms	5456 KB	Output is correct
9	Correct	9 ms	5476 KB	Output is correct
10	Correct	7 ms	5476 KB	Output is correct
11	Correct	9 ms	5476 KB	Output is correct
12	Correct	8 ms	5476 KB	Output is correct
13	Correct	8 ms	5476 KB	Output is correct
14	Correct	8 ms	5476 KB	Output is correct
15	Correct	10 ms	5476 KB	Output is correct
16	Correct	8 ms	5476 KB	Output is correct
17	Correct	6 ms	5476 KB	Output is correct
18	Correct	10 ms	5476 KB	Output is correct
19	Correct	8 ms	5476 KB	Output is correct
20	Correct	7 ms	5476 KB	Output is correct
21	Correct	8 ms	5476 KB	Output is correct
22	Correct	98 ms	6088 KB	Output is correct
23	Correct	92 ms	6088 KB	Output is correct
24	Correct	83 ms	6088 KB	Output is correct
25	Correct	100 ms	6088 KB	Output is correct
26	Correct	115 ms	6088 KB	Output is correct
27	Correct	83 ms	6088 KB	Output is correct
28	Correct	101 ms	6188 KB	Output is correct
29	Correct	78 ms	6316 KB	Output is correct
30	Correct	108 ms	6316 KB	Output is correct
31	Correct	102 ms	6316 KB	Output is correct
32	Correct	877 ms	22708 KB	Output is correct
33	Correct	877 ms	22708 KB	Output is correct
34	Correct	831 ms	22708 KB	Output is correct
35	Correct	812 ms	22708 KB	Output is correct
36	Correct	906 ms	22708 KB	Output is correct
37	Correct	857 ms	22708 KB	Output is correct
38	Correct	578 ms	23724 KB	Output is correct
39	Correct	622 ms	23724 KB	Output is correct
40	Correct	635 ms	23724 KB	Output is correct
41	Correct	518 ms	23724 KB	Output is correct
42	Correct	762 ms	23724 KB	Output is correct
43	Correct	327 ms	23724 KB	Output is correct
44	Correct	356 ms	23724 KB	Output is correct
45	Execution timed out	2067 ms	23724 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

답안 #57810

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