oj.uz

Submission #154895

# Submission time Handle Problem Language Result Execution time Memory
154895 2019-09-25T12:50:32 Z theboatman Birthday gift (IZhO18_treearray) C++17
56 / 100
 4000 ms 41180 KB 
#include <bits/stdc++.h>

#define y1 theboatman
#define make_struct(args...) {args}

using namespace std;

vector <int> tin, tout;
vector <vector <int> > g, up;

int timer;
void dfs(int v, int from) {
    tin[v] = timer++;

    up[v][0] = from;
    for(int i = 1; i < 20; i++) {
        up[v][i] = up[up[v][i - 1]][i - 1];
    }

    for(auto to : g[v]) {
        if (to != from) {
            dfs(to, v);
        }
    }

    tout[v] = timer++;
}

bool upper(int a, int b) {
    return (tin[a] <= tin[b] && tout[a] >= tout[b]);
}

int lca(int a, int b) {
    if (upper(a, b)) {
        return a;
    }

    if (upper(a, b)) {
        return b;
    }

    for(int i = 19; i > -1; i--) {
        if (!upper(up[a][i], b)) {
            a = up[a][i];
        }
    }

    return up[a][0];
}

int main() {
    cin.tie(0);
    ios :: sync_with_stdio(0);

    int n, m, q;
    cin >> n >> m >> q;

    g.resize(n + 1);
    for(int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;

        g[x].push_back(y);
        g[y].push_back(x);
    }

    vector <int> a(m + 1);
    for(int i = 1; i <= m; i++) {
        cin >> a[i];
    }

    tin.resize(n + 1);
    tout.resize(n + 1);
    up.resize(n + 1, vector <int> (20, 1));

    dfs(1, 1);

    for(int it = 0; it < q; it++) {
        int type;
        cin >> type;

        if (type == 1) {
            int pos, v;
            cin >> pos >> v;

            a[pos] = v;
        }
        else {
            int l, r, v;
            cin >> l >> r >> v;

            int L = -1, R = -1;


            int mn = tin[v], mx = tout[v];
            for(int i = l; i <= r; i++) {
                if (mn <= tin[a[i]] && tin[a[i]] <= mx) {
                    int start = i;

                    int x = i, y = i;
                    while(i <= r && mn <= tin[a[i]] && tin[a[i]] <= mx) {
                        if (tin[a[i]] < tin[a[x]]) {
                            x = i;
                        }

                        if (tout[a[i]] > tout[a[y]]) {
                            y = i;
                        }

                        i++;
                    }
                    i--;

                    if (lca(a[x], a[y]) == v) {
                        L = start, R = i;
                    }
                }
            }

            cout << L << " " << R << "\n";
        }
    }

    return 0;
}
/*
*/

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 44.0

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