oj.uz

Submission #401580

# Submission time Handle Problem Language Result Execution time Memory
401580 2021-05-10T13:48:43 Z timmyfeng Cats or Dogs (JOI18_catdog) C++17
100 / 100
 347 ms 38340 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 100001;

struct segtree {
    segtree *left, *right;
    array<long long, 4> mini;

    void pull() {
        mini = {N, N, N, N};
        for (int i = 0; i < 4; ++i) {
            for (int j = 0; j < 4; ++j) {
                int k = i / 2 * 2 + j % 2;
                mini[k] = min(mini[k], left->mini[i] + right->mini[j] + (i % 2 != j / 2));
            }
        }
    }

    segtree(int l, int r) {
        if (l == r) {
            mini = {0, N, N, 0};
        } else {
            int m = (l + r) / 2;
            left = new segtree(l, m);
            right = new segtree(m + 1, r);
            pull();
        }
    }

    void update(int a, long long x, long long y, int l, int r) {
        if (l == r) {
            mini[0] += x;
            mini[3] += y;
        } else {
            int m = (l + r) / 2;
            if (a <= m) {
                left->update(a, x, y, l, m);
            } else {
                right->update(a, x, y, m + 1, r);
            }
            pull();
        }
    }
};

int par[N], sub[N], in[N], head[N], tail[N];
segtree *path[N];

vector<int> adj[N];
int type[N];

void dfs_sub(int u) {
    sub[u] = 1;
    for (auto &c : adj[u]) {
        adj[c].erase(find(adj[c].begin(), adj[c].end(), u));
        par[c] = u;

        dfs_sub(c);
        sub[u] += sub[c];
        if (sub[c] > sub[adj[u][0]]) {
            swap(adj[u][0], c);
        }
    }
}

void dfs_hld(int u) {
    sub[u] = 0;
    for (auto c : adj[u]) {
        if (c == adj[u][0]) {
            head[c] = head[u];
            in[c] = in[u] + 1;
        } else {
            head[c] = c;
        }
        dfs_hld(c);
    }
    ++sub[head[u]];
}

array<long long, 2> get(array<long long, 4> &a) {
    long long x = min(a[0], a[1]), y = min(a[2], a[3]);
    return {min(x, y + 1), min(x + 1, y)};
}

void dfs_build(int u) {
    if (head[u] == u) {
        path[u] = new segtree(0, sub[u] - 1);
    }

    for (auto c : adj[u]) {
        dfs_build(c);
    }

    if (head[u] == u && u > 1) {
        array<long long, 2> mini = get(path[u]->mini);
        int p = par[u], v = head[p];
        path[v]->update(in[p], mini[0], mini[1], 0, sub[v] - 1);
    }
}

void update(int u, long long x, long long y) {
    while (u > 0) {
        int v = head[u];

        array<long long, 2> prv = get(path[v]->mini);
        path[v]->update(in[u], x, y, 0, sub[v] - 1);
        array<long long, 2> cur = get(path[v]->mini);

        u = par[v];
        x = cur[0] - prv[0];
        y = cur[1] - prv[1];
    }
}

long long query() {
    array<long long, 4> mini = path[1]->mini;
    return *min_element(mini.begin(), mini.end());
}

void initialize(int n, vector<int> a, vector<int> b) {
    for (int i = 0; i < n - 1; ++i) {
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }

    fill(type, type + n + 1, -1);

    head[1] = 1;

    dfs_sub(1);
    dfs_hld(1);
    dfs_build(1);
}

int cat(int u) {
    update(u, 0, N);
    type[u] = 0;
    return query();
}

int dog(int u) {
    update(u, N, 0);
    type[u] = 1;
    return query();
}

int neighbor(int u) {
    if (type[u] == 0) {
        update(u, 0, -N);
    } else {
        update(u, -N, 0);
    }
    type[u] = -1;
    return query();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 3 ms 2636 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 3 ms 2636 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 3 ms 2636 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 3 ms 2636 KB Output is correct
23 Correct 4 ms 2768 KB Output is correct
24 Correct 4 ms 2764 KB Output is correct
25 Correct 3 ms 2764 KB Output is correct
26 Correct 3 ms 2768 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 3 ms 2892 KB Output is correct
29 Correct 4 ms 2892 KB Output is correct
30 Correct 3 ms 2636 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 3 ms 2636 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 3 ms 2764 KB Output is correct
18 Correct 3 ms 2764 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 3 ms 2636 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 3 ms 2636 KB Output is correct
23 Correct 4 ms 2768 KB Output is correct
24 Correct 4 ms 2764 KB Output is correct
25 Correct 3 ms 2764 KB Output is correct
26 Correct 3 ms 2768 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 3 ms 2892 KB Output is correct
29 Correct 4 ms 2892 KB Output is correct
30 Correct 3 ms 2636 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2636 KB Output is correct
33 Correct 199 ms 13492 KB Output is correct
34 Correct 94 ms 15040 KB Output is correct
35 Correct 163 ms 10556 KB Output is correct
36 Correct 299 ms 21076 KB Output is correct
37 Correct 27 ms 8232 KB Output is correct
38 Correct 327 ms 22972 KB Output is correct
39 Correct 347 ms 22944 KB Output is correct
40 Correct 321 ms 23076 KB Output is correct
41 Correct 323 ms 22928 KB Output is correct
42 Correct 316 ms 23008 KB Output is correct
43 Correct 323 ms 23016 KB Output is correct
44 Correct 323 ms 22936 KB Output is correct
45 Correct 342 ms 23052 KB Output is correct
46 Correct 316 ms 23064 KB Output is correct
47 Correct 342 ms 22996 KB Output is correct
48 Correct 90 ms 14288 KB Output is correct
49 Correct 104 ms 17312 KB Output is correct
50 Correct 30 ms 5816 KB Output is correct
51 Correct 41 ms 8284 KB Output is correct
52 Correct 20 ms 5556 KB Output is correct
53 Correct 177 ms 21700 KB Output is correct
54 Correct 109 ms 11004 KB Output is correct
55 Correct 263 ms 16868 KB Output is correct
56 Correct 160 ms 12072 KB Output is correct
57 Correct 235 ms 20380 KB Output is correct
58 Correct 32 ms 8928 KB Output is correct
59 Correct 41 ms 7976 KB Output is correct
60 Correct 95 ms 15816 KB Output is correct
61 Correct 103 ms 16400 KB Output is correct
62 Correct 71 ms 13536 KB Output is correct
63 Correct 66 ms 18500 KB Output is correct
64 Correct 71 ms 21676 KB Output is correct
65 Correct 96 ms 32864 KB Output is correct
66 Correct 85 ms 9680 KB Output is correct
67 Correct 98 ms 23796 KB Output is correct
68 Correct 192 ms 32876 KB Output is correct
69 Correct 41 ms 5204 KB Output is correct
70 Correct 11 ms 3036 KB Output is correct
71 Correct 81 ms 16472 KB Output is correct
72 Correct 122 ms 28156 KB Output is correct
73 Correct 264 ms 38340 KB Output is correct
74 Correct 291 ms 31972 KB Output is correct
75 Correct 204 ms 38248 KB Output is correct
76 Correct 198 ms 35924 KB Output is correct
77 Correct 282 ms 32596 KB Output is correct