oj.uz

Submission #78353

# Submission time Handle Problem Language Result Execution time Memory
78353 2018-10-04T00:00:05 Z ansol4328 None (KOI16_tree) C++
100 / 100
 668 ms 41416 KB 
#include<stdio.h>
#include<memory.h>
#include<vector>
#include<algorithm>
#define SIZE 524288
 
using namespace std;
 
struct seg_tree
{
    int limit[SIZE+2], base;
    void setup(int a)
    {
        base=1;
        while(base<a) base*=2;
        for(int i=1 ; i<=base*2 ; i++) limit[i]=1;
        base--;
    }
    void propagate(int ns, int nf, int num)
    {
        if(limit[num]!=1)
        {
            if(ns<nf)
            {
                limit[num*2]=max(limit[num*2],limit[num]);
                limit[num*2+1]=max(limit[num*2+1],limit[num]);
            }
        }
    }
    int get_limit(int st, int fn, int ns, int nf, int num)
    {
        propagate(ns,nf,num);
        if(ns>fn || nf<st) return 1;
        if(st<=ns && nf<=fn) return limit[num];
        int mid=(ns+nf)/2;
        return max(get_limit(st,fn,ns,mid,num*2),get_limit(st,fn,mid+1,nf,num*2+1));
    }
    void update(int st ,int fn, int ns, int nf, int num, int val)
    {
        propagate(ns,nf,num);
        if(ns>fn || nf<st) return;
        if(st<=ns && nf<=fn)
        {
            limit[num]=max(limit[num],val);
            propagate(ns,nf,num);
            return;
        }
        int mid=(ns+nf)/2;
        update(st,fn,ns,mid,num*2,val);
        update(st,fn,mid+1,nf,num*2+1,val);
    }
};
 
int n, qn;
vector<vector<int> > lst;
int depth[200002], par[200002][18];
int dfsn[200002], cnt, enode[200002]; // dfs-order renumbering
seg_tree T;
 
void dfs(int v, int d)
{
    dfsn[v]=++cnt;
    depth[v]=d;
    for(int i=0 ; i<lst[v].size() ; i++)
    {
        int nxt=lst[v][i];
        if(!depth[nxt])
        {
            par[nxt][0]=v;
            dfs(nxt,d+1);
        }
    }
    enode[v]=cnt;
}
 
bool pos(int b, int c)
{
    if(depth[b]<depth[c]) swap(b,c);
    int gap=depth[b]-depth[c], idx=0;
    while(gap!=0)
    {
        if(gap%2==1)
        {
            int limit=T.get_limit(dfsn[b],dfsn[b],1,T.base+1,1);
            b=par[b][idx];
            if(limit>depth[b]) return false;
        }
        gap/=2, idx++;
    }
    if(b==c) return true;
    for(int i=17 ; i>=0 ; i--)
    {
        if(par[b][i]!=par[c][i])
        {
            int limit_b=T.get_limit(dfsn[b],dfsn[b],1,T.base+1,1);
            b=par[b][i];
            int limit_c=T.get_limit(dfsn[c],dfsn[c],1,T.base+1,1);
            c=par[c][i];
            if(limit_b>depth[b] || limit_c>depth[c]) return false;
        }
    }
    int limit_b=T.get_limit(dfsn[b],dfsn[b],1,T.base+1,1);
    b=par[b][0];
    int limit_c=T.get_limit(dfsn[c],dfsn[c],1,T.base+1,1);
    c=par[c][0];
    if(limit_b>depth[b] || limit_c>depth[c]) return false;
    return true;
}
 
