oj.uz

Submission #1088574

# Submission time Handle Problem Language Result Execution time Memory
1088574 2024-09-14T15:41:52 Z vladilius Birthday gift (IZhO18_treearray) C++17
56 / 100
 4000 ms 47636 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, m, q; cin>>n>>m>>q;
    vector<int> g[n + 1];
    for (int i = 1; i < n; i++){
        int u, v; cin>>u>>v;
        g[u].pb(v);
        g[v].pb(u);
    }
    
    const int lg = log2(n);
    vector<vector<int>> pw(n + 1, vector<int>(lg + 1));
    vector<int> tin(n + 1), tout(n + 1);
    int timer = 0;
    function<void(int, int)> fill = [&](int v, int pr){
        tin[v] = ++timer;
        pw[v][0] = pr;
        for (int i = 1; i <= lg; i++){
            pw[v][i] = pw[pw[v][i - 1]][i - 1];
        }
        for (int i: g[v]){
            if (i == pr) continue;
            fill(i, v);
        }
        tout[v] = timer;
    };
    fill(1, 1);
    
    auto check = [&](int x, int y){
        return (tin[x] <= tin[y] && tout[x] >= tout[y]);
    };
    
    auto lca = [&](int x, int y){
        if (check(x, y)) return x;
        if (check(y, x)) return y;
        for (int i = lg; i >= 0; i--){
            if (!check(pw[x][i], y)){
                x = pw[x][i];
            }
        }
        return pw[x][0];
    };
    
    vector<int> a(m + 1);
    for (int i = 1; i <= m; i++){
        cin>>a[i];
    }
    while (q--){
        int type; cin>>type;
        if (type == 1){
            int p, v; cin>>p>>v;
            a[p] = v;
        }
        else {
            int l, r, v, t = 0, l1 = -1, r1 = -1; cin>>l>>r>>v;
            for (int i = l; i <= r; i++){
                if (t == v){
                    r1 = i - 1;
                    break;
                }
                if (!check(v, a[i])){
                    t = 0;
                    continue;
                }
                if (!t){
                    t = a[i];
                    l1 = i;
                }
                else{
                    t = lca(t, a[i]);
                }
            }
            if (r1 == -1) r1 = r;
            if (t == v) cout<<l1<<" "<<r1<<"\n";
            else cout<<-1<<" "<<-1<<"\n";
        }
    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 44.0

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