oj.uz

Submission #207460

# Submission time Handle Problem Language Result Execution time Memory
207460 2020-03-07T15:01:11 Z mohamedsobhi777 Birthday gift (IZhO18_treearray) C++14
0 / 100
 13 ms 14456 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] ; 
}

void addL(int la , int ix)
{
    lcas[la].insert(ix) ;
}



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-1) ;
            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:114:17: warning: unused variable 'l' [-Wunused-variable]
             int l = st[C] , r = en[C] ;  
                 ^
treearray.cpp:114:29: warning: unused variable 'r' [-Wunused-variable]
             int l = st[C] , r = en[C] ;  
                             ^

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 14456 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 14456 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 14456 KB Wrong output format.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 14456 KB Wrong output format.
2 Halted 0 ms 0 KB -