oj.uz

Submission #390119

# Submission time Handle Problem Language Result Execution time Memory
390119 2021-04-15T11:24:16 Z maximath_1 Cats or Dogs (JOI18_catdog) C++11
100 / 100
 919 ms 42052 KB 
#include "catdog.h"
#include <vector>
#include <algorithm>
using namespace std;

const int MX = 200005;
const int inf = 1000000069;

int n, a[MX], b[MX];
vector<int> adj[MX];
int sz[MX], depth[MX], head[MX], in[MX], cnt[MX], par[MX], tim = 0;

void dfs_sz(int nw, int bf = -1){
    sz[nw] = 1;
    par[nw] = bf;
    for(int &nx : adj[nw]){
        depth[nx] = depth[nw] + 1;
        adj[nx].erase(find(adj[nx].begin(), adj[nx].end(), nw));
        dfs_sz(nx, nw);
        sz[nw] += sz[nx];
        if(sz[nx] > sz[adj[nw][0]])
            swap(nx, adj[nw][0]);
    }
}

void dfs_hld(int nw){
    in[nw] = tim ++;
    cnt[head[nw]] ++;
    for(int nx : adj[nw]){
        head[nx] = (nx == adj[nw][0] ? head[nw] : nx);
        dfs_hld(nx);
    }
}

void init_hld(int root = 0){
    par[root] = depth[root] = tim = 0;
    dfs_sz(root);
    head[root] = root;
    dfs_hld(root);
}

struct dat{
    int dp[2][2];
    dat(){dp[0][0] = dp[0][1] = dp[1][0] = dp[1][1] = inf;}
    dat(int s0, int s1, int tp){
        dp[0][0] = dp[0][1] = dp[1][0] = dp[1][1] = inf;
        if(tp != 2) dp[0][0] = s0;
        if(tp != 1) dp[1][1] = s1;
    }
};

dat merge(dat lf, dat rg){
    dat rs = dat();
    for(int pl = 0; pl < 2; pl ++)
        for(int ql = 0; ql < 2; ql ++) if(lf.dp[pl][ql] != inf){
            for(int pr = 0; pr < 2; pr ++)
                for(int qr = 0; qr < 2; qr ++) if(rg.dp[pr][qr] != inf){
                    rs.dp[pl][qr] = min(rs.dp[pl][qr], 
                        lf.dp[pl][ql] + (ql ^ pr) + rg.dp[pr][qr]);
                }
        }
    return rs;
}

dat st[MX * 4];

void build_tree(int nd, int cl, int cr){
    if(cl == cr) return void(st[nd] = dat(0, 0, 0));
    build_tree(nd * 2, cl, (cl + cr) / 2);
    build_tree(nd * 2 + 1, (cl + cr) / 2 + 1, cr);
    st[nd] = merge(st[nd * 2], st[nd * 2 + 1]);
}

void upd_tree(int nd, int cl, int cr, int ps, int s0, int s1, int tp){
    if(ps < cl || cr < ps) return;
    if(cl == cr) return void(st[nd] = dat(s0, s1, tp));

    upd_tree(nd * 2, cl, (cl + cr) / 2, ps, s0, s1, tp);
    upd_tree(nd * 2 + 1, (cl + cr) / 2 + 1, cr, ps, s0, s1, tp);
    st[nd] = merge(st[nd * 2], st[nd * 2 + 1]);
}

dat que_tree(int nd, int cl, int cr, int lf, int rg){
    if(lf <= cl && cr <= rg) return st[nd];
    if(rg <= (cl + cr) / 2)
        return que_tree(nd * 2, cl, (cl + cr) / 2, lf, rg);
    if((cl + cr) / 2 < lf)
        return que_tree(nd * 2 + 1, (cl + cr) / 2 + 1, cr, lf, rg);
    return merge(
        que_tree(nd * 2, cl, (cl + cr) / 2, lf, rg),
        que_tree(nd * 2 + 1, (cl + cr) / 2 + 1, cr, lf, rg)
    );
}

int tp[MX], s0[MX], s1[MX];

dat get_dp(int x){
    return que_tree(1, 0, n - 1, in[x], in[head[x]] + cnt[head[x]] - 1);
}

void upd_ac(int x){
    upd_tree(1, 0, n - 1, in[x], s0[x], s1[x], tp[x]);
}

