oj.uz

Submission #207462

# Submission time Handle Problem Language Result Execution time Memory
207462 2020-03-07T15:02:52 Z mohamedsobhi777 Birthday gift (IZhO18_treearray) C++14
56 / 100
 4000 ms 55272 KB 
#include<bits/stdc++.h> 
 
using namespace std ;

const int N = 2e5 + 7 ; 

int n , t , m, q; 
vector<int> adj[N] ; 

vector<int> path; 
int st[N] , en[N] ; 
int a[N] , lcaA[N]; 
int col[N] , up[N][24]; 
set<int> lcas[N];


int isp(int x , int y )
{
    return (st[y]>=st[x] &&  en[y] <=en[x]);
}

void dfs(int x , int p)
{   
    st[x] = t++ ; 
    path.push_back(x);
    up[x][0] = p ; 
    for(int i = 1 ; i < 24 ; i++)
        up[x][i] = up[ up[x][i-1] ][i-1];
    for(auto u : adj[x])
    {       
        if(u==p)
        continue;
        dfs(u , x) ; 
    }
    en[x] = t++; 
    path.push_back(x) ; 
}

bool inside(int L, int R , int l , int r)
{
    return (l>=L && l<=R && r>=L && r<=R);
}

int lca(int x , int y)
{
    if(isp(x , y))
        return x ; 
    if(isp(y , x))
        return y ; 
    for(int i = 23 ; i>=0 ; i--)
    {
        if(!isp(up[x][i] , y))
            x = up[x][i] ; 
    }
    return up[x][0] ; 
}

int main() 
{
    //freopen("in.in" , "r" , stdin) ; 
    cin>>n>>m>>q; 
    for(int i = 0 ; i < n-1 ; i++)
    {
        int a, b ; 
        cin>>a>>b ; 
        adj[a].push_back(b) ; 
        adj[b].push_back(a) ; 
    }
    dfs(1 , 1) ; 
    for(int i = 0 ; i<m ; i++)
    {
        cin>>a[i] ; 
        if(i) 
        {
            int lc = lca(a[i] , a[i-1] ) ;
            lcaA[i] = lc; 
            lcas[lc].insert(i); 
        }
    }
    while(q--)
    {
        int idx , A , B; 
        cin>>idx>>A>>B ; 

        if(idx==1)
        {
            a[A-1] = B; 
            if(A>1)
            {
                lcas[ lcaA[ A-1 ] ] .erase(A-1) ; 
                int lc = lca(a[A-1] , a[A-2]) ; 
                lcaA[A-1] = lca(a[A-1] , a[A-2]) ; 
                lcas[lc].insert(A-1) ; 
            }
            if(A<m)
            {
                lcas[lcaA[A]].erase(A);
                int lc = lca(a[A] , a[A-1]) ; 
                lcas[lc].insert(A) ; 
                lcaA[A] = lca(a[A] , a[A-1]) ;
            }
        }
        else
        {
            int C; 
            cin>>C ; 
            int l = st[C] , r = en[C] ;  
            int nodeA = -2 , nodeB = -2;
            for(int i = A-1 ; i<=B-1 ;i++)
            {
                if(a[i]==C)
                {
                    nodeA = i ; 
                    nodeB = i ; 
                    break;
                }
            }
            set<int>::iterator u = lcas[C].lower_bound(A) ;
            if(u!=lcas[C].end())
            {
                if(*u<=B-1)
                {
                    nodeA = (*u) -1 ;
                    nodeB = *u;
                }
            }
            
            cout<<nodeA+1<<" " <<nodeB+1<<"\n" ; 
        }
        
    }
    return 0 ;  
}

Compilation message

treearray.cpp: In function 'int main()':
treearray.cpp:107:17: warning: unused variable 'l' [-Wunused-variable]
             int l = st[C] , r = en[C] ;  
                 ^
treearray.cpp:107:29: warning: unused variable 'r' [-Wunused-variable]
             int l = st[C] , r = en[C] ;  
                             ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB n=5
