oj.uz

Submission #42787

# Submission time Handle Problem Language Result Execution time Memory
42787 2018-03-04T03:41:46 Z nickyrio Birthday gift (IZhO18_treearray) C++14
56 / 100
 4000 ms 67548 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define DEBUG(x) { cerr << #x << " = " << x << endl; }
#define Arr(A, l, r) { cerr << #A  << " = "; FOR(_, l, r) cerr << A[_] << ' '; cerr << endl; }
#define N 201000
#define pp pair<int, int>
#define next __next
#define prev __prev
#define __builtin_popcount __builtin_popcountll
#define bit(S, i) (((S) >> i) & 1)
#define IO ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
using namespace std;

int n, m, q, a[N], h[N];
int L[N][20];
vector<int> e[N];
set<int> o[N], t[N];
set<int> :: iterator io, it;
void dfs(int u, int p) {
    for (int v : e[u]) if (v != p) {
        h[v] = h[u] + 1;
        L[v][0] = u;
        dfs(v, u);
    }
}

int lca(int u, int v) {
    if (h[u] < h[v]) swap(u, v);
    int delta = h[u] - h[v];
    FORD(i, 17, 0) if (bit(delta, i)) u = L[u][i];
    if (u == v) return u;
    FORD(i, 17, 0) if (L[u][i] != L[v][i]) {
        u = L[u][i]; v = L[v][i];
    }
    return L[u][0];
}
int main() {
    IO;
    cin >> n >> m >> q;
    FOR(i, 2, n) {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1, -1);
    FOR(j, 1, 17) FOR(v, 1, n) L[v][j] = L[L[v][j - 1]][j - 1];
    FOR(i, 1, m) {
        cin >> a[i];
        o[a[i]].insert(i);
        if (i != 1) {
            t[lca(a[i], a[i - 1])].insert(i);
        }
    }
    while (q--) {
        int type, v, l, r;
        cin >> type;
        if (type == 1) {
            cin >> l >> v;
            o[a[l]].erase(l);
            if (l > 1) t[lca(a[l - 1], a[l])].erase(l);
            if (l < m) t[lca(a[l], a[l + 1])].erase(l + 1);
            a[l] = v;
            o[a[l]].insert(l);
            if (l > 1) t[lca(a[l], a[l - 1])].insert(l);
            if (l < m) t[lca(a[l], a[l + 1])].insert(l + 1);
        }
        else {
            cin >> l >> r >> v;
          	int x = -1, y = -1;
          	io = lower_bound(o[v].begin(), o[v].end(), l);
          	it = lower_bound(t[v].begin(), t[v].end(), l + 1);
            if (io != o[v].end() && *io <= r) x = *io, y = *io;
          	if (it != t[v].end() && *it <= r) x = (*it) - 1, y = *it;
            cout << x << ' ' << y << '\n';
        }
    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23932 KB n=5
2 Correct 19 ms 24036 KB n=100
3 Correct 19 ms 24108 KB n=100
4 Correct 20 ms 24108 KB n=100
5 Correct 20 ms 24108 KB n=100
6 Correct 20 ms 24180 KB n=100
7 Correct 19 ms 24180 KB n=100
8 Correct 20 ms 24180 KB n=100
9 Correct 19 ms 24180 KB n=100
10 Correct 21 ms 24260 KB n=100
11 Correct 19 ms 24260 KB n=100
12 Correct 19 ms 24260 KB n=100
13 Correct 19 ms 24260 KB n=100
14 Correct 23 ms 24260 KB n=100
15 Correct 21 ms 24284 KB n=100
16 Correct 20 ms 24284 KB n=100
17 Correct 20 ms 24284 KB n=100
18 Correct 21 ms 24284 KB n=100
19 Correct 21 ms 24284 KB n=100
20 Correct 20 ms 24284 KB n=100
21 Correct 24 ms 24284 KB n=100
22 Correct 20 ms 24284 KB n=100
23 Correct 20 ms 24284 KB n=100
24 Correct 19 ms 24284 KB n=100
25 Correct 19 ms 24284 KB n=100
26 Correct 19 ms 24284 KB n=12
27 Correct 20 ms 24284 KB n=100
28 Correct 24 ms 24284 KB n=500
29 Correct 21 ms 24284 KB n=500
30 Correct 20 ms 24284 KB n=500
31 Correct 20 ms 24284 KB n=500
32 Correct 22 ms 24284 KB n=500
33 Correct 20 ms 24284 KB n=500
34 Correct 23 ms 24284 KB n=500
35 Correct 21 ms 24284 KB n=500
36 Correct 20 ms 24284 KB n=500
37 Correct 20 ms 24284 KB n=500
38 Correct 20 ms 24284 KB n=500
39 Correct 20 ms 24284 KB n=500
40 Correct 20 ms 24288 KB n=500
41 Correct 20 ms 24344 KB n=500
42 Correct 20 ms 24416 KB n=500
43 Correct 20 ms 24416 KB n=500
44 Correct 20 ms 24416 KB n=500
45 Correct 22 ms 24416 KB n=500
46 Correct 21 ms 24416 KB n=500
47 Correct 21 ms 24416 KB n=500
48 Correct 23 ms 24416 KB n=500
49 Correct 22 ms 24416 KB n=500
50 Correct 20 ms 24416 KB n=500
51 Correct 20 ms 24416 KB n=500
52 Correct 20 ms 24416 KB n=500
53 Correct 21 ms 24416 KB n=500
54 Correct 20 ms 24416 KB n=500
55 Correct 19 ms 24416 KB n=278
56 Correct 20 ms 24416 KB n=500
57 Correct 21 ms 24416 KB n=500
58 Correct 24 ms 24416 KB n=500
59 Correct 56 ms 24668 KB n=2000
60 Correct 25 ms 24668 KB n=2000
61 Correct 24 ms 24684 KB n=2000
62 Correct 24 ms 24700 KB n=2000
63 Correct 57 ms 24700 KB n=2000
64 Correct 23 ms 24716 KB n=2000
65 Correct 61 ms 24716 KB n=2000
66 Correct 23 ms 24716 KB n=2000
67 Correct 39 ms 24716 KB n=2000
68 Correct 24 ms 24716 KB n=2000
69 Correct 24 ms 24716 KB n=2000
70 Correct 22 ms 24716 KB n=2000
71 Correct 24 ms 24716 KB n=2000
72 Correct 24 ms 24732 KB n=2000
73 Correct 24 ms 24732 KB n=2000
74 Correct 51 ms 24732 KB n=1844
75 Correct 26 ms 24736 KB n=2000
76 Correct 25 ms 24736 KB n=2000
77 Correct 24 ms 24736 KB n=2000
78 Correct 24 ms 24736 KB n=2000
79 Correct 68 ms 24736 KB n=2000
80 Correct 26 ms 24736 KB n=2000
81 Correct 25 ms 24736 KB n=2000
82 Correct 58 ms 24736 KB n=2000
83 Correct 25 ms 24736 KB n=2000
84 Correct 24 ms 24736 KB n=2000
85 Correct 26 ms 24736 KB n=2000
86 Correct 33 ms 24736 KB n=2000
87 Correct 30 ms 24736 KB n=2000
88 Correct 29 ms 24736 KB n=2000
89 Correct 26 ms 24768 KB n=2000
90 Correct 23 ms 24768 KB n=2000
91 Correct 22 ms 24768 KB n=2000
92 Execution timed out 4082 ms 67548 KB Time limit exceeded
93 Halted 0 ms 0 KB -