oj.uz

답안 #871708

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871708 2023-11-11T10:58:58 Z bachhoangxuan Birthday gift (IZhO18_treearray) C++17
56 / 100
 878 ms 109460 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
const int base=101;

namespace Tree{
    vector<vector<int>> edge,Min;
    vector<int> lg2,dep,L,R;
    int pos;
    int cmp(int u,int v){
        return (dep[u]<dep[v]?u:v);
    }
    int lca(int u,int v){
        u=L[u];v=L[v];
        if(u>v) swap(u,v);
        int p=lg2[v-u+1];
        return cmp(Min[u][p],Min[v-(1<<p)+1][p]);
    }
    int dist(int u,int v){
        return dep[u]+dep[v]-2*dep[lca(u,v)];
    }
    void dfs(int u,int p){
        L[u]=++pos;Min[pos][0]=u;
        dep[u]=dep[p]+1;
        for(int v:edge[u]){
            if(v==p) continue;
            dfs(v,u);Min[++pos][0]=u;
        }
        R[u]=pos;
    }
    void init(int n){
        lg2.assign(2*n+1,0);
        dep.assign(n+1,0);
        L.assign(n+1,0);
        R.assign(n+1,0);
        edge.resize(n+1);
        Min.assign(2*n+1,vector<int>(maxl,0));
    }
    void build(int n){
        init(n);
        for(int i=1;i<n;i++){
            int u,v;cin >> u >> v;
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        dfs(1,0);
        for(int i=2;i<=pos;i++) lg2[i]=lg2[i/2]+1;
        for(int i=1;i<20;i++){
            for(int j=1;j<=(pos-(1<<i)+1);j++) Min[j][i]=cmp(Min[j][i-1],Min[j+(1<<(i-1))][i-1]);
        }
    }
}

int n,m,q,a[maxn];
set<pii> s[maxn];

void solve(){
    cin >> n >> m >> q;
    Tree::build(n);
    for(int i=1;i<=m;i++){
        cin >> a[i];
        s[a[i]].insert({i,0});
        if(i>=2) s[Tree::lca(a[i-1],a[i])].insert({i-1,1});
    }
    for(int i=1;i<=q;i++){
        int id,l,r,v;cin >> id;
        if(id==1){
            cin >> l >> v;
            s[a[l]].erase({l,0});
            if(l>=2) s[Tree::lca(a[l-1],a[l])].erase({l-1,1});
            if(l<m) s[Tree::lca(a[l],a[l+1])].erase({l,1});
            a[l]=v;
            s[a[l]].insert({l,0});
            if(l>=2) s[Tree::lca(a[l-1],a[l])].insert({l-1,1});
            if(l<n) s[Tree::lca(a[l],a[l+1])].insert({l,1});
        }
        else{
            cin >> l >> r >> v;
            auto it=s[v].lower_bound({l,0});
            if(it==s[v].end()) cout << -1 << ' ' << -1 << '\n';
            else if(it->se==0){
                if(it->fi<=r) cout << it->fi << ' ' << it->fi << '\n';
                else cout << -1 << ' ' << -1 << '\n';
            }
            else{
                if(it->fi+1<=r) cout << it->fi << ' ' << it->fi+1 << '\n';
                else cout << -1 << ' ' << -1 << '\n';
            }
        }
    }
}
/*
5 4 4
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
*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9820 KB n=5
2 Correct 2 ms 10072 KB n=100
3 Correct 2 ms 9820 KB n=100
4 Correct 2 ms 9820 KB n=100
5 Correct 2 ms 9820 KB n=100
6 Correct 2 ms 9820 KB n=100
7 Correct 2 ms 9820 KB n=100
8 Correct 2 ms 9820 KB n=100
9 Correct 2 ms 9820 KB n=100
10 Correct 2 ms 9820 KB n=100
11 Correct 2 ms 9820 KB n=100
12 Correct 2 ms 9820 KB n=100
13 Correct 2 ms 9820 KB n=100
14 Correct 2 ms 9820 KB n=100
15 Correct 2 ms 9820 KB n=100
16 Correct 2 ms 9820 KB n=100
17 Correct 2 ms 9820 KB n=100
18 Correct 2 ms 9820 KB n=100
19 Correct 2 ms 10072 KB n=100
20 Correct 2 ms 9820 KB n=100
21 Correct 2 ms 9820 KB n=100
22 Correct 2 ms 9820 KB n=100
23 Correct 2 ms 9820 KB n=100
24 Correct 2 ms 9820 KB n=100
25 Correct 2 ms 9820 KB n=100
26 Correct 4 ms 10116 KB n=12
27 Correct 2 ms 9820 KB n=100

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9820 KB n=5
2 Correct 2 ms 10072 KB n=100
3 Correct 2 ms 9820 KB n=100
4 Correct 2 ms 9820 KB n=100
5 Correct 2 ms 9820 KB n=100
6 Correct 2 ms 9820 KB n=100
7 Correct 2 ms 9820 KB n=100
8 Correct 2 ms 9820 KB n=100
9 Correct 2 ms 9820 KB n=100
10 Correct 2 ms 9820 KB n=100
11 Correct 2 ms 9820 KB n=100
12 Correct 2 ms 9820 KB n=100
13 Correct 2 ms 9820 KB n=100
14 Correct 2 ms 9820 KB n=100
15 Correct 2 ms 9820 KB n=100
16 Correct 2 ms 9820 KB n=100
17 Correct 2 ms 9820 KB n=100
18 Correct 2 ms 9820 KB n=100
19 Correct 2 ms 10072 KB n=100
20 Correct 2 ms 9820 KB n=100
21 Correct 2 ms 9820 KB n=100
22 Correct 2 ms 9820 KB n=100
23 Correct 2 ms 9820 KB n=100
24 Correct 2 ms 9820 KB n=100
25 Correct 2 ms 9820 KB n=100
26 Correct 4 ms 10116 KB n=12
27 Correct 2 ms 9820 KB n=100
28 Correct 3 ms 10076 KB n=500
29 Correct 2 ms 10076 KB n=500
30 Correct 3 ms 10076 KB n=500
31 Correct 3 ms 10076 KB n=500
32 Correct 3 ms 9820 KB n=500
33 Correct 3 ms 10076 KB n=500
34 Correct 3 ms 10076 KB n=500
35 Correct 3 ms 10076 KB n=500
36 Correct 2 ms 10076 KB n=500
37 Correct 2 ms 10076 KB n=500
38 Correct 2 ms 10076 KB n=500
39 Correct 2 ms 10076 KB n=500
40 Correct 3 ms 10076 KB n=500
41 Correct 3 ms 10076 KB n=500
42 Correct 3 ms 9820 KB n=500
43 Correct 3 ms 10076 KB n=500
44 Correct 3 ms 10076 KB n=500
45 Correct 3 ms 10076 KB n=500
46 Correct 3 ms 10076 KB n=500
47 Correct 3 ms 10076 KB n=500
48 Correct 3 ms 10076 KB n=500
49 Correct 3 ms 10076 KB n=500
50 Correct 2 ms 10076 KB n=500
51 Correct 3 ms 10076 KB n=500
52 Correct 3 ms 10076 KB n=500
53 Correct 3 ms 10328 KB n=500
54 Correct 3 ms 10076 KB n=500
55 Correct 2 ms 9820 KB n=278
56 Correct 3 ms 10076 KB n=500
57 Correct 2 ms 9872 KB n=500
58 Correct 3 ms 10076 KB n=500

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9820 KB n=5
2 Correct 2 ms 10072 KB n=100
3 Correct 2 ms 9820 KB n=100
4 Correct 2 ms 9820 KB n=100
5 Correct 2 ms 9820 KB n=100
6 Correct 2 ms 9820 KB n=100
7 Correct 2 ms 9820 KB n=100
8 Correct 2 ms 9820 KB n=100
9 Correct 2 ms 9820 KB n=100
10 Correct 2 ms 9820 KB n=100
11 Correct 2 ms 9820 KB n=100
12 Correct 2 ms 9820 KB n=100
13 Correct 2 ms 9820 KB n=100
14 Correct 2 ms 9820 KB n=100
15 Correct 2 ms 9820 KB n=100
16 Correct 2 ms 9820 KB n=100
17 Correct 2 ms 9820 KB n=100
18 Correct 2 ms 9820 KB n=100
19 Correct 2 ms 10072 KB n=100
20 Correct 2 ms 9820 KB n=100
21 Correct 2 ms 9820 KB n=100
22 Correct 2 ms 9820 KB n=100
23 Correct 2 ms 9820 KB n=100
24 Correct 2 ms 9820 KB n=100
25 Correct 2 ms 9820 KB n=100
26 Correct 4 ms 10116 KB n=12
27 Correct 2 ms 9820 KB n=100
28 Correct 3 ms 10076 KB n=500
29 Correct 2 ms 10076 KB n=500
30 Correct 3 ms 10076 KB n=500
31 Correct 3 ms 10076 KB n=500
32 Correct 3 ms 9820 KB n=500
33 Correct 3 ms 10076 KB n=500
34 Correct 3 ms 10076 KB n=500
35 Correct 3 ms 10076 KB n=500
36 Correct 2 ms 10076 KB n=500
37 Correct 2 ms 10076 KB n=500
38 Correct 2 ms 10076 KB n=500
39 Correct 2 ms 10076 KB n=500
40 Correct 3 ms 10076 KB n=500
41 Correct 3 ms 10076 KB n=500
42 Correct 3 ms 9820 KB n=500
43 Correct 3 ms 10076 KB n=500
44 Correct 3 ms 10076 KB n=500
45 Correct 3 ms 10076 KB n=500
46 Correct 3 ms 10076 KB n=500
47 Correct 3 ms 10076 KB n=500
48 Correct 3 ms 10076 KB n=500
49 Correct 3 ms 10076 KB n=500
50 Correct 2 ms 10076 KB n=500
51 Correct 3 ms 10076 KB n=500
52 Correct 3 ms 10076 KB n=500
53 Correct 3 ms 10328 KB n=500
54 Correct 3 ms 10076 KB n=500
55 Correct 2 ms 9820 KB n=278
56 Correct 3 ms 10076 KB n=500
57 Correct 2 ms 9872 KB n=500
58 Correct 3 ms 10076 KB n=500
59 Correct 6 ms 10588 KB n=2000
60 Correct 5 ms 10588 KB n=2000
61 Correct 5 ms 10588 KB n=2000
62 Correct 5 ms 10588 KB n=2000
63 Correct 5 ms 10588 KB n=2000
64 Correct 5 ms 10588 KB n=2000
65 Correct 5 ms 10840 KB n=2000
66 Correct 4 ms 10588 KB n=2000
67 Correct 5 ms 10588 KB n=2000
68 Correct 4 ms 10588 KB n=2000
69 Correct 4 ms 10588 KB n=2000
70 Correct 4 ms 10588 KB n=2000
71 Correct 4 ms 10588 KB n=2000
72 Correct 4 ms 10640 KB n=2000
73 Correct 4 ms 10588 KB n=2000
74 Correct 4 ms 10588 KB n=1844
75 Correct 4 ms 10588 KB n=2000
76 Correct 5 ms 10588 KB n=2000
77 Correct 5 ms 10588 KB n=2000
78 Correct 5 ms 10600 KB n=2000
79 Correct 5 ms 10588 KB n=2000
80 Correct 5 ms 10588 KB n=2000
81 Correct 4 ms 10588 KB n=2000
82 Correct 5 ms 10640 KB n=2000
83 Correct 4 ms 10588 KB n=2000
84 Correct 5 ms 10588 KB n=2000
85 Correct 5 ms 10588 KB n=2000
86 Correct 6 ms 10588 KB n=2000
87 Correct 4 ms 10588 KB n=2000
88 Correct 4 ms 10588 KB n=2000
89 Correct 4 ms 10588 KB n=2000
90 Correct 4 ms 10588 KB n=2000
91 Correct 5 ms 10588 KB n=2000

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9820 KB n=5
2 Correct 2 ms 10072 KB n=100
3 Correct 2 ms 9820 KB n=100
4 Correct 2 ms 9820 KB n=100
5 Correct 2 ms 9820 KB n=100
6 Correct 2 ms 9820 KB n=100
7 Correct 2 ms 9820 KB n=100
8 Correct 2 ms 9820 KB n=100
9 Correct 2 ms 9820 KB n=100
10 Correct 2 ms 9820 KB n=100
11 Correct 2 ms 9820 KB n=100
12 Correct 2 ms 9820 KB n=100
13 Correct 2 ms 9820 KB n=100
14 Correct 2 ms 9820 KB n=100
15 Correct 2 ms 9820 KB n=100
16 Correct 2 ms 9820 KB n=100
17 Correct 2 ms 9820 KB n=100
18 Correct 2 ms 9820 KB n=100
19 Correct 2 ms 10072 KB n=100
20 Correct 2 ms 9820 KB n=100
21 Correct 2 ms 9820 KB n=100
22 Correct 2 ms 9820 KB n=100
23 Correct 2 ms 9820 KB n=100
24 Correct 2 ms 9820 KB n=100
25 Correct 2 ms 9820 KB n=100
26 Correct 4 ms 10116 KB n=12
27 Correct 2 ms 9820 KB n=100
28 Correct 3 ms 10076 KB n=500
29 Correct 2 ms 10076 KB n=500
30 Correct 3 ms 10076 KB n=500
31 Correct 3 ms 10076 KB n=500
32 Correct 3 ms 9820 KB n=500
33 Correct 3 ms 10076 KB n=500
34 Correct 3 ms 10076 KB n=500
35 Correct 3 ms 10076 KB n=500
36 Correct 2 ms 10076 KB n=500
37 Correct 2 ms 10076 KB n=500
38 Correct 2 ms 10076 KB n=500
39 Correct 2 ms 10076 KB n=500
40 Correct 3 ms 10076 KB n=500
41 Correct 3 ms 10076 KB n=500
42 Correct 3 ms 9820 KB n=500
43 Correct 3 ms 10076 KB n=500
44 Correct 3 ms 10076 KB n=500
45 Correct 3 ms 10076 KB n=500
46 Correct 3 ms 10076 KB n=500
47 Correct 3 ms 10076 KB n=500
48 Correct 3 ms 10076 KB n=500
49 Correct 3 ms 10076 KB n=500
50 Correct 2 ms 10076 KB n=500
51 Correct 3 ms 10076 KB n=500
52 Correct 3 ms 10076 KB n=500
53 Correct 3 ms 10328 KB n=500
54 Correct 3 ms 10076 KB n=500
55 Correct 2 ms 9820 KB n=278
56 Correct 3 ms 10076 KB n=500
57 Correct 2 ms 9872 KB n=500
58 Correct 3 ms 10076 KB n=500
59 Correct 6 ms 10588 KB n=2000
60 Correct 5 ms 10588 KB n=2000
61 Correct 5 ms 10588 KB n=2000
62 Correct 5 ms 10588 KB n=2000
63 Correct 5 ms 10588 KB n=2000
64 Correct 5 ms 10588 KB n=2000
65 Correct 5 ms 10840 KB n=2000
66 Correct 4 ms 10588 KB n=2000
67 Correct 5 ms 10588 KB n=2000
68 Correct 4 ms 10588 KB n=2000
69 Correct 4 ms 10588 KB n=2000
70 Correct 4 ms 10588 KB n=2000
71 Correct 4 ms 10588 KB n=2000
72 Correct 4 ms 10640 KB n=2000
73 Correct 4 ms 10588 KB n=2000
74 Correct 4 ms 10588 KB n=1844
75 Correct 4 ms 10588 KB n=2000
76 Correct 5 ms 10588 KB n=2000
77 Correct 5 ms 10588 KB n=2000
78 Correct 5 ms 10600 KB n=2000
79 Correct 5 ms 10588 KB n=2000
80 Correct 5 ms 10588 KB n=2000
81 Correct 4 ms 10588 KB n=2000
82 Correct 5 ms 10640 KB n=2000
83 Correct 4 ms 10588 KB n=2000
84 Correct 5 ms 10588 KB n=2000
85 Correct 5 ms 10588 KB n=2000
86 Correct 6 ms 10588 KB n=2000
87 Correct 4 ms 10588 KB n=2000
88 Correct 4 ms 10588 KB n=2000
89 Correct 4 ms 10588 KB n=2000
90 Correct 4 ms 10588 KB n=2000
91 Correct 5 ms 10588 KB n=2000
92 Correct 696 ms 99688 KB n=200000
93 Correct 716 ms 104844 KB n=200000
94 Correct 609 ms 108024 KB n=200000
95 Correct 673 ms 99452 KB n=200000
96 Correct 668 ms 99424 KB n=200000
97 Correct 671 ms 103868 KB n=200000
98 Correct 693 ms 99400 KB n=200000
99 Correct 761 ms 99560 KB n=200000
100 Correct 718 ms 99580 KB n=200000
101 Correct 610 ms 109460 KB n=200000
102 Correct 369 ms 100804 KB n=200000
103 Correct 390 ms 100692 KB n=200000
104 Correct 368 ms 100704 KB n=200000
105 Correct 373 ms 100948 KB n=200000
106 Correct 383 ms 100956 KB n=200000
107 Correct 372 ms 100952 KB n=200000
108 Correct 687 ms 99592 KB n=200000
109 Correct 683 ms 99672 KB n=200000
110 Correct 672 ms 99948 KB n=200000
111 Correct 698 ms 99160 KB n=200000
112 Correct 610 ms 108268 KB n=200000
113 Correct 798 ms 103480 KB n=200000
114 Correct 791 ms 99040 KB n=200000
115 Correct 878 ms 101624 KB n=200000
116 Correct 788 ms 99744 KB n=200000
117 Correct 670 ms 108524 KB n=200000
118 Correct 762 ms 102336 KB n=200000
119 Correct 711 ms 99608 KB n=200000
120 Correct 646 ms 108628 KB n=200000
121 Correct 576 ms 108116 KB n=200000
122 Correct 555 ms 108780 KB n=200000
123 Correct 492 ms 100832 KB n=200000
124 Incorrect 179 ms 29524 KB Jury has the answer but participant has not
125 Halted 0 ms 0 KB -