oj.uz

답안 #253907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253907 2020-07-29T05:36:44 Z IgorI Cats or Dogs (JOI18_catdog) C++17
100 / 100
 281 ms 64680 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = 1e8;
const int N = 100002;

struct Table{
    int a00, a01, a10, a11;
};

Table Merge(Table &A, Table &B)
{
    Table S;
    S.a00 = min(min(A.a00 + B.a00, A.a01 + B.a10), min(A.a00 + B.a10, A.a01 + B.a00) + 1);
    S.a01 = min(min(A.a00 + B.a01, A.a01 + B.a11), min(A.a00 + B.a11, A.a01 + B.a01) + 1);
    S.a11 = min(min(A.a10 + B.a01, A.a11 + B.a11), min(A.a10 + B.a11, A.a11 + B.a01) + 1);
    S.a10 = min(min(A.a10 + B.a00, A.a11 + B.a10), min(A.a10 + B.a10, A.a11 + B.a00) + 1);
    return S;
}

struct Sollution{
    vector<Table> tree;
    void build(int L, int R, int V)
    {
        if (L + 1 == R)
        {
            tree[V].a01 = INF;
            tree[V].a10 = INF;
            return;
        }
        tree[V].a01 = 1;
        tree[V].a10 = 1;
        int M = (L + R) / 2;
        build(L, M, 2 * V + 1);
        build(M, R, 2 * V + 2);
    }
    Sollution(int _n)
    {
        tree.resize(4 * _n);
        build(0, _n, 0);
    }
    void __Change(int pos, int cost0, int cost1, int L, int R, int V)
    {
        if (L + 1 == R)
        {
            tree[V].a00 += cost0;
            tree[V].a11 += cost1;
            return;
        }
        int M = (L + R) / 2;
        if (pos < M) __Change(pos, cost0, cost1, L, M, 2 * V + 1);
        else __Change(pos, cost0, cost1, M, R, 2 * V + 2);
        tree[V] = Merge(tree[2 * V + 1], tree[2 * V + 2]);
    }
    void Change(int pos, int cost0, int cost1)
    {
        __Change(pos, cost0, cost1, 0, tree.size() / 4, 0);
    }
    Table Cost()
    {
        return tree[0];
    }
};

ll n;
vector<int> graph[N];
ll x[N];
ll papa[N];
ll sz[N];

int main_child[N];
vector<int> other_child[N];
vector<vector<int> > route;
vector<Sollution> hld;
int route_pos[N];
int route_id[N];

void dfs1(int v, int p)
{
    papa[v] = p;
    sz[v] = 1;
    for (auto u : graph[v]) if (u != p)
    {
        dfs1(u, v);
        sz[v] += sz[u];
    }
}

void dfs2(int v, int p)
{
    int mxsz = 0, id = -1;
    for (auto u : graph[v]) if (u != p)
    {
        if (sz[u] > mxsz)
        {
            mxsz = sz[u];
            id = u;
        }
    }
    main_child[v] = id;
    for (auto u : graph[v]) if (u != p)
    {
        dfs2(u, v);
        if (u != id) other_child[v].push_back(u);
    }
}

int answer()
{
    Table T = hld[0].Cost();
    return min(min(T.a00, T.a01), min(T.a10, T.a11));
}

void initialize(int n0, vector<int> a, vector<int> b)
{
    n = n0;
    for (int i = 0; i < n - 1; i++)
    {
        a[i]--, b[i]--;
        graph[a[i]].push_back(b[i]);
        graph[b[i]].push_back(a[i]);
    }
    for (int i = 0; i < n; i++)
    {
        x[i] = -1;
    }
    dfs1(0, 0);
    dfs2(0, 0);
    for (int i = 0; i < n; i++)
    {
        route_id[i] = -1;
        route_pos[i] = -1;
    }
    for (int i = 0; i < n; i++)
    {
        if (route_id[i] == -1)
        {
            vector<int> r;
            int x = i;
            while (x != -1)
            {
                r.push_back(x);
                x = main_child[x];
            }
            for (int j = 0; j < r.size(); j++)
            {
                route_id[r[j]] = route.size();
                route_pos[r[j]] = j;
            }
            route.push_back(r);
            hld.push_back(Sollution(r.size()));
        }
    }
}

void Change(int v, int cost0, int cost1)
{
    int x = route_id[v];
    int y = route_pos[v];
    Table oldT = hld[x].Cost();
    int oldminc0 = min(oldT.a00, oldT.a01);
    int oldminc1 = min(oldT.a10, oldT.a11);
    int oldd0 = min(oldminc0, oldminc1 + 1);
    int oldd1 = min(oldminc0 + 1, oldminc1);
    hld[x].Change(y, cost0, cost1);
    Table T = hld[x].Cost();
    int minc0 = min(T.a00, T.a01);
    int minc1 = min(T.a10, T.a11);
    int d0 = min(minc0, minc1 + 1);
    int d1 = min(minc0 + 1, minc1);
    v = route[x][0];
    if (v == 0) return;
    v = papa[v];
    Change(v, d0 - oldd0, d1 - oldd1);
}