int get_ans(){
    dat r1 = get_dp(0);
    int ans = inf;
    for(int i = 0; i < 2; i ++)
        for(int j = 0; j < 2; j ++)
            ans = min(ans, r1.dp[i][j]);
    return ans;
}

void change_type(int nw, int t){
    for(int cr = nw; cr != -1;){
        if(cr == head[cr]){
            if(par[cr] == -1) break;
            dat cur = get_dp(cr);
            int dp0 = min(cur.dp[0][0], cur.dp[0][1]);
            int dp1 = min(cur.dp[1][0], cur.dp[1][1]);
            s0[par[cr]] -= min(dp0, dp1 + 1);
            s1[par[cr]] -= min(dp1, dp0 + 1);
            cr = par[cr];
        }else cr = head[cr];
    }
    tp[nw] = t;
    upd_ac(nw);
    for(int cr = nw; cr != -1;){
        if(cr == head[cr]){
            if(par[cr] == -1) break;
            dat cur = get_dp(cr);
            int dp0 = min(cur.dp[0][0], cur.dp[0][1]);
            int dp1 = min(cur.dp[1][0], cur.dp[1][1]);
            s0[par[cr]] += min(dp0, dp1 + 1);
            s1[par[cr]] += min(dp1, dp0 + 1);
            upd_ac(par[cr]);
            cr = par[cr];
        }else cr = head[cr];
    }
}

void init(){
    for(int i = 0; i < MX; i ++){
        adj[i].clear();
        sz[i] = depth[i] = head[i] = in[i] = cnt[i] = par[i] = tp[i] = s1[i] = s0[i] = 0;
    }
    for(int i = 0; i < n - 1; i ++){
        adj[a[i]].push_back(b[i]);
        adj[b[i]].push_back(a[i]);
    }

    init_hld();
    build_tree(1, 0, n - 1);
}

void initialize(int _n, vector<int> _a, vector<int> _b){
    n = _n;
    for(int i = 0; i < n - 1; i ++)
        a[i] = _a[i] - 1, b[i] = _b[i] - 1;
    init();
}

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

