oj.uz

Submission #992535

# Submission time Handle Problem Language Result Execution time Memory
992535 2024-06-04T15:38:22 Z VMaksimoski008 Birthday gift (IZhO18_treearray) C++17
56 / 100
 212 ms 27728 KB 
#include <bits/stdc++.h>
 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
 
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,bmi,bmi2,lzcnt,popcnt")
 
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
 
int n, m, q, depth[maxn], up[maxn][LOG];
vector<int> graph[maxn], val(maxn);
 
void dfs(int u, int p) {
    for(int i=1; i<LOG; i++) up[u][i] = up[up[u][i-1]][i-1];
 
    for(int &v : graph[u]) {
        if(v == p) continue;
        up[v][0] = u;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}
 
int jmp(int x, int d) {
    for(int j=LOG-1; j>=0; j--)
        if(d & (1 << j)) x = up[x][j];
    return x;
}
 
int get_lca(int a, int b) {
    if(a == 1e9) return b;
    if(b == 1e9) return a;
    if(depth[a] < depth[b]) swap(a, b);
 
    a = jmp(a, depth[a] - depth[b]);
    if(a == b) return a;
    for(int j=LOG-1; j>=0; j--)
        if(up[a][j] != up[b][j])
            a = up[a][j], b = up[b][j];
 
    return up[a][0];
}
 
int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);
 
    cin >> n >> m >> q;
 
    for(int i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
 
    dfs(1, 0);
 
    for(int i=1; i<=m; i++) {
        cin >> val[i];
    }
 
    while(q--) {
        int t;
        cin >> t;
 
        if(t == 1) {
            int p, v;
            cin >> p >> v;
            val[p] = v;
        } else {
            int l, r, v;
            cin >> l >> r >> v;
 
            bool ok = 0;
 
            for(int i=l; i<=r; i++) {
                if(val[i] == v && !ok) {
                    ok = 1;
                    cout << i << " " << i << '\n';
                }

                if(i + 1 <= r && get_lca(val[i], val[i+1]) == v && !ok) {
                    ok = 1;
                    cout << i << " " << i + 1 << '\n';
                }
            }
 
            if(!ok) cout << "-1 -1" << '\n';
        }
    }
 
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB n=5
2 Correct 1 ms 4956 KB n=100
3 Correct 1 ms 4956 KB n=100
4 Correct 1 ms 4956 KB n=100
5 Correct 1 ms 4956 KB n=100
6 Correct 1 ms 4956 KB n=100
7 Correct 2 ms 4956 KB n=100
8 Correct 1 ms 4956 KB n=100
9 Correct 1 ms 4956 KB n=100
10 Correct 1 ms 4956 KB n=100
11 Correct 1 ms 4952 KB n=100
12 Correct 1 ms 4956 KB n=100
13 Correct 2 ms 4952 KB n=100
14 Correct 1 ms 4952 KB n=100
15 Correct 1 ms 5144 KB n=100
16 Correct 1 ms 4956 KB n=100
17 Correct 1 ms 4956 KB n=100
18 Correct 1 ms 4956 KB n=100
19 Correct 1 ms 4952 KB n=100
20 Correct 1 ms 4956 KB n=100
21 Correct 1 ms 4956 KB n=100
22 Correct 1 ms 4956 KB n=100
23 Correct 1 ms 4952 KB n=100
24 Correct 1 ms 4952 KB n=100
25 Correct 1 ms 4956 KB n=100
26 Correct 1 ms 4956 KB n=12
27 Correct 1 ms 4956 KB n=100
28 Correct 3 ms 4956 KB n=500
29 Correct 2 ms 5212 KB n=500
30 Correct 2 ms 4956 KB n=500
31 Correct 3 ms 4956 KB n=500
32 Correct 3 ms 4956 KB n=500
33 Correct 2 ms 5152 KB n=500
34 Correct 3 ms 4952 KB n=500
35 Correct 2 ms 5212 KB n=500
36 Correct 11 ms 4952 KB n=500
37 Correct 12 ms 5184 KB n=500
38 Correct 11 ms 4952 KB n=500
39 Correct 5 ms 4952 KB n=500
40 Correct 4 ms 4956 KB n=500
41 Correct 4 ms 4956 KB n=500
42 Correct 6 ms 4956 KB n=500
43 Correct 6 ms 4956 KB n=500
44 Correct 9 ms 4956 KB n=500
45 Correct 3 ms 5212 KB n=500
46 Correct 2 ms 5212 KB n=500
47 Correct 2 ms 5212 KB n=500
48 Correct 2 ms 4956 KB n=500
49 Correct 2 ms 5212 KB n=500
50 Correct 3 ms 4956 KB n=500
51 Correct 2 ms 4956 KB n=500
52 Correct 3 ms 5212 KB n=500
53 Correct 2 ms 4956 KB n=500
54 Correct 3 ms 5212 KB n=500
55 Correct 2 ms 4952 KB n=278
56 Correct 3 ms 5208 KB n=500
57 Correct 3 ms 4956 KB n=500
58 Correct 6 ms 5188 KB n=500
59 Correct 28 ms 5152 KB n=2000
60 Correct 19 ms 5212 KB n=2000
61 Correct 23 ms 5208 KB n=2000
62 Correct 33 ms 5212 KB n=2000
63 Correct 29 ms 5208 KB n=2000
64 Correct 32 ms 5212 KB n=2000
65 Correct 28 ms 5212 KB n=2000
66 Correct 31 ms 5212 KB n=2000
67 Correct 41 ms 5212 KB n=2000
68 Correct 25 ms 5212 KB n=2000
69 Correct 181 ms 5208 KB n=2000
70 Correct 212 ms 5264 KB n=2000
71 Correct 178 ms 5208 KB n=2000
72 Correct 45 ms 5212 KB n=2000
73 Correct 45 ms 5208 KB n=2000
74 Correct 21 ms 5208 KB n=1844
75 Correct 46 ms 5212 KB n=2000
76 Correct 100 ms 5212 KB n=2000
77 Correct 96 ms 5256 KB n=2000
78 Correct 121 ms 5208 KB n=2000
79 Correct 23 ms 5208 KB n=2000
80 Correct 16 ms 5208 KB n=2000
81 Correct 25 ms 5208 KB n=2000
82 Correct 31 ms 5208 KB n=2000
83 Correct 18 ms 5212 KB n=2000
84 Correct 35 ms 5212 KB n=2000
85 Correct 31 ms 5212 KB n=2000
86 Correct 34 ms 5316 KB n=2000
87 Correct 30 ms 5208 KB n=2000
88 Correct 45 ms 5212 KB n=2000
89 Correct 37 ms 5212 KB n=2000
90 Correct 33 ms 5208 KB n=2000
91 Correct 94 ms 5212 KB n=2000
92 Runtime error 38 ms 27728 KB Execution killed with signal 11
93 Halted 0 ms 0 KB -