oj.uz

Submission #894135

# Submission time Handle Problem Language Result Execution time Memory
894135 2023-12-28T01:49:00 Z vovik Cats or Dogs (JOI18_catdog) C++17
100 / 100
 134 ms 25516 KB 
#include <bits/stdc++.h>

void initialize(int N, std::vector<int> A, std::vector<int> B);

int cat(int v), dog(int v), neighbor(int v);

struct segTree {
    int n;
    using node = std::array<std::array<int, 2>, 2>;
    std::vector<node> t;

    node merge(node a, node b) {
        node c;
        for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) c[i][j] = std::min({a[i][0] + b[0][j], a[i][1] + b[1][j]});
        return c;
    }

    segTree() = default;

    segTree(int n) {
        while (__builtin_popcount(n) != 1) ++n;
        this->n = n, t = std::vector<node>(n * 2);
        for (auto&f: t) f[0][1] = f[1][0] = 1;
    }

    void modify(int i, int x, int y) {
        i += n;
        t[i][0][0] += x, t[i][0][1] += x;
        t[i][1][0] += y, t[i][1][1] += y;
        while (i /= 2) t[i] = merge(t[i * 2], t[i * 2 + 1]);
    }

    std::pair<int, int> get() {
        int x = std::min(t[1][0][0], t[1][0][1]);
        int y = std::min(t[1][1][0], t[1][1][1]);
        return {std::min(x, y + 1), std::min(x + 1, y)};
    }
};

segTree ok[100005];

int pos[100005], p[100005], f[100005], sz[100005], len[100005], tp[100005];

std::vector<int> g[100005];

void cfs(int v = 1, int p = -1) {
    for (int i = 0; i < g[v].size(); ++i) if (g[v][i] == p) g[v].erase(g[v].begin() + i);
    sz[v] = 1;
    for (auto u: g[v]) if (u != p) cfs(u, v), sz[v] += sz[u], ::p[u] = v;
    std::sort(g[v].begin(), g[v].end(), [](const int&v, const int&u) { return sz[v] > sz[u]; });
}

void dfs(int v = 1, int s = 1) {
    f[v] = s, pos[v] = len[s]++;
    for (auto u: g[v]) dfs(u, u == g[v].front() ? s : u);
}

void initialize(int N, std::vector<int> A, std::vector<int> B) {
    for (int i = 0; i < A.size(); ++i) g[A[i]].push_back(B[i]), g[B[i]].push_back(A[i]);
    cfs(), dfs();
    for (int v = 1; v <= N; ++v) if (!pos[v]) ok[v] = len[v];
}

void modify(int v, int x, int y) {
    while (v) {
        auto [w0, w1] = ok[f[v]].get();
        ok[f[v]].modify(pos[v], x, y);
        auto [n0, n1] = ok[f[v]].get();
        x = n0 - w0, y = n1 - w1, v = p[f[v]];
    }
}

int query() {
    auto [a, b] = ok[1].get();
    return std::min(a, b);
}

int cat(int v) { return tp[v] = 1, modify(v, 1e9, 0), query(); }
int dog(int v) { return tp[v] = 2, modify(v, 0, 1e9), query(); }
int neighbor(int v) { return modify(v, -1e9 * (tp[v] == 1), -1e9 * (tp[v] == 2)), tp[v] = 0, query(); }

Compilation message

catdog.cpp: In function 'void cfs(int, int)':
catdog.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < g[v].size(); ++i) if (g[v][i] == p) g[v].erase(g[v].begin() + i);
      |                     ~~^~~~~~~~~~~~~
catdog.cpp: In function 'void initialize(int, std::vector<int>, std::vector<int>)':
catdog.cpp:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int i = 0; i < A.size(); ++i) g[A[i]].push_back(B[i]), g[B[i]].push_back(A[i]);
      |                     ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8052 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8024 KB Output is correct