int cat(int v)
{
    v--;
    x[v] = 0;
    Change(v, 0, INF);
    return answer();
}

int dog(int v)
{
    v--;
    x[v] = 1;
    Change(v, INF, 0);
    return answer();
}

int neighbor(int v)
{
    v--;
    if (x[v] == 0) Change(v, 0, -INF);
    if (x[v] == 1) Change(v, -INF, 0);
    x[v] = -1;
    return answer();
}

#ifdef LOCAL
int main()
{
    int n;
    cin >> n;
    vector<int> a(n - 1), b(n - 1);
    for (int i = 0; i < n - 1; i++)
    {
        cin >> a[i] >> b[i];
    }
    initialize(n, a, b);
    int q;
    cin >> q;
    while (q--)
    {
        int t, v;
        cin >> t >> v;
        if (t == 1) cout << cat(v) << endl;
        if (t == 2) cout << dog(v) << endl;
        if (t == 3) cout << neighbor(v) << endl;
    }
}
#endif // LOCAL

Compilation message

catdog.cpp: In function 'void initialize(int, std::vector<int>, std::vector<int>)':
catdog.cpp:148:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int j = 0; j < r.size(); j++)
                             ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 3 ms 5120 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 3 ms 4992 KB Output is correct
13 Correct 3 ms 4992 KB Output is correct
14 Correct 3 ms 4992 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 3 ms 4992 KB Output is correct
17 Correct 4 ms 5248 KB Output is correct
18 Correct 4 ms 5248 KB Output is correct
19 Correct 4 ms 5248 KB Output is correct
20 Correct 3 ms 5120 KB Output is correct
21 Correct 3 ms 5120 KB Output is correct
22 Correct 4 ms 5120 KB Output is correct
23 Correct 5 ms 5248 KB Output is correct
24 Correct 4 ms 5248 KB Output is correct
25 Correct 4 ms 5120 KB Output is correct
26 Correct 3 ms 5120 KB Output is correct
27 Correct 4 ms 5120 KB Output is correct
28 Correct 4 ms 5248 KB Output is correct
29 Correct 4 ms 5248 KB Output is correct
30 Correct 3 ms 5120 KB Output is correct
31 Correct 4 ms 5248 KB Output is correct
32 Correct 3 ms 5120 KB Output is correct
33 Correct 134 ms 18848 KB Output is correct
34 Correct 86 ms 21600 KB Output is correct
35 Correct 120 ms 14432 KB Output is correct
36 Correct 236 ms 28840 KB Output is correct
37 Correct 31 ms 12820 KB Output is correct
38 Correct 265 ms 31420 KB Output is correct
39 Correct 257 ms 31436 KB Output is correct
40 Correct 255 ms 31440 KB Output is correct
41 Correct 258 ms 31700 KB Output is correct
42 Correct 255 ms 31692 KB Output is correct
43 Correct 255 ms 31440 KB Output is correct
44 Correct 273 ms 31440 KB Output is correct
45 Correct 281 ms 31440 KB Output is correct
46 Correct 270 ms 31488 KB Output is correct
47 Correct 256 ms 31436 KB Output is correct
48 Correct 99 ms 23776 KB Output is correct
49 Correct 116 ms 28120 KB Output is correct
50 Correct 33 ms 9848 KB Output is correct
51 Correct 47 ms 14432 KB Output is correct
52 Correct 24 ms 9720 KB Output is correct
53 Correct 156 ms 30688 KB Output is correct
54 Correct 108 ms 15904 KB Output is correct
55 Correct 222 ms 23060 KB Output is correct
56 Correct 137 ms 16984 KB Output is correct
57 Correct 208 ms 28512 KB Output is correct
58 Correct 38 ms 15452 KB Output is correct
59 Correct 43 ms 13160 KB Output is correct
60 Correct 104 ms 25432 KB Output is correct
61 Correct 111 ms 26328 KB Output is correct
62 Correct 77 ms 23392 KB Output is correct
63 Correct 58 ms 26136 KB Output is correct
64 Correct 64 ms 28212 KB Output is correct
65 Correct 98 ms 46688 KB Output is correct
66 Correct 54 ms 11256 KB Output is correct
67 Correct 80 ms 32560 KB Output is correct
68 Correct 151 ms 46520 KB Output is correct
69 Correct 27 ms 6784 KB Output is correct
70 Correct 8 ms 5248 KB Output is correct
71 Correct 57 ms 15072 KB Output is correct
72 Correct 91 ms 25056 KB Output is correct
73 Correct 154 ms 30324 KB Output is correct
74 Correct 221 ms 64680 KB Output is correct
75 Correct 155 ms 31476 KB Output is correct
76 Correct 162 ms 35764 KB Output is correct
77 Correct 189 ms 54292 KB Output is correct