int dog(int v){
    change_type(v - 1, 2);
    return get_ans();
}

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24524 KB Output is correct
2 Correct 15 ms 24560 KB Output is correct
3 Correct 15 ms 24524 KB Output is correct
4 Correct 14 ms 24528 KB Output is correct
5 Correct 15 ms 24524 KB Output is correct
6 Correct 15 ms 24524 KB Output is correct
7 Correct 15 ms 24520 KB Output is correct
8 Correct 17 ms 24512 KB Output is correct
9 Correct 15 ms 24520 KB Output is correct
10 Correct 14 ms 24524 KB Output is correct
11 Correct 14 ms 24548 KB Output is correct
12 Correct 14 ms 24568 KB Output is correct
13 Correct 15 ms 24508 KB Output is correct
14 Correct 14 ms 24516 KB Output is correct
15 Correct 15 ms 24464 KB Output is correct
16 Correct 15 ms 24476 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24524 KB Output is correct
2 Correct 15 ms 24560 KB Output is correct
3 Correct 15 ms 24524 KB Output is correct
4 Correct 14 ms 24528 KB Output is correct
5 Correct 15 ms 24524 KB Output is correct
6 Correct 15 ms 24524 KB Output is correct
7 Correct 15 ms 24520 KB Output is correct
8 Correct 17 ms 24512 KB Output is correct
9 Correct 15 ms 24520 KB Output is correct
10 Correct 14 ms 24524 KB Output is correct
11 Correct 14 ms 24548 KB Output is correct
12 Correct 14 ms 24568 KB Output is correct
13 Correct 15 ms 24508 KB Output is correct
14 Correct 14 ms 24516 KB Output is correct
15 Correct 15 ms 24464 KB Output is correct
16 Correct 15 ms 24476 KB Output is correct
17 Correct 18 ms 24580 KB Output is correct
18 Correct 18 ms 24580 KB Output is correct
19 Correct 17 ms 24524 KB Output is correct
20 Correct 17 ms 24524 KB Output is correct
21 Correct 20 ms 24524 KB Output is correct
22 Correct 17 ms 24524 KB Output is correct
23 Correct 19 ms 24552 KB Output is correct
24 Correct 16 ms 24580 KB Output is correct
25 Correct 16 ms 24524 KB Output is correct
26 Correct 15 ms 24572 KB Output is correct
27 Correct 14 ms 24492 KB Output is correct
28 Correct 15 ms 24656 KB Output is correct
29 Correct 16 ms 24652 KB Output is correct
30 Correct 15 ms 24524 KB Output is correct
31 Correct 14 ms 24592 KB Output is correct
32 Correct 15 ms 24576 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24524 KB Output is correct
2 Correct 15 ms 24560 KB Output is correct
3 Correct 15 ms 24524 KB Output is correct
4 Correct 14 ms 24528 KB Output is correct
5 Correct 15 ms 24524 KB Output is correct
6 Correct 15 ms 24524 KB Output is correct
7 Correct 15 ms 24520 KB Output is correct
8 Correct 17 ms 24512 KB Output is correct
9 Correct 15 ms 24520 KB Output is correct
10 Correct 14 ms 24524 KB Output is correct
11 Correct 14 ms 24548 KB Output is correct
12 Correct 14 ms 24568 KB Output is correct
13 Correct 15 ms 24508 KB Output is correct
14 Correct 14 ms 24516 KB Output is correct
15 Correct 15 ms 24464 KB Output is correct
16 Correct 15 ms 24476 KB Output is correct
17 Correct 18 ms 24580 KB Output is correct
18 Correct 18 ms 24580 KB Output is correct
19 Correct 17 ms 24524 KB Output is correct
20 Correct 17 ms 24524 KB Output is correct
21 Correct 20 ms 24524 KB Output is correct
22 Correct 17 ms 24524 KB Output is correct
23 Correct 19 ms 24552 KB Output is correct
24 Correct 16 ms 24580 KB Output is correct
25 Correct 16 ms 24524 KB Output is correct
26 Correct 15 ms 24572 KB Output is correct
27 Correct 14 ms 24492 KB Output is correct
28 Correct 15 ms 24656 KB Output is correct
29 Correct 16 ms 24652 KB Output is correct
30 Correct 15 ms 24524 KB Output is correct
31 Correct 14 ms 24592 KB Output is correct
32 Correct 15 ms 24576 KB Output is correct
33 Correct 527 ms 29176 KB Output is correct
34 Correct 188 ms 29248 KB Output is correct
35 Correct 475 ms 28488 KB Output is correct
36 Correct 803 ms 32224 KB Output is correct
37 Correct 34 ms 26436 KB Output is correct
38 Correct 890 ms 32932 KB Output is correct
39 Correct 919 ms 32948 KB Output is correct
40 Correct 875 ms 32944 KB Output is correct
41 Correct 857 ms 32952 KB Output is correct
42 Correct 827 ms 32944 KB Output is correct
43 Correct 825 ms 32932 KB Output is correct
44 Correct 854 ms 32952 KB Output is correct
45 Correct 825 ms 33024 KB Output is correct
46 Correct 825 ms 32940 KB Output is correct
47 Correct 909 ms 32952 KB Output is correct
48 Correct 215 ms 30656 KB Output is correct
49 Correct 236 ms 32044 KB Output is correct
50 Correct 91 ms 26440 KB Output is correct
51 Correct 100 ms 27524 KB Output is correct
52 Correct 48 ms 25988 KB Output is correct
53 Correct 344 ms 31684 KB Output is correct
54 Correct 297 ms 27888 KB Output is correct
55 Correct 682 ms 30808 KB Output is correct
56 Correct 411 ms 28644 KB Output is correct
57 Correct 545 ms 31672 KB Output is correct
58 Correct 48 ms 27592 KB Output is correct
59 Correct 85 ms 27404 KB Output is correct
60 Correct 175 ms 31324 KB Output is correct
61 Correct 205 ms 31792 KB Output is correct
62 Correct 125 ms 30204 KB Output is correct
63 Correct 77 ms 31352 KB Output is correct
64 Correct 81 ms 33336 KB Output is correct
65 Correct 103 ms 37880 KB Output is correct
66 Correct 121 ms 28100 KB Output is correct
67 Correct 108 ms 34192 KB Output is correct
68 Correct 222 ms 38340 KB Output is correct
69 Correct 64 ms 26044 KB Output is correct
70 Correct 24 ms 24800 KB Output is correct
71 Correct 111 ms 31268 KB Output is correct
72 Correct 143 ms 36788 KB Output is correct
73 Correct 355 ms 42052 KB Output is correct
74 Correct 508 ms 37680 KB Output is correct
75 Correct 246 ms 41796 KB Output is correct
76 Correct 233 ms 40324 KB Output is correct
77 Correct 496 ms 38076 KB Output is correct