8 Correct 2 ms 8112 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8244 KB Output is correct
12 Correct 2 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 2 ms 8028 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8052 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8024 KB Output is correct
8 Correct 2 ms 8112 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8244 KB Output is correct
12 Correct 2 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 2 ms 8028 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 3 ms 8280 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct
21 Correct 2 ms 8284 KB Output is correct
22 Correct 2 ms 8280 KB Output is correct
23 Correct 3 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 2 ms 8280 KB Output is correct
26 Correct 2 ms 8280 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct
29 Correct 3 ms 8284 KB Output is correct
30 Correct 2 ms 8284 KB Output is correct
31 Correct 2 ms 8284 KB Output is correct
32 Correct 3 ms 8284 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8028 KB Output is correct
2 Correct 2 ms 8028 KB Output is correct
3 Correct 2 ms 8028 KB Output is correct
4 Correct 2 ms 8028 KB Output is correct
5 Correct 2 ms 8052 KB Output is correct
6 Correct 2 ms 8024 KB Output is correct
7 Correct 3 ms 8024 KB Output is correct
8 Correct 2 ms 8112 KB Output is correct
9 Correct 2 ms 8028 KB Output is correct
10 Correct 2 ms 8028 KB Output is correct
11 Correct 2 ms 8244 KB Output is correct
12 Correct 2 ms 8028 KB Output is correct
13 Correct 2 ms 8028 KB Output is correct
14 Correct 2 ms 8028 KB Output is correct
15 Correct 2 ms 8028 KB Output is correct
16 Correct 2 ms 8028 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 4 ms 8284 KB Output is correct
19 Correct 3 ms 8280 KB Output is correct
20 Correct 2 ms 8284 KB Output is correct
21 Correct 2 ms 8284 KB Output is correct
22 Correct 2 ms 8280 KB Output is correct
23 Correct 3 ms 8284 KB Output is correct
24 Correct 2 ms 8284 KB Output is correct
25 Correct 2 ms 8280 KB Output is correct
26 Correct 2 ms 8280 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 2 ms 8284 KB Output is correct
29 Correct 3 ms 8284 KB Output is correct
30 Correct 2 ms 8284 KB Output is correct
31 Correct 2 ms 8284 KB Output is correct
32 Correct 3 ms 8284 KB Output is correct
33 Correct 69 ms 13592 KB Output is correct
34 Correct 36 ms 14164 KB Output is correct
35 Correct 62 ms 12260 KB Output is correct
36 Correct 111 ms 17308 KB Output is correct
37 Correct 13 ms 10840 KB Output is correct
38 Correct 134 ms 18268 KB Output is correct
39 Correct 128 ms 18248 KB Output is correct
40 Correct 124 ms 18524 KB Output is correct
41 Correct 119 ms 18336 KB Output is correct
42 Correct 111 ms 18376 KB Output is correct
43 Correct 113 ms 18236 KB Output is correct
44 Correct 106 ms 18264 KB Output is correct
45 Correct 112 ms 18344 KB Output is correct
46 Correct 110 ms 18264 KB Output is correct
47 Correct 127 ms 18500 KB Output is correct
48 Correct 45 ms 15812 KB Output is correct
49 Correct 51 ms 17600 KB Output is correct
50 Correct 16 ms 10328 KB Output is correct
51 Correct 21 ms 11732 KB Output is correct
52 Correct 11 ms 10076 KB Output is correct
53 Correct 66 ms 17440 KB Output is correct
54 Correct 40 ms 12380 KB Output is correct
55 Correct 90 ms 15260 KB Output is correct
56 Correct 60 ms 12796 KB Output is correct
57 Correct 89 ms 16976 KB Output is correct
58 Correct 15 ms 12244 KB Output is correct
59 Correct 21 ms 11692 KB Output is correct
60 Correct 46 ms 16588 KB Output is correct
61 Correct 59 ms 16900 KB Output is correct
62 Correct 39 ms 15312 KB Output is correct
63 Correct 34 ms 15440 KB Output is correct
64 Correct 31 ms 17488 KB Output is correct
65 Correct 42 ms 23644 KB Output is correct
66 Correct 36 ms 11852 KB Output is correct
67 Correct 40 ms 18524 KB Output is correct
68 Correct 85 ms 22356 KB Output is correct
69 Correct 18 ms 9564 KB Output is correct
70 Correct 5 ms 8280 KB Output is correct
71 Correct 33 ms 15320 KB Output is correct
72 Correct 60 ms 21780 KB Output is correct
73 Correct 104 ms 25516 KB Output is correct
74 Correct 127 ms 22120 KB Output is correct
75 Correct 82 ms 25424 KB Output is correct
76 Correct 92 ms 24996 KB Output is correct
77 Correct 107 ms 22352 KB Output is correct