oj.uz

Submission #155085

# Submission time Handle Problem Language Result Execution time Memory
155085 2019-09-26T08:21:27 Z theboatman Birthday gift (IZhO18_treearray) C++17
56 / 100
 739 ms 262144 KB 
#include <bits/stdc++.h>

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

using namespace std;

struct Tree {
    struct node {
        int sum;
        node *l, *r;

        node() :
            sum(0),
            l(nullptr),
            r(nullptr)
            {}
    };

    node *root;
    int tl, tr;

    void init(int n) {
        tl = 1;
        tr = n;

        root = new node();
    }

    void add(node *v) {
        if (v -> l == nullptr) {
            v -> l = new node();
        }

        if (v -> r == nullptr) {
            v -> r = new node();
        }
    }

    void modify(node *v, int tl, int tr, int pos, int val) {
        if (tl == tr) {
            v -> sum += val;
        }
        else {
            add(v);

            int tm = tl + tr >> 1;
            if (pos <= tm) {
                modify(v -> l, tl, tm, pos, val);
            }
            else {
                modify(v -> r, tm + 1, tr, pos, val);
            }

            v -> sum = v -> l -> sum + v -> r -> sum;
        }
    }

    void modify(int pos, int val) {
        modify(root, tl, tr, pos, val);
    }

    int find_pos(node *v, int tl, int tr) {
        if (tl == tr) {
            if (v -> sum) {
                return tl;
            }
            else {
                return int(1e9);
            }
        }

        add(v);

        int tm = tl + tr >> 1;
        if (v -> l -> sum) {
            return find_pos(v -> l, tl, tm);
        }
        else {
            return find_pos(v -> r, tm + 1, tr);
        }
    }

    int get(node *v, int tl, int tr, int l, int r) {
        if (l > r) {
            return int(1e9);
        }

        if (tl == l && tr == r) {
            return find_pos(v, tl, tr);
        }

        add(v);

        int tm = tl + tr >> 1;
        int ql = get(v -> l, tl, tm, l, min(r, tm));
        int qr = get(v -> r, tm + 1, tr, max(l, tm + 1), r);

        return min(ql, qr);
    }

    int get(int l, int r) {
        return get(root, tl, tr, l, r);
    }
};

struct Lca {
    int n, bit, timer;
    vector <int> tin, tout;
    vector <vector <int> > g, up;

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

        up[v][0] = from;
        for(int i = 1; i < bit; 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++;
    }

    void build(vector <vector <int> > &temp_graph) {
        g = temp_graph;
        n = g.size();

        bit = 0;
        while((1 << bit) <= n) {
            bit++;
        }
        bit--;

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

        timer = 0;
        dfs(1, 1);
    }

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

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

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

        for(int i = bit - 1; 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;

    vector <vector <int> > g(n + 1);
    for(int i = 0; i < n - 1; 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];
    }

    Lca lca;
    lca.build(g);

    vector <Tree> tree(n + 1);
    for(int i = 1; i <= n; i++) {
        tree[i].init(m);
    }

    for(int i = 2; i <= m; i++) {
        int c = lca.get(a[i], a[i - 1]);
        tree[c].modify(i - 1, 1);
    }

    for(int i = 1; i <= m; i++) {
        tree[a[i]].modify(i, 1);
    }

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

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

            for(int i = max(pos, 2); i <= min(n, pos + 1); i++) {
                int c = lca.get(a[i], a[i - 1]);
                tree[c].modify(i - 1, -1);
            }

            tree[a[pos]].modify(pos, -1);
            a[pos] = val;
            tree[a[pos]].modify(pos, 1);

            for(int i = max(pos, 2); i <= min(n, pos + 1); i++) {
                int c = lca.get(a[i], a[i - 1]);
                tree[c].modify(i - 1, 1);
            }
        }
        else {
            int l, r, c;
            cin >> l >> r >> c;

            int pos = tree[c].get(l, r);

            if (pos > r || pos + (a[pos] != c) > r) {
                cout << "-1 -1\n";
            }
            else {
                cout << pos << " " << pos + (a[pos] != c) << "\n";
            }
        }
    }

    return 0;
}
/*
*/

Compilation message

treearray.cpp: In member function 'void Tree::modify(Tree::node*, int, int, int, int)':
treearray.cpp:47:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
             int tm = tl + tr >> 1;
                      ~~~^~~~
treearray.cpp: In member function 'int Tree::find_pos(Tree::node*, int, int)':
treearray.cpp:75:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int tm = tl + tr >> 1;
                  ~~~^~~~
