oj.uz

답안 #894137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894137 2023-12-28T01:52:27 Z vovik Cats or Dogs (JOI18_catdog) C++17
100 / 100
 106 ms 25424 KB 
#include <bits/stdc++.h>
char mem[(int)1e8];

size_t cur = 0;

void *operator new(size_t n) {return mem + (cur += n) - n;}
void operator delete(void *) noexcept {}
void operator delete(void *, size_t) noexcept {}

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]), 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:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     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:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8792 KB Output is correct
11 Correct 1 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 1 ms 8796 KB Output is correct
16 Correct 1 ms 8792 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8792 KB Output is correct
11 Correct 1 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 1 ms 8796 KB Output is correct
16 Correct 1 ms 8792 KB Output is correct
17 Correct 2 ms 8792 KB Output is correct
18 Correct 2 ms 8632 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 2 ms 8796 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 2 ms 8796 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8796 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct
31 Correct 1 ms 8796 KB Output is correct
32 Correct 2 ms 8796 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 1 ms 8796 KB Output is correct
4 Correct 1 ms 8796 KB Output is correct
5 Correct 1 ms 8796 KB Output is correct
6 Correct 1 ms 8796 KB Output is correct
7 Correct 1 ms 8796 KB Output is correct
8 Correct 1 ms 8796 KB Output is correct
9 Correct 1 ms 8796 KB Output is correct
10 Correct 1 ms 8792 KB Output is correct
11 Correct 1 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 1 ms 8796 KB Output is correct
14 Correct 2 ms 8796 KB Output is correct
15 Correct 1 ms 8796 KB Output is correct
16 Correct 1 ms 8792 KB Output is correct
17 Correct 2 ms 8792 KB Output is correct
18 Correct 2 ms 8632 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 1 ms 8796 KB Output is correct
21 Correct 2 ms 8796 KB Output is correct
22 Correct 2 ms 8796 KB Output is correct
23 Correct 2 ms 8796 KB Output is correct
24 Correct 2 ms 8796 KB Output is correct
25 Correct 2 ms 8796 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 2 ms 8796 KB Output is correct
28 Correct 2 ms 8796 KB Output is correct
29 Correct 2 ms 8796 KB Output is correct
30 Correct 2 ms 8796 KB Output is correct
31 Correct 1 ms 8796 KB Output is correct
32 Correct 2 ms 8796 KB Output is correct
33 Correct 69 ms 13140 KB Output is correct
34 Correct 28 ms 13144 KB Output is correct
35 Correct 59 ms 13172 KB Output is correct
36 Correct 91 ms 17528 KB Output is correct
37 Correct 9 ms 10844 KB Output is correct
38 Correct 98 ms 17524 KB Output is correct
39 Correct 102 ms 17748 KB Output is correct
40 Correct 99 ms 17492 KB Output is correct
41 Correct 106 ms 17492 KB Output is correct
42 Correct 94 ms 17524 KB Output is correct
43 Correct 102 ms 17488 KB Output is correct
44 Correct 91 ms 17492 KB Output is correct
45 Correct 92 ms 17488 KB Output is correct
46 Correct 99 ms 17540 KB Output is correct
47 Correct 104 ms 17748 KB Output is correct
48 Correct 32 ms 15196 KB Output is correct
49 Correct 37 ms 15216 KB Output is correct
50 Correct 14 ms 10844 KB Output is correct
51 Correct 17 ms 12892 KB Output is correct
52 Correct 8 ms 10840 KB Output is correct
53 Correct 51 ms 17028 KB Output is correct
54 Correct 35 ms 12888 KB Output is correct
55 Correct 81 ms 15232 KB Output is correct
56 Correct 50 ms 13188 KB Output is correct
57 Correct 70 ms 17236 KB Output is correct
58 Correct 12 ms 12892 KB Output is correct
59 Correct 17 ms 10868 KB Output is correct
60 Correct 36 ms 14976 KB Output is correct
61 Correct 41 ms 14936 KB Output is correct
62 Correct 26 ms 14940 KB Output is correct
63 Correct 22 ms 15452 KB Output is correct
64 Correct 25 ms 16724 KB Output is correct
65 Correct 34 ms 22540 KB Output is correct
66 Correct 34 ms 11868 KB Output is correct
67 Correct 32 ms 19032 KB Output is correct
68 Correct 64 ms 22132 KB Output is correct
69 Correct 17 ms 11352 KB Output is correct
70 Correct 5 ms 8792 KB Output is correct
71 Correct 30 ms 15804 KB Output is correct
72 Correct 45 ms 22456 KB Output is correct
73 Correct 92 ms 24876 KB Output is correct
74 Correct 94 ms 21368 KB Output is correct
75 Correct 74 ms 24628 KB Output is correct
76 Correct 71 ms 25424 KB Output is correct
77 Correct 99 ms 21524 KB Output is correct