2 Correct 13 ms 14456 KB n=100
3 Correct 13 ms 14456 KB n=100
4 Correct 13 ms 14456 KB n=100
5 Correct 17 ms 14460 KB n=100
6 Correct 18 ms 14456 KB n=100
7 Correct 14 ms 14456 KB n=100
8 Correct 14 ms 14456 KB n=100
9 Correct 14 ms 14456 KB n=100
10 Correct 13 ms 14456 KB n=100
11 Correct 14 ms 14456 KB n=100
12 Correct 14 ms 14456 KB n=100
13 Correct 13 ms 14452 KB n=100
14 Correct 13 ms 14456 KB n=100
15 Correct 13 ms 14456 KB n=100
16 Correct 16 ms 14456 KB n=100
17 Correct 14 ms 14456 KB n=100
18 Correct 13 ms 14456 KB n=100
19 Correct 13 ms 14456 KB n=100
20 Correct 13 ms 14456 KB n=100
21 Correct 13 ms 14456 KB n=100
22 Correct 14 ms 14456 KB n=100
23 Correct 14 ms 14456 KB n=100
24 Correct 13 ms 14460 KB n=100
25 Correct 18 ms 14456 KB n=100
26 Correct 19 ms 14456 KB n=12
27 Correct 13 ms 14456 KB n=100

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB n=5
2 Correct 13 ms 14456 KB n=100
3 Correct 13 ms 14456 KB n=100
4 Correct 13 ms 14456 KB n=100
5 Correct 17 ms 14460 KB n=100
6 Correct 18 ms 14456 KB n=100
7 Correct 14 ms 14456 KB n=100
8 Correct 14 ms 14456 KB n=100
9 Correct 14 ms 14456 KB n=100
10 Correct 13 ms 14456 KB n=100
11 Correct 14 ms 14456 KB n=100
12 Correct 14 ms 14456 KB n=100
13 Correct 13 ms 14452 KB n=100
14 Correct 13 ms 14456 KB n=100
15 Correct 13 ms 14456 KB n=100
16 Correct 16 ms 14456 KB n=100
17 Correct 14 ms 14456 KB n=100
18 Correct 13 ms 14456 KB n=100
19 Correct 13 ms 14456 KB n=100
20 Correct 13 ms 14456 KB n=100
21 Correct 13 ms 14456 KB n=100
22 Correct 14 ms 14456 KB n=100
23 Correct 14 ms 14456 KB n=100
24 Correct 13 ms 14460 KB n=100
25 Correct 18 ms 14456 KB n=100
26 Correct 19 ms 14456 KB n=12
27 Correct 13 ms 14456 KB n=100
28 Correct 15 ms 14584 KB n=500
29 Correct 15 ms 14584 KB n=500
30 Correct 15 ms 14584 KB n=500
31 Correct 17 ms 14588 KB n=500
32 Correct 18 ms 14584 KB n=500
33 Correct 15 ms 14584 KB n=500
34 Correct 15 ms 14584 KB n=500
35 Correct 15 ms 14584 KB n=500
36 Correct 16 ms 14584 KB n=500
37 Correct 20 ms 14584 KB n=500
38 Correct 16 ms 14584 KB n=500
39 Correct 16 ms 14584 KB n=500
40 Correct 16 ms 14584 KB n=500
41 Correct 17 ms 14584 KB n=500
42 Correct 15 ms 14584 KB n=500
43 Correct 17 ms 14584 KB n=500
44 Correct 15 ms 14584 KB n=500
45 Correct 18 ms 14584 KB n=500
46 Correct 17 ms 14584 KB n=500
47 Correct 16 ms 14584 KB n=500
48 Correct 15 ms 14584 KB n=500
49 Correct 16 ms 14584 KB n=500
50 Correct 16 ms 14584 KB n=500
51 Correct 15 ms 14584 KB n=500
52 Correct 15 ms 14588 KB n=500
53 Correct 17 ms 14584 KB n=500
54 Correct 18 ms 14584 KB n=500
55 Correct 15 ms 14584 KB n=278
56 Correct 17 ms 14584 KB n=500
57 Correct 15 ms 14584 KB n=500
58 Correct 16 ms 14584 KB n=500

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB n=5
2 Correct 13 ms 14456 KB n=100
3 Correct 13 ms 14456 KB n=100
4 Correct 13 ms 14456 KB n=100
5 Correct 17 ms 14460 KB n=100
6 Correct 18 ms 14456 KB n=100
7 Correct 14 ms 14456 KB n=100
8 Correct 14 ms 14456 KB n=100
9 Correct 14 ms 14456 KB n=100
10 Correct 13 ms 14456 KB n=100
11 Correct 14 ms 14456 KB n=100
12 Correct 14 ms 14456 KB n=100
13 Correct 13 ms 14452 KB n=100
14 Correct 13 ms 14456 KB n=100
15 Correct 13 ms 14456 KB n=100
16 Correct 16 ms 14456 KB n=100
17 Correct 14 ms 14456 KB n=100
18 Correct 13 ms 14456 KB n=100
19 Correct 13 ms 14456 KB n=100
20 Correct 13 ms 14456 KB n=100
21 Correct 13 ms 14456 KB n=100
22 Correct 14 ms 14456 KB n=100
23 Correct 14 ms 14456 KB n=100
24 Correct 13 ms 14460 KB n=100
25 Correct 18 ms 14456 KB n=100
26 Correct 19 ms 14456 KB n=12
27 Correct 13 ms 14456 KB n=100
28 Correct 15 ms 14584 KB n=500
29 Correct 15 ms 14584 KB n=500
30 Correct 15 ms 14584 KB n=500
31 Correct 17 ms 14588 KB n=500
32 Correct 18 ms 14584 KB n=500
33 Correct 15 ms 14584 KB n=500
34 Correct 15 ms 14584 KB n=500
35 Correct 15 ms 14584 KB n=500
36 Correct 16 ms 14584 KB n=500
37 Correct 20 ms 14584 KB n=500
38 Correct 16 ms 14584 KB n=500
39 Correct 16 ms 14584 KB n=500
40 Correct 16 ms 14584 KB n=500
41 Correct 17 ms 14584 KB n=500
42 Correct 15 ms 14584 KB n=500
43 Correct 17 ms 14584 KB n=500
44 Correct 15 ms 14584 KB n=500
45 Correct 18 ms 14584 KB n=500
46 Correct 17 ms 14584 KB n=500
47 Correct 16 ms 14584 KB n=500
48 Correct 15 ms 14584 KB n=500
49 Correct 16 ms 14584 KB n=500
50 Correct 16 ms 14584 KB n=500
51 Correct 15 ms 14584 KB n=500
52 Correct 15 ms 14588 KB n=500
53 Correct 17 ms 14584 KB n=500
54 Correct 18 ms 14584 KB n=500
55 Correct 15 ms 14584 KB n=278
56 Correct 17 ms 14584 KB n=500
57 Correct 15 ms 14584 KB n=500
58 Correct 16 ms 14584 KB n=500
59 Correct 22 ms 14840 KB n=2000
60 Correct 21 ms 14968 KB n=2000
61 Correct 22 ms 14840 KB n=2000
62 Correct 27 ms 14840 KB n=2000
63 Correct 25 ms 14844 KB n=2000
64 Correct 23 ms 14840 KB n=2000
65 Correct 23 ms 14840 KB n=2000
66 Correct 22 ms 14972 KB n=2000
67 Correct 23 ms 14840 KB n=2000
68 Correct 22 ms 14840 KB n=2000
69 Correct 26 ms 14840 KB n=2000
70 Correct 27 ms 14840 KB n=2000
71 Correct 27 ms 14840 KB n=2000
72 Correct 28 ms 14840 KB n=2000
73 Correct 30 ms 14840 KB n=2000
74 Correct 21 ms 14840 KB n=1844
75 Correct 25 ms 14840 KB n=2000
76 Correct 24 ms 14840 KB n=2000
77 Correct 25 ms 14840 KB n=2000
78 Correct 24 ms 14840 KB n=2000
79 Correct 25 ms 14840 KB n=2000
80 Correct 21 ms 14840 KB n=2000
81 Correct 29 ms 14816 KB n=2000
82 Correct 24 ms 14840 KB n=2000
83 Correct 22 ms 14968 KB n=2000
84 Correct 22 ms 14840 KB n=2000
85 Correct 23 ms 14840 KB n=2000
86 Correct 22 ms 14840 KB n=2000
87 Correct 23 ms 14840 KB n=2000
88 Correct 22 ms 14968 KB n=2000
89 Correct 23 ms 14968 KB n=2000
90 Correct 22 ms 14968 KB n=2000
91 Correct 26 ms 14840 KB n=2000

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB n=5
2 Correct 13 ms 14456 KB n=100
3 Correct 13 ms 14456 KB n=100
4 Correct 13 ms 14456 KB n=100
5 Correct 17 ms 14460 KB n=100
6 Correct 18 ms 14456 KB n=100
7 Correct 14 ms 14456 KB n=100
8 Correct 14 ms 14456 KB n=100
9 Correct 14 ms 14456 KB n=100
10 Correct 13 ms 14456 KB n=100
11 Correct 14 ms 14456 KB n=100
12 Correct 14 ms 14456 KB n=100
13 Correct 13 ms 14452 KB n=100
14 Correct 13 ms 14456 KB n=100
15 Correct 13 ms 14456 KB n=100
16 Correct 16 ms 14456 KB n=100
17 Correct 14 ms 14456 KB n=100
18 Correct 13 ms 14456 KB n=100
19 Correct 13 ms 14456 KB n=100
20 Correct 13 ms 14456 KB n=100
21 Correct 13 ms 14456 KB n=100
22 Correct 14 ms 14456 KB n=100
23 Correct 14 ms 14456 KB n=100
24 Correct 13 ms 14460 KB n=100
25 Correct 18 ms 14456 KB n=100
26 Correct 19 ms 14456 KB n=12
27 Correct 13 ms 14456 KB n=100
28 Correct 15 ms 14584 KB n=500
29 Correct 15 ms 14584 KB n=500
30 Correct 15 ms 14584 KB n=500
31 Correct 17 ms 14588 KB n=500
32 Correct 18 ms 14584 KB n=500
33 Correct 15 ms 14584 KB n=500
34 Correct 15 ms 14584 KB n=500
35 Correct 15 ms 14584 KB n=500
36 Correct 16 ms 14584 KB n=500
37 Correct 20 ms 14584 KB n=500
38 Correct 16 ms 14584 KB n=500
39 Correct 16 ms 14584 KB n=500
40 Correct 16 ms 14584 KB n=500
41 Correct 17 ms 14584 KB n=500
42 Correct 15 ms 14584 KB n=500
43 Correct 17 ms 14584 KB n=500
44 Correct 15 ms 14584 KB n=500
45 Correct 18 ms 14584 KB n=500
46 Correct 17 ms 14584 KB n=500
47 Correct 16 ms 14584 KB n=500
48 Correct 15 ms 14584 KB n=500
49 Correct 16 ms 14584 KB n=500
50 Correct 16 ms 14584 KB n=500
51 Correct 15 ms 14584 KB n=500
52 Correct 15 ms 14588 KB n=500
53 Correct 17 ms 14584 KB n=500
54 Correct 18 ms 14584 KB n=500
55 Correct 15 ms 14584 KB n=278
56 Correct 17 ms 14584 KB n=500
57 Correct 15 ms 14584 KB n=500
58 Correct 16 ms 14584 KB n=500
59 Correct 22 ms 14840 KB n=2000
60 Correct 21 ms 14968 KB n=2000
61 Correct 22 ms 14840 KB n=2000
62 Correct 27 ms 14840 KB n=2000
63 Correct 25 ms 14844 KB n=2000
64 Correct 23 ms 14840 KB n=2000
65 Correct 23 ms 14840 KB n=2000
66 Correct 22 ms 14972 KB n=2000
67 Correct 23 ms 14840 KB n=2000
68 Correct 22 ms 14840 KB n=2000
69 Correct 26 ms 14840 KB n=2000
70 Correct 27 ms 14840 KB n=2000
71 Correct 27 ms 14840 KB n=2000
72 Correct 28 ms 14840 KB n=2000
73 Correct 30 ms 14840 KB n=2000
74 Correct 21 ms 14840 KB n=1844
75 Correct 25 ms 14840 KB n=2000
76 Correct 24 ms 14840 KB n=2000
77 Correct 25 ms 14840 KB n=2000
78 Correct 24 ms 14840 KB n=2000
79 Correct 25 ms 14840 KB n=2000
80 Correct 21 ms 14840 KB n=2000
81 Correct 29 ms 14816 KB n=2000
82 Correct 24 ms 14840 KB n=2000
83 Correct 22 ms 14968 KB n=2000
84 Correct 22 ms 14840 KB n=2000
85 Correct 23 ms 14840 KB n=2000
86 Correct 22 ms 14840 KB n=2000
87 Correct 23 ms 14840 KB n=2000
88 Correct 22 ms 14968 KB n=2000
89 Correct 23 ms 14968 KB n=2000
90 Correct 22 ms 14968 KB n=2000
91 Correct 26 ms 14840 KB n=2000
92 Execution timed out 4070 ms 55272 KB Time limit exceeded
93 Halted 0 ms 0 KB -