treearray.cpp: In member function 'int Tree::get(Tree::node*, int, int, int, int)':
treearray.cpp:95:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int tm = tl + tr >> 1;
                  ~~~^~~~

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 380 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 380 KB n=100
11 Correct 2 ms 376 KB n=100
12 Correct 2 ms 376 KB n=100
13 Correct 2 ms 504 KB n=100
14 Correct 2 ms 412 KB n=100
15 Correct 2 ms 504 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 508 KB n=100
21 Correct 2 ms 380 KB n=100
22 Correct 2 ms 384 KB n=100
23 Correct 4 ms 388 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 380 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 380 KB n=100
11 Correct 2 ms 376 KB n=100
12 Correct 2 ms 376 KB n=100
13 Correct 2 ms 504 KB n=100
14 Correct 2 ms 412 KB n=100
15 Correct 2 ms 504 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 508 KB n=100
21 Correct 2 ms 380 KB n=100
22 Correct 2 ms 384 KB n=100
23 Correct 4 ms 388 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 888 KB n=500
29 Correct 4 ms 1192 KB n=500
30 Correct 4 ms 1292 KB n=500
31 Correct 3 ms 1144 KB n=500
32 Correct 4 ms 888 KB n=500
33 Correct 4 ms 1144 KB n=500
34 Correct 4 ms 860 KB n=500
35 Correct 4 ms 1144 KB n=500
36 Correct 3 ms 732 KB n=500
37 Correct 3 ms 760 KB n=500
38 Correct 3 ms 808 KB n=500
39 Correct 3 ms 888 KB n=500
40 Correct 3 ms 816 KB n=500
41 Correct 3 ms 760 KB n=500
42 Correct 4 ms 860 KB n=500
43 Correct 4 ms 888 KB n=500
44 Correct 4 ms 908 KB n=500
45 Correct 3 ms 760 KB n=500
46 Correct 4 ms 1200 KB n=500
47 Correct 4 ms 1144 KB n=500
48 Correct 3 ms 760 KB n=500
49 Correct 4 ms 1144 KB n=500
50 Correct 4 ms 1272 KB n=500
51 Correct 4 ms 1400 KB n=500
52 Correct 4 ms 1272 KB n=500
53 Correct 5 ms 1272 KB n=500
54 Correct 3 ms 888 KB n=500
55 Correct 3 ms 760 KB n=278
56 Correct 4 ms 888 KB n=500
57 Correct 4 ms 888 KB n=500
58 Correct 3 ms 760 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 380 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 380 KB n=100
11 Correct 2 ms 376 KB n=100
12 Correct 2 ms 376 KB n=100
13 Correct 2 ms 504 KB n=100
14 Correct 2 ms 412 KB n=100
15 Correct 2 ms 504 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 508 KB n=100
21 Correct 2 ms 380 KB n=100
22 Correct 2 ms 384 KB n=100
23 Correct 4 ms 388 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 888 KB n=500
29 Correct 4 ms 1192 KB n=500
30 Correct 4 ms 1292 KB n=500
31 Correct 3 ms 1144 KB n=500
32 Correct 4 ms 888 KB n=500
33 Correct 4 ms 1144 KB n=500
34 Correct 4 ms 860 KB n=500
35 Correct 4 ms 1144 KB n=500
36 Correct 3 ms 732 KB n=500
37 Correct 3 ms 760 KB n=500
38 Correct 3 ms 808 KB n=500
39 Correct 3 ms 888 KB n=500
40 Correct 3 ms 816 KB n=500
41 Correct 3 ms 760 KB n=500
42 Correct 4 ms 860 KB n=500
43 Correct 4 ms 888 KB n=500
44 Correct 4 ms 908 KB n=500
45 Correct 3 ms 760 KB n=500
46 Correct 4 ms 1200 KB n=500
47 Correct 4 ms 1144 KB n=500
48 Correct 3 ms 760 KB n=500
49 Correct 4 ms 1144 KB n=500
50 Correct 4 ms 1272 KB n=500
51 Correct 4 ms 1400 KB n=500
52 Correct 4 ms 1272 KB n=500
53 Correct 5 ms 1272 KB n=500
54 Correct 3 ms 888 KB n=500
55 Correct 3 ms 760 KB n=278
56 Correct 4 ms 888 KB n=500
57 Correct 4 ms 888 KB n=500
58 Correct 3 ms 760 KB n=500
59 Correct 10 ms 2936 KB n=2000
60 Correct 14 ms 4856 KB n=2000
61 Correct 15 ms 5112 KB n=2000
62 Correct 14 ms 4984 KB n=2000
63 Correct 10 ms 2936 KB n=2000
64 Correct 17 ms 5112 KB n=2000
65 Correct 10 ms 2936 KB n=2000
66 Correct 14 ms 5112 KB n=2000
67 Correct 12 ms 3448 KB n=2000
68 Correct 15 ms 5112 KB n=2000
69 Correct 8 ms 2296 KB n=2000
70 Correct 8 ms 2296 KB n=2000
71 Correct 7 ms 2296 KB n=2000
72 Correct 8 ms 2396 KB n=2000
73 Correct 8 ms 2424 KB n=2000
74 Correct 9 ms 2680 KB n=1844
75 Correct 8 ms 2424 KB n=2000
76 Correct 10 ms 3064 KB n=2000
77 Correct 10 ms 3064 KB n=2000
78 Correct 10 ms 3064 KB n=2000
79 Correct 9 ms 2552 KB n=2000
80 Correct 14 ms 4728 KB n=2000
81 Correct 14 ms 4856 KB n=2000
82 Correct 11 ms 2552 KB n=2000
83 Correct 13 ms 4728 KB n=2000
84 Correct 14 ms 5368 KB n=2000
85 Correct 16 ms 5752 KB n=2000
86 Correct 16 ms 5880 KB n=2000
87 Correct 15 ms 5496 KB n=2000
88 Correct 10 ms 2964 KB n=2000
89 Correct 9 ms 2936 KB n=2000
90 Correct 9 ms 2936 KB n=2000
91 Correct 10 ms 2680 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 380 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 380 KB n=100
11 Correct 2 ms 376 KB n=100
12 Correct 2 ms 376 KB n=100
13 Correct 2 ms 504 KB n=100
14 Correct 2 ms 412 KB n=100
15 Correct 2 ms 504 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 508 KB n=100
21 Correct 2 ms 380 KB n=100
22 Correct 2 ms 384 KB n=100
23 Correct 4 ms 388 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 888 KB n=500
29 Correct 4 ms 1192 KB n=500
30 Correct 4 ms 1292 KB n=500
31 Correct 3 ms 1144 KB n=500
32 Correct 4 ms 888 KB n=500
33 Correct 4 ms 1144 KB n=500
34 Correct 4 ms 860 KB n=500
35 Correct 4 ms 1144 KB n=500
36 Correct 3 ms 732 KB n=500
37 Correct 3 ms 760 KB n=500
38 Correct 3 ms 808 KB n=500
39 Correct 3 ms 888 KB n=500
40 Correct 3 ms 816 KB n=500
41 Correct 3 ms 760 KB n=500
42 Correct 4 ms 860 KB n=500
43 Correct 4 ms 888 KB n=500
44 Correct 4 ms 908 KB n=500
45 Correct 3 ms 760 KB n=500
46 Correct 4 ms 1200 KB n=500
47 Correct 4 ms 1144 KB n=500
48 Correct 3 ms 760 KB n=500
49 Correct 4 ms 1144 KB n=500
50 Correct 4 ms 1272 KB n=500
51 Correct 4 ms 1400 KB n=500
52 Correct 4 ms 1272 KB n=500
53 Correct 5 ms 1272 KB n=500
54 Correct 3 ms 888 KB n=500
55 Correct 3 ms 760 KB n=278
56 Correct 4 ms 888 KB n=500
57 Correct 4 ms 888 KB n=500
58 Correct 3 ms 760 KB n=500
59 Correct 10 ms 2936 KB n=2000
60 Correct 14 ms 4856 KB n=2000
61 Correct 15 ms 5112 KB n=2000
62 Correct 14 ms 4984 KB n=2000
63 Correct 10 ms 2936 KB n=2000
64 Correct 17 ms 5112 KB n=2000
65 Correct 10 ms 2936 KB n=2000
66 Correct 14 ms 5112 KB n=2000
67 Correct 12 ms 3448 KB n=2000
68 Correct 15 ms 5112 KB n=2000
69 Correct 8 ms 2296 KB n=2000
70 Correct 8 ms 2296 KB n=2000
71 Correct 7 ms 2296 KB n=2000
72 Correct 8 ms 2396 KB n=2000
73 Correct 8 ms 2424 KB n=2000
74 Correct 9 ms 2680 KB n=1844
75 Correct 8 ms 2424 KB n=2000
76 Correct 10 ms 3064 KB n=2000
77 Correct 10 ms 3064 KB n=2000
78 Correct 10 ms 3064 KB n=2000
79 Correct 9 ms 2552 KB n=2000
80 Correct 14 ms 4728 KB n=2000
81 Correct 14 ms 4856 KB n=2000
82 Correct 11 ms 2552 KB n=2000
83 Correct 13 ms 4728 KB n=2000
84 Correct 14 ms 5368 KB n=2000
85 Correct 16 ms 5752 KB n=2000
86 Correct 16 ms 5880 KB n=2000
87 Correct 15 ms 5496 KB n=2000
88 Correct 10 ms 2964 KB n=2000
89 Correct 9 ms 2936 KB n=2000
90 Correct 9 ms 2936 KB n=2000
91 Correct 10 ms 2680 KB n=2000
92 Runtime error 739 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
93 Halted 0 ms 0 KB -