int main()
{
    scanf("%d %d",&n,&qn);
    lst.resize(n+1);
    for(int i=2 ; i<=n ; i++)
    {
        int x;
        scanf("%d",&x);
        lst[x].push_back(i);
        lst[i].push_back(x);
    }
    T.setup(n);
    memset(par,-1,sizeof(par));
    dfs(1,1);
    for(int i=1 ; i<=n ; i++) lst[i].clear();
    lst.resize(0);
    for(int j=1 ; j<18 ; j++)
    {
        for(int i=1 ; i<=n ; i++) if(par[i][j-1]!=-1) par[i][j]=par[par[i][j-1]][j-1];
    }
    for(int i=0 ; i<qn ; i++)
    {
        int b, c, d;
        scanf("%d %d %d",&b,&c,&d);
        bool tf=pos(b,c);
        printf("%s\n",tf ? "YES" : "NO");
        if(d==1)
        {
            if(tf) T.update(dfsn[b],enode[b],1,T.base+1,1,depth[b]);
            else T.update(dfsn[c],enode[c],1,T.base+1,1,depth[c]);
        }
    }
    return 0;
}

Compilation message

tree.cpp: In function 'void dfs(int, int)':
tree.cpp:64:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0 ; i<lst[v].size() ; i++)
                   ~^~~~~~~~~~~~~~
tree.cpp: In function 'int main()':
tree.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&qn);
     ~~~~~^~~~~~~~~~~~~~~~
tree.cpp:117:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
         ~~~~~^~~~~~~~~
