oj.uz

Submission #78253

# Submission time Handle Problem Language Result Execution time Memory
78253 2018-10-03T09:21:10 Z ansol4328 None (KOI16_tree) C++
36 / 100
 717 ms 66560 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<int> lst[200002];
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);
    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 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:116:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&x);
         ~~~~~^~~~~~~~~
tree.cpp:130: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 19 ms 19192 KB Output is correct
2 Correct 19 ms 19340 KB Output is correct
3 Correct 19 ms 19428 KB Output is correct
4 Correct 19 ms 19428 KB Output is correct
5 Correct 24 ms 19448 KB Output is correct
6 Correct 20 ms 19448 KB Output is correct
7 Correct 19 ms 19504 KB Output is correct
8 Correct 19 ms 19504 KB Output is correct
9 Correct 19 ms 19612 KB Output is correct
10 Correct 20 ms 19612 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 19 ms 19340 KB Output is correct
3 Correct 19 ms 19428 KB Output is correct
4 Correct 19 ms 19428 KB Output is correct
5 Correct 24 ms 19448 KB Output is correct
6 Correct 20 ms 19448 KB Output is correct
7 Correct 19 ms 19504 KB Output is correct
8 Correct 19 ms 19504 KB Output is correct
9 Correct 19 ms 19612 KB Output is correct
10 Correct 20 ms 19612 KB Output is correct
11 Correct 18 ms 19612 KB Output is correct
12 Correct 20 ms 19612 KB Output is correct
13 Correct 21 ms 19628 KB Output is correct
14 Correct 19 ms 19644 KB Output is correct
15 Correct 21 ms 19660 KB Output is correct
16 Correct 19 ms 19676 KB Output is correct
17 Correct 19 ms 19692 KB Output is correct
18 Correct 20 ms 19708 KB Output is correct
19 Correct 19 ms 19724 KB Output is correct
20 Correct 23 ms 19756 KB Output is correct
21 Correct 20 ms 19772 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 19 ms 19340 KB Output is correct
3 Correct 19 ms 19428 KB Output is correct
4 Correct 19 ms 19428 KB Output is correct
5 Correct 24 ms 19448 KB Output is correct
6 Correct 20 ms 19448 KB Output is correct
7 Correct 19 ms 19504 KB Output is correct
8 Correct 19 ms 19504 KB Output is correct
9 Correct 19 ms 19612 KB Output is correct
10 Correct 20 ms 19612 KB Output is correct
11 Correct 18 ms 19612 KB Output is correct
12 Correct 20 ms 19612 KB Output is correct
13 Correct 21 ms 19628 KB Output is correct
14 Correct 19 ms 19644 KB Output is correct
15 Correct 21 ms 19660 KB Output is correct
16 Correct 19 ms 19676 KB Output is correct
17 Correct 19 ms 19692 KB Output is correct
18 Correct 20 ms 19708 KB Output is correct
19 Correct 19 ms 19724 KB Output is correct
20 Correct 23 ms 19756 KB Output is correct
21 Correct 20 ms 19772 KB Output is correct
22 Correct 180 ms 20940 KB Output is correct
23 Correct 179 ms 20940 KB Output is correct
24 Correct 178 ms 20940 KB Output is correct
25 Correct 177 ms 20940 KB Output is correct
26 Correct 189 ms 20940 KB Output is correct
27 Correct 223 ms 20940 KB Output is correct
28 Correct 232 ms 20944 KB Output is correct
29 Correct 239 ms 20944 KB Output is correct
30 Correct 312 ms 21116 KB Output is correct
31 Correct 269 ms 21116 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 19 ms 19340 KB Output is correct
3 Correct 19 ms 19428 KB Output is correct
4 Correct 19 ms 19428 KB Output is correct
5 Correct 24 ms 19448 KB Output is correct
6 Correct 20 ms 19448 KB Output is correct
7 Correct 19 ms 19504 KB Output is correct
8 Correct 19 ms 19504 KB Output is correct
9 Correct 19 ms 19612 KB Output is correct
10 Correct 20 ms 19612 KB Output is correct
11 Correct 551 ms 40752 KB Output is correct
12 Correct 547 ms 40752 KB Output is correct
13 Correct 531 ms 40752 KB Output is correct
14 Correct 595 ms 40752 KB Output is correct
15 Correct 567 ms 40752 KB Output is correct
16 Correct 717 ms 45112 KB Output is correct
17 Correct 504 ms 49856 KB Output is correct
18 Correct 531 ms 54304 KB Output is correct
19 Correct 535 ms 58748 KB Output is correct
20 Correct 503 ms 63424 KB Output is correct
21 Runtime error 629 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 19 ms 19340 KB Output is correct
3 Correct 19 ms 19428 KB Output is correct
4 Correct 19 ms 19428 KB Output is correct
5 Correct 24 ms 19448 KB Output is correct
6 Correct 20 ms 19448 KB Output is correct
7 Correct 19 ms 19504 KB Output is correct
8 Correct 19 ms 19504 KB Output is correct
9 Correct 19 ms 19612 KB Output is correct
10 Correct 20 ms 19612 KB Output is correct
11 Correct 18 ms 19612 KB Output is correct
12 Correct 20 ms 19612 KB Output is correct
13 Correct 21 ms 19628 KB Output is correct
14 Correct 19 ms 19644 KB Output is correct
15 Correct 21 ms 19660 KB Output is correct
16 Correct 19 ms 19676 KB Output is correct
17 Correct 19 ms 19692 KB Output is correct
18 Correct 20 ms 19708 KB Output is correct
19 Correct 19 ms 19724 KB Output is correct
20 Correct 23 ms 19756 KB Output is correct
21 Correct 20 ms 19772 KB Output is correct
22 Correct 180 ms 20940 KB Output is correct
23 Correct 179 ms 20940 KB Output is correct
24 Correct 178 ms 20940 KB Output is correct
25 Correct 177 ms 20940 KB Output is correct
26 Correct 189 ms 20940 KB Output is correct
27 Correct 223 ms 20940 KB Output is correct
28 Correct 232 ms 20944 KB Output is correct
29 Correct 239 ms 20944 KB Output is correct
30 Correct 312 ms 21116 KB Output is correct
31 Correct 269 ms 21116 KB Output is correct
32 Correct 551 ms 40752 KB Output is correct
33 Correct 547 ms 40752 KB Output is correct
34 Correct 531 ms 40752 KB Output is correct
35 Correct 595 ms 40752 KB Output is correct
36 Correct 567 ms 40752 KB Output is correct
37 Correct 717 ms 45112 KB Output is correct
38 Correct 504 ms 49856 KB Output is correct
39 Correct 531 ms 54304 KB Output is correct
40 Correct 535 ms 58748 KB Output is correct
41 Correct 503 ms 63424 KB Output is correct
42 Runtime error 629 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.