oj.uz

Submission #57848

# Submission time Handle Problem Language Result Execution time Memory
57848 2018-07-16T10:35:03 Z red1108 None (KOI16_tree) C++17
55 / 100
 2000 ms 26776 KB 
#include <stdio.h>
#include <vector>
#include <set>
using namespace std;
int n,q;
vector<int> tree[200010];
long long seg[800010];
int 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;
    }
}
long long getsize(int x, int l, int r, int s, int e)
{
    if(l>r||e<l||r<s||l<0||r<0)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()
{
    /*
    freopen("input35", "r",stdin);
    freopen("output.txt", "w", stdout);
    */
    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:46: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:60: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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 9 ms 5224 KB Output is correct
3 Correct 8 ms 5224 KB Output is correct
4 Correct 7 ms 5260 KB Output is correct
5 Correct 8 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 8 ms 5260 KB Output is correct
8 Correct 8 ms 5260 KB Output is correct
9 Correct 9 ms 5280 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 9 ms 5224 KB Output is correct
3 Correct 8 ms 5224 KB Output is correct
4 Correct 7 ms 5260 KB Output is correct
5 Correct 8 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 8 ms 5260 KB Output is correct
8 Correct 8 ms 5260 KB Output is correct
9 Correct 9 ms 5280 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct
11 Correct 9 ms 5356 KB Output is correct
12 Correct 8 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 8 ms 5356 KB Output is correct
15 Correct 7 ms 5360 KB Output is correct
16 Correct 6 ms 5372 KB Output is correct
17 Correct 6 ms 5372 KB Output is correct
18 Correct 8 ms 5372 KB Output is correct
19 Correct 6 ms 5372 KB Output is correct
20 Correct 7 ms 5372 KB Output is correct
21 Correct 8 ms 5372 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 9 ms 5224 KB Output is correct
3 Correct 8 ms 5224 KB Output is correct
4 Correct 7 ms 5260 KB Output is correct
5 Correct 8 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 8 ms 5260 KB Output is correct
8 Correct 8 ms 5260 KB Output is correct
9 Correct 9 ms 5280 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct
11 Correct 9 ms 5356 KB Output is correct
12 Correct 8 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 8 ms 5356 KB Output is correct
15 Correct 7 ms 5360 KB Output is correct
16 Correct 6 ms 5372 KB Output is correct
17 Correct 6 ms 5372 KB Output is correct
18 Correct 8 ms 5372 KB Output is correct
19 Correct 6 ms 5372 KB Output is correct
20 Correct 7 ms 5372 KB Output is correct
21 Correct 8 ms 5372 KB Output is correct
22 Correct 97 ms 6140 KB Output is correct
23 Correct 99 ms 6140 KB Output is correct
24 Correct 111 ms 6140 KB Output is correct
25 Correct 92 ms 6140 KB Output is correct
26 Correct 91 ms 6140 KB Output is correct
27 Correct 98 ms 6236 KB Output is correct
28 Correct 96 ms 6236 KB Output is correct
29 Correct 92 ms 6236 KB Output is correct
30 Correct 88 ms 6332 KB Output is correct
31 Correct 80 ms 6332 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 9 ms 5224 KB Output is correct
3 Correct 8 ms 5224 KB Output is correct
4 Correct 7 ms 5260 KB Output is correct
5 Correct 8 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 8 ms 5260 KB Output is correct
8 Correct 8 ms 5260 KB Output is correct
9 Correct 9 ms 5280 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct
11 Correct 763 ms 25108 KB Output is correct
12 Correct 686 ms 25108 KB Output is correct
13 Correct 719 ms 25108 KB Output is correct
14 Correct 925 ms 25152 KB Output is correct
15 Correct 799 ms 25152 KB Output is correct
16 Correct 789 ms 25152 KB Output is correct
17 Correct 579 ms 26556 KB Output is correct
18 Correct 539 ms 26556 KB Output is correct
19 Correct 517 ms 26556 KB Output is correct
20 Correct 453 ms 26776 KB Output is correct
21 Correct 666 ms 26776 KB Output is correct

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 9 ms 5224 KB Output is correct
3 Correct 8 ms 5224 KB Output is correct
4 Correct 7 ms 5260 KB Output is correct
5 Correct 8 ms 5260 KB Output is correct
6 Correct 8 ms 5260 KB Output is correct
7 Correct 8 ms 5260 KB Output is correct
8 Correct 8 ms 5260 KB Output is correct
9 Correct 9 ms 5280 KB Output is correct
10 Correct 7 ms 5332 KB Output is correct
11 Correct 9 ms 5356 KB Output is correct
12 Correct 8 ms 5356 KB Output is correct
13 Correct 8 ms 5356 KB Output is correct
14 Correct 8 ms 5356 KB Output is correct
15 Correct 7 ms 5360 KB Output is correct
16 Correct 6 ms 5372 KB Output is correct
17 Correct 6 ms 5372 KB Output is correct
18 Correct 8 ms 5372 KB Output is correct
19 Correct 6 ms 5372 KB Output is correct
20 Correct 7 ms 5372 KB Output is correct
21 Correct 8 ms 5372 KB Output is correct
22 Correct 97 ms 6140 KB Output is correct
23 Correct 99 ms 6140 KB Output is correct
24 Correct 111 ms 6140 KB Output is correct
25 Correct 92 ms 6140 KB Output is correct
26 Correct 91 ms 6140 KB Output is correct
27 Correct 98 ms 6236 KB Output is correct
28 Correct 96 ms 6236 KB Output is correct
29 Correct 92 ms 6236 KB Output is correct
30 Correct 88 ms 6332 KB Output is correct
31 Correct 80 ms 6332 KB Output is correct
32 Correct 763 ms 25108 KB Output is correct
33 Correct 686 ms 25108 KB Output is correct
34 Correct 719 ms 25108 KB Output is correct
35 Correct 925 ms 25152 KB Output is correct
36 Correct 799 ms 25152 KB Output is correct
37 Correct 789 ms 25152 KB Output is correct
38 Correct 579 ms 26556 KB Output is correct
39 Correct 539 ms 26556 KB Output is correct
40 Correct 517 ms 26556 KB Output is correct
41 Correct 453 ms 26776 KB Output is correct
42 Correct 666 ms 26776 KB Output is correct
43 Correct 412 ms 26776 KB Output is correct
44 Correct 354 ms 26776 KB Output is correct
45 Execution timed out 2059 ms 26776 KB Time limit exceeded
46 Halted 0 ms 0 KB -