tree.cpp:133:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&b,&c,&d);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14636 KB Output is correct
3 Correct 14 ms 14920 KB Output is correct
4 Correct 15 ms 14920 KB Output is correct
5 Correct 15 ms 14920 KB Output is correct
6 Correct 14 ms 14920 KB Output is correct
7 Correct 14 ms 14980 KB Output is correct
8 Correct 14 ms 15012 KB Output is correct
9 Correct 14 ms 15012 KB Output is correct
10 Correct 14 ms 15012 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14636 KB Output is correct
3 Correct 14 ms 14920 KB Output is correct
4 Correct 15 ms 14920 KB Output is correct
5 Correct 15 ms 14920 KB Output is correct
6 Correct 14 ms 14920 KB Output is correct
7 Correct 14 ms 14980 KB Output is correct
8 Correct 14 ms 15012 KB Output is correct
9 Correct 14 ms 15012 KB Output is correct
10 Correct 14 ms 15012 KB Output is correct
11 Correct 14 ms 15012 KB Output is correct
12 Correct 15 ms 15012 KB Output is correct
13 Correct 15 ms 15012 KB Output is correct
14 Correct 19 ms 15012 KB Output is correct
15 Correct 15 ms 15012 KB Output is correct
16 Correct 15 ms 15012 KB Output is correct
17 Correct 15 ms 15012 KB Output is correct
18 Correct 15 ms 15012 KB Output is correct
19 Correct 15 ms 15012 KB Output is correct
20 Correct 15 ms 15132 KB Output is correct
21 Correct 14 ms 15132 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14636 KB Output is correct
3 Correct 14 ms 14920 KB Output is correct
4 Correct 15 ms 14920 KB Output is correct
5 Correct 15 ms 14920 KB Output is correct
6 Correct 14 ms 14920 KB Output is correct
7 Correct 14 ms 14980 KB Output is correct
8 Correct 14 ms 15012 KB Output is correct
9 Correct 14 ms 15012 KB Output is correct
10 Correct 14 ms 15012 KB Output is correct
11 Correct 14 ms 15012 KB Output is correct
12 Correct 15 ms 15012 KB Output is correct
13 Correct 15 ms 15012 KB Output is correct
14 Correct 19 ms 15012 KB Output is correct
15 Correct 15 ms 15012 KB Output is correct
16 Correct 15 ms 15012 KB Output is correct
17 Correct 15 ms 15012 KB Output is correct
18 Correct 15 ms 15012 KB Output is correct
19 Correct 15 ms 15012 KB Output is correct
20 Correct 15 ms 15132 KB Output is correct
21 Correct 14 ms 15132 KB Output is correct
22 Correct 160 ms 16072 KB Output is correct
23 Correct 165 ms 16100 KB Output is correct
24 Correct 177 ms 16212 KB Output is correct
25 Correct 157 ms 16212 KB Output is correct
26 Correct 159 ms 16212 KB Output is correct
27 Correct 221 ms 16212 KB Output is correct
28 Correct 231 ms 16212 KB Output is correct
29 Correct 215 ms 16264 KB Output is correct
30 Correct 330 ms 16340 KB Output is correct
31 Correct 259 ms 16340 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14636 KB Output is correct
3 Correct 14 ms 14920 KB Output is correct
4 Correct 15 ms 14920 KB Output is correct
5 Correct 15 ms 14920 KB Output is correct
6 Correct 14 ms 14920 KB Output is correct
7 Correct 14 ms 14980 KB Output is correct
8 Correct 14 ms 15012 KB Output is correct
9 Correct 14 ms 15012 KB Output is correct
10 Correct 14 ms 15012 KB Output is correct
11 Correct 503 ms 40744 KB Output is correct
12 Correct 553 ms 40788 KB Output is correct
13 Correct 565 ms 40788 KB Output is correct
14 Correct 514 ms 40864 KB Output is correct
15 Correct 539 ms 40864 KB Output is correct
16 Correct 594 ms 41256 KB Output is correct
17 Correct 480 ms 41416 KB Output is correct
18 Correct 481 ms 41416 KB Output is correct
19 Correct 499 ms 41416 KB Output is correct
20 Correct 502 ms 41416 KB Output is correct
21 Correct 668 ms 41416 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14636 KB Output is correct
3 Correct 14 ms 14920 KB Output is correct
4 Correct 15 ms 14920 KB Output is correct
5 Correct 15 ms 14920 KB Output is correct
6 Correct 14 ms 14920 KB Output is correct
7 Correct 14 ms 14980 KB Output is correct
8 Correct 14 ms 15012 KB Output is correct
9 Correct 14 ms 15012 KB Output is correct
10 Correct 14 ms 15012 KB Output is correct
11 Correct 14 ms 15012 KB Output is correct
12 Correct 15 ms 15012 KB Output is correct
13 Correct 15 ms 15012 KB Output is correct
14 Correct 19 ms 15012 KB Output is correct
15 Correct 15 ms 15012 KB Output is correct
16 Correct 15 ms 15012 KB Output is correct
17 Correct 15 ms 15012 KB Output is correct
18 Correct 15 ms 15012 KB Output is correct
19 Correct 15 ms 15012 KB Output is correct
20 Correct 15 ms 15132 KB Output is correct
21 Correct 14 ms 15132 KB Output is correct
22 Correct 160 ms 16072 KB Output is correct
23 Correct 165 ms 16100 KB Output is correct
24 Correct 177 ms 16212 KB Output is correct
25 Correct 157 ms 16212 KB Output is correct
26 Correct 159 ms 16212 KB Output is correct
27 Correct 221 ms 16212 KB Output is correct
28 Correct 231 ms 16212 KB Output is correct
29 Correct 215 ms 16264 KB Output is correct
30 Correct 330 ms 16340 KB Output is correct
31 Correct 259 ms 16340 KB Output is correct
32 Correct 503 ms 40744 KB Output is correct
33 Correct 553 ms 40788 KB Output is correct
34 Correct 565 ms 40788 KB Output is correct
35 Correct 514 ms 40864 KB Output is correct
36 Correct 539 ms 40864 KB Output is correct
37 Correct 594 ms 41256 KB Output is correct
38 Correct 480 ms 41416 KB Output is correct
39 Correct 481 ms 41416 KB Output is correct
40 Correct 499 ms 41416 KB Output is correct
41 Correct 502 ms 41416 KB Output is correct
42 Correct 668 ms 41416 KB Output is correct
43 Correct 428 ms 41416 KB Output is correct
44 Correct 415 ms 41416 KB Output is correct
45 Correct 442 ms 41416 KB Output is correct
46 Correct 472 ms 41416 KB Output is correct
47 Correct 445 ms 41416 KB Output is correct
48 Correct 290 ms 41416 KB Output is correct
49 Correct 341 ms 41416 KB Output is correct
50 Correct 344 ms 41416 KB Output is correct
51 Correct 429 ms 41416 KB Output is correct