oj.uz

Submission #421817

# Submission time Handle Problem Language Result Execution time Memory
421817 2021-06-09T12:37:13 Z 최서현(#7479) Cats or Dogs (JOI18_catdog) C++17
100 / 100
 397 ms 25136 KB 
#include "catdog.h"
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<long long, long long>
#define plll pair<long long, pll>
#define tiii tuple<int, int, int>
#define tiiii tuple<int, int, int, int>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
//#define DEBUG
const int INF = (int)1e9 + 7;

using namespace std;

int n;
int A[101010];
vector<int> gph[101010];
int par[101010];
int I[101010];
int sz[101010];
int dep[101010];
int in[101010];
int inv[101010];
int cnt;
int up[101010];
int ans;

void dfs1(int x, int p, int d)
{
    par[x] = p;
    sz[x] = 1;
    dep[x] = d;
    vector<int> tmp;
    for(auto y : gph[x]) if(y != p)
    {
        dfs1(y, x, d + 1);
        I[x] += A[y];
        sz[x] += sz[y];
        tmp.push_back(y);
    }
    gph[x].swap(tmp);
}

void dfs2(int x, int u)
{
    in[x] = cnt++;
    up[x] = u;
    for(int i = 1; i < (int)gph[x].size(); ++i)
        if(sz[gph[x][0]] < sz[gph[x][i]]) swap(gph[x][0], gph[x][i]);

    if(gph[x].size()) dfs2(gph[x][0], u);
    for(int i = 1; i < (int)gph[x].size(); ++i) dfs2(gph[x][i], gph[x][i]);
}

pii seg[808080];
int lazy[808080];

void prop(int ind)
{
    seg[ind << 1].ff += lazy[ind];
    seg[ind << 1].ss += lazy[ind];
    lazy[ind << 1] += lazy[ind];
    seg[ind << 1 | 1].ff += lazy[ind];
    seg[ind << 1 | 1].ss += lazy[ind];
    lazy[ind << 1 | 1] += lazy[ind];
    lazy[ind] = 0;
}

void mrge(int ind)
{
    seg[ind].ff = min(seg[ind << 1].ff, seg[ind << 1 | 1].ff);
    seg[ind].ss = max(seg[ind << 1].ss, seg[ind << 1 | 1].ss);
}

void init(int ind, int s, int e)
{
    if(s + 1 == e)
    {
        seg[ind] = { I[inv[s]] + INF * A[inv[s]], I[inv[s]] + INF * A[inv[s]] };
        return;
    }

    int mid = s + e >> 1;
    init(ind << 1, s, mid);
    init(ind << 1 | 1, mid, e);
    mrge(ind);
}

int upd(int ind, int s, int e, int l, int r, int lb, int ub, int x)
{
    if(e <= l || r <= s) return -1;
    if(l <= s && e <= r && lb <= seg[ind].ff && seg[ind].ss <= ub)
    {
        seg[ind].ff += x;
        seg[ind].ss += x;
        lazy[ind] += x;
        return -1;
    }
    if(s + 1 == e) return s;

    prop(ind);
    int mid = s + e >> 1;
    int t = upd(ind << 1 | 1, mid, e, l, r, lb, ub, x);
    if(t == -1) t = upd(ind << 1, s, mid, l, r, lb, ub, x);
    mrge(ind);
    return t;
}

void pupd(int ind, int s, int e, int pos, int x, bool f)
{
    if(s + 1 == e)
    {
        if(f) ans += max({1, seg[ind].ff, -seg[ind].ff});
        seg[ind].ff = x + INF * A[inv[s]];
        seg[ind].ss = x + INF * A[inv[s]];
        if(f) ans -= max({1, seg[ind].ff, -seg[ind].ff});
        return;
    }

    prop(ind);
    int mid = s + e >> 1;
    if(pos < mid) pupd(ind << 1, s, mid, pos, x, f);
    else pupd(ind << 1 | 1, mid, e, pos, x, f);
    mrge(ind);
}

int pqry(int ind, int s, int e, int pos)
{
    if(s + 1 == e) return seg[ind].ff - INF * A[inv[s]];

    prop(ind);
    int mid = s + e >> 1;
    if(pos < mid) return pqry(ind << 1, s, mid, pos);
    else return pqry(ind << 1 | 1, mid, e, pos);
}

void qry(int pos, int x)
{
    if(pos == -1 || x == 0) return;

    int lb, ub;
    if(x == 2) lb = -1, ub = -1;
    if(x == 1) lb = -1, ub = 0;
    if(x == -1) lb = 0, ub = 1;
    if(x == -2) lb = 1, ub = 1;

    int nxt = upd(1, 0, n, in[up[pos]], in[pos], lb, ub, x);
    if(nxt == -1 && par[up[pos]] != -1)
    {
        int t = pqry(1, 0, n, in[par[up[pos]]]);
        pupd(1, 0, n, in[par[up[pos]]], t + x, true);
        t += INF * A[par[up[pos]]];
        qry(par[up[pos]], (t + x > 0) - (t + x < 0) - (t > 0) + (t < 0));
    }
    else if(nxt != -1)
    {
        int t = pqry(1, 0, n, nxt);
        pupd(1, 0, n, nxt, t + x, true);
        t += INF * A[inv[nxt]];
        qry(inv[nxt], (t + x > 0) - (t + x < 0) - (t > 0) + (t < 0));
    }
}

void initialize(int N, vector<int> A, vector<int> B)
{
    n = N;
    for(int i = 1; i < N; ++i)
    {
        int x = A[i - 1] - 1, y = B[i - 1] - 1;
        gph[x].push_back(y);
        gph[y].push_back(x);
    }
    dfs1(0, -1, 0);
    dfs2(0, 0);
    ans = -1;
    for(int i = 0; i < n; ++i) inv[in[i]] = i;
}

int realupd(int x, int c)
{
    int t = pqry(1, 0, n, in[x]);
    int del = 0;

    del -= (t + INF * A[x] > 0) - (t + INF * A[x] < 0);
    if(A[x] == 0) ans += max({1, t, -t});
    else if(A[x] == 1) ans += t;
    else ans -= t;
    A[x] = c;
    del += (t + INF * A[x] > 0) - (t + INF * A[x] < 0);
    if(A[x] == 0) ans -= max({1, t, -t});
    else if(A[x] == 1) ans -= t;
    else ans += t;
    pupd(1, 0, n, in[x], t, false);

    qry(x, del);

    int tmp = ans + ((A[0] || pqry(1, 0, n, in[0])) ? 0 : 1);
    if(tmp & 1) return 0;
    return (ans + ((A[0] || pqry(1, 0, n, in[0])) ? 0 : 1)) / 2;
}

int cat(int v)
{
    return realupd(v - 1, 1);
}

int dog(int v)
{
    return realupd(v - 1, -1);
}

int neighbor(int v)
{
    return realupd(v - 1, 0);
}

Compilation message

catdog.cpp: In function 'void init(int, int, int)':
catdog.cpp:89:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |     int mid = s + e >> 1;
      |               ~~^~~
catdog.cpp: In function 'int upd(int, int, int, int, int, int, int, int)':
catdog.cpp:108:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  108 |     int mid = s + e >> 1;
      |               ~~^~~
catdog.cpp: In function 'void pupd(int, int, int, int, int, bool)':
catdog.cpp:127:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  127 |     int mid = s + e >> 1;
      |               ~~^~~
catdog.cpp: In function 'int pqry(int, int, int, int)':
catdog.cpp:138:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  138 |     int mid = s + e >> 1;
      |               ~~^~~

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 2 ms 2652 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 2 ms 2696 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 2 ms 2652 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 2 ms 2696 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 2808 KB Output is correct
18 Correct 3 ms 2780 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 4 ms 2764 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2800 KB Output is correct
29 Correct 3 ms 2892 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2672 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 2 ms 2652 KB Output is correct
4 Correct 3 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 2 ms 2696 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 2808 KB Output is correct
18 Correct 3 ms 2780 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 3 ms 2636 KB Output is correct
22 Correct 2 ms 2636 KB Output is correct
23 Correct 3 ms 2764 KB Output is correct
24 Correct 4 ms 2764 KB Output is correct
25 Correct 4 ms 2764 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 2 ms 2636 KB Output is correct
28 Correct 2 ms 2800 KB Output is correct
29 Correct 3 ms 2892 KB Output is correct
30 Correct 2 ms 2636 KB Output is correct
31 Correct 2 ms 2764 KB Output is correct
32 Correct 2 ms 2672 KB Output is correct
33 Correct 194 ms 10116 KB Output is correct
34 Correct 90 ms 9924 KB Output is correct
35 Correct 170 ms 8844 KB Output is correct
36 Correct 273 ms 15628 KB Output is correct
37 Correct 21 ms 6120 KB Output is correct
38 Correct 385 ms 16496 KB Output is correct
39 Correct 311 ms 16624 KB Output is correct
40 Correct 331 ms 16504 KB Output is correct
41 Correct 287 ms 16484 KB Output is correct
42 Correct 314 ms 16516 KB Output is correct
43 Correct 291 ms 16496 KB Output is correct
44 Correct 382 ms 16516 KB Output is correct
45 Correct 361 ms 16532 KB Output is correct
46 Correct 343 ms 16468 KB Output is correct
47 Correct 379 ms 16460 KB Output is correct
48 Correct 184 ms 12644 KB Output is correct
49 Correct 181 ms 14304 KB Output is correct
50 Correct 68 ms 5616 KB Output is correct
51 Correct 77 ms 7600 KB Output is correct
52 Correct 35 ms 5212 KB Output is correct
53 Correct 272 ms 14784 KB Output is correct
54 Correct 169 ms 8512 KB Output is correct
55 Correct 365 ms 13592 KB Output is correct
56 Correct 240 ms 9360 KB Output is correct
57 Correct 397 ms 14488 KB Output is correct
58 Correct 32 ms 7472 KB Output is correct
59 Correct 61 ms 6524 KB Output is correct
60 Correct 172 ms 13296 KB Output is correct
61 Correct 204 ms 13804 KB Output is correct
62 Correct 116 ms 11924 KB Output is correct
63 Correct 68 ms 11640 KB Output is correct
64 Correct 81 ms 14120 KB Output is correct
65 Correct 94 ms 20172 KB Output is correct
66 Correct 92 ms 7188 KB Output is correct
67 Correct 115 ms 15148 KB Output is correct
68 Correct 198 ms 20356 KB Output is correct
69 Correct 54 ms 4576 KB Output is correct
70 Correct 10 ms 3016 KB Output is correct
71 Correct 86 ms 11576 KB Output is correct
72 Correct 179 ms 18568 KB Output is correct
73 Correct 293 ms 25136 KB Output is correct
74 Correct 301 ms 19396 KB Output is correct
75 Correct 228 ms 24900 KB Output is correct
76 Correct 298 ms 22948 KB Output is correct
77 Correct 280 ms 20016 KB Output is correct