oj.uz

Submission #992072

# Submission time Handle Problem Language Result Execution time Memory
992072 2024-06-03T18:56:37 Z VMaksimoski008 Birthday gift (IZhO18_treearray) C++17
30 / 100
 4000 ms 5264 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>;

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(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++) {
                int curr = val[i];
                for(int j=i; j<=r; j++) {
                    curr = get_lca(curr, val[j]);
                    if(curr == v && !ok) {
                        ok = 1;
                        cout << i << " " << j << '\n';
                        break;
                    }
                }
            }

            if(!ok) cout << "-1 -1" << '\n';
        }
    }

    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB n=5
2 Correct 5 ms 5212 KB n=100
3 Correct 3 ms 4956 KB n=100
4 Correct 3 ms 4956 KB n=100
5 Correct 3 ms 4956 KB n=100
6 Correct 12 ms 4956 KB n=100
7 Correct 12 ms 4956 KB n=100
8 Correct 2 ms 4956 KB n=100
9 Correct 2 ms 4956 KB n=100
10 Correct 7 ms 4956 KB n=100
11 Correct 7 ms 4956 KB n=100
12 Correct 4 ms 5212 KB n=100
13 Correct 2 ms 4956 KB n=100
14 Correct 3 ms 4956 KB n=100
15 Correct 2 ms 4956 KB n=100
16 Correct 2 ms 4956 KB n=100
17 Correct 4 ms 4956 KB n=100
18 Correct 2 ms 4956 KB n=100
19 Correct 2 ms 4956 KB n=100
20 Correct 2 ms 4956 KB n=100
21 Correct 3 ms 4956 KB n=100
22 Correct 2 ms 4956 KB n=100
23 Correct 3 ms 4956 KB n=100
24 Correct 3 ms 4956 KB n=100
25 Correct 5 ms 4956 KB n=100
26 Correct 2 ms 5208 KB n=12
27 Correct 5 ms 4956 KB n=100
28 Correct 127 ms 4956 KB n=500
29 Correct 177 ms 5212 KB n=500
30 Correct 145 ms 4956 KB n=500
31 Correct 150 ms 4956 KB n=500
32 Correct 161 ms 4956 KB n=500
33 Correct 152 ms 4956 KB n=500
34 Correct 141 ms 4956 KB n=500
35 Correct 161 ms 5212 KB n=500
36 Correct 1493 ms 4956 KB n=500
37 Correct 1554 ms 4956 KB n=500
38 Correct 1547 ms 4956 KB n=500
39 Correct 123 ms 4956 KB n=500
40 Correct 118 ms 5168 KB n=500
41 Correct 115 ms 4956 KB n=500
42 Correct 726 ms 4956 KB n=500
43 Correct 748 ms 4956 KB n=500
44 Correct 740 ms 4956 KB n=500
45 Correct 119 ms 4956 KB n=500
46 Correct 165 ms 5212 KB n=500
47 Correct 141 ms 5212 KB n=500
48 Correct 108 ms 4956 KB n=500
49 Correct 127 ms 5212 KB n=500
50 Correct 115 ms 4956 KB n=500
51 Correct 154 ms 4956 KB n=500
52 Correct 186 ms 5212 KB n=500
53 Correct 158 ms 4956 KB n=500
54 Correct 524 ms 5212 KB n=500
55 Correct 49 ms 4956 KB n=278
56 Correct 564 ms 5208 KB n=500
57 Correct 587 ms 5212 KB n=500
58 Correct 495 ms 4956 KB n=500

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB n=5
2 Correct 5 ms 5212 KB n=100
3 Correct 3 ms 4956 KB n=100
4 Correct 3 ms 4956 KB n=100
5 Correct 3 ms 4956 KB n=100
6 Correct 12 ms 4956 KB n=100
7 Correct 12 ms 4956 KB n=100
8 Correct 2 ms 4956 KB n=100
9 Correct 2 ms 4956 KB n=100
10 Correct 7 ms 4956 KB n=100
11 Correct 7 ms 4956 KB n=100
12 Correct 4 ms 5212 KB n=100
13 Correct 2 ms 4956 KB n=100
14 Correct 3 ms 4956 KB n=100
15 Correct 2 ms 4956 KB n=100
16 Correct 2 ms 4956 KB n=100
17 Correct 4 ms 4956 KB n=100
18 Correct 2 ms 4956 KB n=100
19 Correct 2 ms 4956 KB n=100
20 Correct 2 ms 4956 KB n=100
21 Correct 3 ms 4956 KB n=100
22 Correct 2 ms 4956 KB n=100
23 Correct 3 ms 4956 KB n=100
24 Correct 3 ms 4956 KB n=100
25 Correct 5 ms 4956 KB n=100
26 Correct 2 ms 5208 KB n=12
27 Correct 5 ms 4956 KB n=100
28 Correct 127 ms 4956 KB n=500
29 Correct 177 ms 5212 KB n=500
30 Correct 145 ms 4956 KB n=500
31 Correct 150 ms 4956 KB n=500
32 Correct 161 ms 4956 KB n=500
33 Correct 152 ms 4956 KB n=500
34 Correct 141 ms 4956 KB n=500
35 Correct 161 ms 5212 KB n=500
36 Correct 1493 ms 4956 KB n=500
37 Correct 1554 ms 4956 KB n=500
38 Correct 1547 ms 4956 KB n=500
39 Correct 123 ms 4956 KB n=500
40 Correct 118 ms 5168 KB n=500
41 Correct 115 ms 4956 KB n=500
42 Correct 726 ms 4956 KB n=500
43 Correct 748 ms 4956 KB n=500
44 Correct 740 ms 4956 KB n=500
45 Correct 119 ms 4956 KB n=500
46 Correct 165 ms 5212 KB n=500
47 Correct 141 ms 5212 KB n=500
48 Correct 108 ms 4956 KB n=500
49 Correct 127 ms 5212 KB n=500
50 Correct 115 ms 4956 KB n=500
51 Correct 154 ms 4956 KB n=500
52 Correct 186 ms 5212 KB n=500
53 Correct 158 ms 4956 KB n=500
54 Correct 524 ms 5212 KB n=500
55 Correct 49 ms 4956 KB n=278
56 Correct 564 ms 5208 KB n=500
57 Correct 587 ms 5212 KB n=500
58 Correct 495 ms 4956 KB n=500
59 Execution timed out 4035 ms 5264 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB n=5
2 Correct 5 ms 5212 KB n=100
3 Correct 3 ms 4956 KB n=100
4 Correct 3 ms 4956 KB n=100
5 Correct 3 ms 4956 KB n=100
6 Correct 12 ms 4956 KB n=100
7 Correct 12 ms 4956 KB n=100
8 Correct 2 ms 4956 KB n=100
9 Correct 2 ms 4956 KB n=100
10 Correct 7 ms 4956 KB n=100
11 Correct 7 ms 4956 KB n=100
12 Correct 4 ms 5212 KB n=100
13 Correct 2 ms 4956 KB n=100
14 Correct 3 ms 4956 KB n=100
15 Correct 2 ms 4956 KB n=100
16 Correct 2 ms 4956 KB n=100
17 Correct 4 ms 4956 KB n=100
18 Correct 2 ms 4956 KB n=100
19 Correct 2 ms 4956 KB n=100
20 Correct 2 ms 4956 KB n=100
21 Correct 3 ms 4956 KB n=100
22 Correct 2 ms 4956 KB n=100
23 Correct 3 ms 4956 KB n=100
24 Correct 3 ms 4956 KB n=100
25 Correct 5 ms 4956 KB n=100
26 Correct 2 ms 5208 KB n=12
27 Correct 5 ms 4956 KB n=100
28 Correct 127 ms 4956 KB n=500
29 Correct 177 ms 5212 KB n=500
30 Correct 145 ms 4956 KB n=500
31 Correct 150 ms 4956 KB n=500
32 Correct 161 ms 4956 KB n=500
33 Correct 152 ms 4956 KB n=500
34 Correct 141 ms 4956 KB n=500
35 Correct 161 ms 5212 KB n=500
36 Correct 1493 ms 4956 KB n=500
37 Correct 1554 ms 4956 KB n=500
38 Correct 1547 ms 4956 KB n=500
39 Correct 123 ms 4956 KB n=500
40 Correct 118 ms 5168 KB n=500
41 Correct 115 ms 4956 KB n=500
42 Correct 726 ms 4956 KB n=500
43 Correct 748 ms 4956 KB n=500
44 Correct 740 ms 4956 KB n=500
45 Correct 119 ms 4956 KB n=500
46 Correct 165 ms 5212 KB n=500
47 Correct 141 ms 5212 KB n=500
48 Correct 108 ms 4956 KB n=500
49 Correct 127 ms 5212 KB n=500
50 Correct 115 ms 4956 KB n=500
51 Correct 154 ms 4956 KB n=500
52 Correct 186 ms 5212 KB n=500
53 Correct 158 ms 4956 KB n=500
54 Correct 524 ms 5212 KB n=500
55 Correct 49 ms 4956 KB n=278
56 Correct 564 ms 5208 KB n=500
57 Correct 587 ms 5212 KB n=500
58 Correct 495 ms 4956 KB n=500
59 Execution timed out 4035 ms 5264 KB Time limit exceeded
60 Halted 0 ms 0 KB -