oj.uz

Submission #559975

# Submission time Handle Problem Language Result Execution time Memory
559975 2022-05-11T01:53:21 Z zaneyu Birthday gift (IZhO18_treearray) C++14
0 / 100
 29 ms 47392 KB 
/*input
5 4 5
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
2 1 3 1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef unsigned long long int ll;

#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=4e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
vector<int> v[maxn];
int dep[maxn];
vector<int> euler;
int in[maxn];
int table[maxn][20];
int mn(int a,int b){
    if(dep[a]>dep[b]) return b;
    return a;
}
void dfs(int u,int p){
    in[u]=sz(euler);
    euler.pb(u);
    for(int x:v[u]){
        if(x==p) continue;
        dep[x]=dep[u]+1;
        euler.pb(u);
        dfs(x,u);
    }
}
int lca(int a,int b){
    a=in[a],b=in[b];
    if(a>b) swap(a,b);
    int len=__lg(b-a+1);
    return mn(table[a][len],table[b-(1<<len)+1][len]);
}
void pre(int n){
    n=2*n-1;
    REP(i,n) table[i][0]=euler[i];
    REP1(j,19){
        REP(i,n){
            if(i+(1<<j)>n) break;
            table[i][j]=mn(table[i][j-1],table[i+(1<<(j-1))][j-1]);
        }
    }
}
set<int> s[maxn],s2[maxn];
int arr[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    REP(i,n-1){
        int a,b;
        cin>>a>>b;
        --a,--b;
        v[a].pb(b),v[b].pb(a);
    }
    REP(i,n) s[i].insert(n+1),s2[i].insert(n+1);
    dfs(0,-1);
    pre(n);
    REP(i,m){
        cin>>arr[i];
        --arr[i];
        s2[arr[i]].insert(i);
        if(i) s[lca(arr[i],arr[i-1])].insert(i);
    }
    while(q--){
        int t;
        cin>>t;
        if(t==2){
            int l,r,v;
            cin>>l>>r>>v;
            --l,--r,--v;
            auto it=s2[v].lower_bound(l);
            if((*it)<=r){
                cout<<(*it)+1<<' '<<(*it)+1<<'\n';
            }
            else{
                it=s[v].lower_bound(l+1);
                if((*it)<=r and (*it)-1>=l){
                    cout<<(*it)<<' '<<(*it)+1<<'\n';
                }
                else cout<<"-1 -1\n";
            }
        }
        else{
            int p,v;
            cin>>p>>v;
            --p,--v;
            s2[arr[p]].erase(p);
            if(p) s[lca(arr[p-1],arr[p])].erase(p);
            if(p<n-1) s[lca(arr[p],arr[p+1])].erase(p+1);
            arr[p]=v;
            s2[arr[p]].insert(p);
            if(p) s[lca(arr[p-1],arr[p])].insert(p);
            if(p<n-1) s[lca(arr[p],arr[p+1])].insert(p+1);
        }
    }
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB n=5
2 Correct 27 ms 47392 KB n=100
3 Correct 23 ms 47316 KB n=100
4 Correct 23 ms 47316 KB n=100
5 Correct 21 ms 47256 KB n=100
6 Correct 24 ms 47324 KB n=100
7 Correct 22 ms 47316 KB n=100
8 Correct 23 ms 47256 KB n=100
9 Correct 26 ms 47316 KB n=100
10 Correct 26 ms 47316 KB n=100
11 Correct 22 ms 47320 KB n=100
12 Correct 23 ms 47316 KB n=100
13 Correct 22 ms 47224 KB n=100
14 Correct 24 ms 47316 KB n=100
15 Correct 27 ms 47260 KB n=100
16 Correct 23 ms 47296 KB n=100
17 Correct 25 ms 47316 KB n=100
18 Correct 22 ms 47304 KB n=100
19 Correct 21 ms 47304 KB n=100
20 Correct 22 ms 47340 KB n=100
21 Correct 21 ms 47316 KB n=100
22 Correct 23 ms 47316 KB n=100
23 Correct 29 ms 47308 KB n=100
24 Correct 24 ms 47304 KB n=100
25 Correct 24 ms 47316 KB n=100
26 Incorrect 22 ms 47232 KB Wrong output format.
27 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB n=5
2 Correct 27 ms 47392 KB n=100
3 Correct 23 ms 47316 KB n=100
4 Correct 23 ms 47316 KB n=100
5 Correct 21 ms 47256 KB n=100
6 Correct 24 ms 47324 KB n=100
7 Correct 22 ms 47316 KB n=100
8 Correct 23 ms 47256 KB n=100
9 Correct 26 ms 47316 KB n=100
10 Correct 26 ms 47316 KB n=100
11 Correct 22 ms 47320 KB n=100
12 Correct 23 ms 47316 KB n=100
13 Correct 22 ms 47224 KB n=100
14 Correct 24 ms 47316 KB n=100
15 Correct 27 ms 47260 KB n=100
16 Correct 23 ms 47296 KB n=100
17 Correct 25 ms 47316 KB n=100
18 Correct 22 ms 47304 KB n=100
19 Correct 21 ms 47304 KB n=100
20 Correct 22 ms 47340 KB n=100
21 Correct 21 ms 47316 KB n=100
22 Correct 23 ms 47316 KB n=100
23 Correct 29 ms 47308 KB n=100
24 Correct 24 ms 47304 KB n=100
25 Correct 24 ms 47316 KB n=100
26 Incorrect 22 ms 47232 KB Wrong output format.
27 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB n=5
2 Correct 27 ms 47392 KB n=100
3 Correct 23 ms 47316 KB n=100
4 Correct 23 ms 47316 KB n=100
5 Correct 21 ms 47256 KB n=100
6 Correct 24 ms 47324 KB n=100
7 Correct 22 ms 47316 KB n=100
8 Correct 23 ms 47256 KB n=100
9 Correct 26 ms 47316 KB n=100
10 Correct 26 ms 47316 KB n=100
11 Correct 22 ms 47320 KB n=100
12 Correct 23 ms 47316 KB n=100
13 Correct 22 ms 47224 KB n=100
14 Correct 24 ms 47316 KB n=100
15 Correct 27 ms 47260 KB n=100
16 Correct 23 ms 47296 KB n=100
17 Correct 25 ms 47316 KB n=100
18 Correct 22 ms 47304 KB n=100
19 Correct 21 ms 47304 KB n=100
20 Correct 22 ms 47340 KB n=100
21 Correct 21 ms 47316 KB n=100
22 Correct 23 ms 47316 KB n=100
23 Correct 29 ms 47308 KB n=100
24 Correct 24 ms 47304 KB n=100
25 Correct 24 ms 47316 KB n=100
26 Incorrect 22 ms 47232 KB Wrong output format.
27 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47316 KB n=5
2 Correct 27 ms 47392 KB n=100
3 Correct 23 ms 47316 KB n=100
4 Correct 23 ms 47316 KB n=100
5 Correct 21 ms 47256 KB n=100
6 Correct 24 ms 47324 KB n=100
7 Correct 22 ms 47316 KB n=100
8 Correct 23 ms 47256 KB n=100
9 Correct 26 ms 47316 KB n=100
10 Correct 26 ms 47316 KB n=100
11 Correct 22 ms 47320 KB n=100
12 Correct 23 ms 47316 KB n=100
13 Correct 22 ms 47224 KB n=100
14 Correct 24 ms 47316 KB n=100
15 Correct 27 ms 47260 KB n=100
16 Correct 23 ms 47296 KB n=100
17 Correct 25 ms 47316 KB n=100
18 Correct 22 ms 47304 KB n=100
19 Correct 21 ms 47304 KB n=100
20 Correct 22 ms 47340 KB n=100
21 Correct 21 ms 47316 KB n=100
22 Correct 23 ms 47316 KB n=100
23 Correct 29 ms 47308 KB n=100
24 Correct 24 ms 47304 KB n=100
25 Correct 24 ms 47316 KB n=100
26 Incorrect 22 ms 47232 KB Wrong output format.
27 Halted 0 ms 0 KB -