oj.uz

답안 #500860

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500860 2022-01-01T13:30:00 Z balbit Cats or Dogs (JOI18_catdog) C++14
100 / 100
 257 ms 37284 KB 
#include "catdog.h"

#include <bits/stdc++.h>
#define int ll
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<ll, ll>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl<<flush;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<29;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;

struct segtree{
    // segtree for this chain
    int MAXN;
    vector<array<array<int,2>, 2> > s; // s[o][a][b]: from type a (higher) to type b (lower) 0 is cat, 1 is dog

    void MO(int p, int n0, int n1, int o, int l, int r) {
        if (l > p || r < p) return;
        if (l == r) {
            s[o][0][0]=n0;
            s[o][1][1]=n1;
            s[o][0][1]=inf;
            s[o][1][0]=inf;
            return;
        }
        int mid = (l+r)/2;
        MO(p,n0,n1,o*2,l,mid);
        MO(p,n0,n1,o*2+1,mid+1,r);

        REP(i,2) REP(j,2) {
            s[o][i][j] = inf;
            REP(a,2) REP(b,2){
                MN(s[o][i][j], s[o*2][i][a] + s[o*2+1][b][j] + (a!=b));
            }
        }
    }

    void MO(int p, int n0, int n1) {
        MO(p,n0,n1,1,0,MAXN-1);
    }

    array<int, 2> get(){
        array<int, 2> re = {{inf, inf}};
        REP(t,2) REP(i,2) REP(j,2) {
            MN(re[t], s[1][i][j] + (i!=t));
        }
        return re;
    }

    int gans(){
        int re = inf;
        REP(i,2) REP(j,2) {
//            bug(i,j,s[1][i][j]);
            MN(re, s[1][i][j]);
        }
        return re;
    }

    segtree(){}

    void init(int ss){
        MAXN = ss;
        s.resize(ss*4, {{{{inf,inf}}, {{inf, inf}}}});
    }
};

//int treeidx[maxn]; // position on chain, with 0 being the head
int head[maxn]; // head of each node
int sz[maxn], par[maxn];
vector<int> g[maxn];
int catdog[maxn], dep[maxn]; // -1:nothing, 0:cat, 1:dog
int ifcat[maxn], ifdog[maxn]; // cost of being cat or dog

void dfs(int v, int p) {
    sz[v] = 1;
    for (int u : g[v]) {
        if (u != p) {
            par[u] = v;
            dep[u] = dep[v] + 1;
            dfs(u,v);
            sz[v] += sz[u];
        }
    }
}

int chainsize[maxn];

void dfs2(int v, int p) {
    chainsize[head[v]]++;
    int mx = 0, mxc = -1;
    for (int u : g[v]) {
        if (u!=p) {
            if (sz[u] > mx) {
                mx = sz[u]; mxc = u;
            }
        }
    }
    for (int u : g[v]) {
        if (u !=p) {
            if (u == mxc) {
                head[u] = head[v];
            }else{
                head[u] = u;
            }
            dfs2(u,v);
        }
    }
}

segtree TT[maxn]; // for each head

void upd(int v) {
    // update a node
    if (catdog[v] == -1) {
        // no animal
        TT[head[v]].MO(dep[v] - dep[head[v]], ifcat[v], ifdog[v]);
    }else if (catdog[v] == 0) {
        bug("hello/");
        TT[head[v]].MO(dep[v] - dep[head[v]], ifcat[v], inf);
        // cat
    }else{
        // doge
        bug("hello/ dog");
        TT[head[v]].MO(dep[v] - dep[head[v]], inf, ifdog[v]);
    }
}

void chainupd(int v) {
    while (1) {
        array<int, 2> old = TT[head[v]].get();
        upd(v);
        if (head[v] == 0) break;
        array<int, 2> yo = TT[head[v]].get();
        int nxt = par[head[v]];
        ifcat[nxt] += yo[0] - old[0];
        ifdog[nxt] += yo[1] - old[1];
        v = nxt;
    }
}

void initialize(signed n, vector<signed> a, vector<signed> b) {
    REP(i,n-1) {
        g[a[i]-1].pb(b[i]-1);
        g[b[i]-1].pb(a[i]-1);
    }
    dfs(0, -1);
    dfs2(0,-1);
    REP(i,n) {
        bug(i, head[i], chainsize[head[i]]);
        if (head[i] == i) {
            TT[i].init(chainsize[i]);
        }
    }
    REP(i,n) catdog[i] = -1;
    REP(i,n) {
        upd(i);
    }


}

signed yar(signed v, signed nw) {
    --v;
    catdog[v] = nw;
    chainupd(v);
//    array<int, 2> ho = TT[0].get();
    int ret = TT[0].gans();
    bug(ret);
    return ret;
}

signed cat(signed v) {
    return yar(v,0);
}

signed dog(signed v) {
    return yar(v,1);
}

signed neighbor(signed v) {
    return yar(v,-1);
}

/*
5
1 2
2 3
2 4
1 5
7

*/

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5780 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5792 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 3 ms 5708 KB Output is correct
8 Correct 3 ms 5708 KB Output is correct
9 Correct 3 ms 5788 KB Output is correct
10 Correct 3 ms 5708 KB Output is correct
11 Correct 3 ms 5804 KB Output is correct
12 Correct 3 ms 5708 KB Output is correct
13 Correct 3 ms 5792 KB Output is correct
14 Correct 3 ms 5708 KB Output is correct
15 Correct 3 ms 5708 KB Output is correct
16 Correct 3 ms 5784 KB Output is correct
17 Correct 4 ms 5916 KB Output is correct
18 Correct 5 ms 5964 KB Output is correct
19 Correct 4 ms 5964 KB Output is correct
20 Correct 3 ms 5836 KB Output is correct
21 Correct 5 ms 5824 KB Output is correct
22 Correct 4 ms 5828 KB Output is correct
23 Correct 4 ms 5924 KB Output is correct
24 Correct 4 ms 5964 KB Output is correct
25 Correct 3 ms 5924 KB Output is correct
26 Correct 3 ms 5836 KB Output is correct
27 Correct 5 ms 5828 KB Output is correct
28 Correct 4 ms 5964 KB Output is correct
29 Correct 5 ms 5964 KB Output is correct
30 Correct 3 ms 5836 KB Output is correct
31 Correct 3 ms 5964 KB Output is correct
32 Correct 4 ms 5796 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5708 KB Output is correct
2 Correct 3 ms 5780 KB Output is correct
3 Correct 3 ms 5708 KB Output is correct
4 Correct 3 ms 5792 KB Output is correct
5 Correct 3 ms 5708 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 3 ms 5708 KB Output is correct
8 Correct 3 ms 5708 KB Output is correct
9 Correct 3 ms 5788 KB Output is correct
10 Correct 3 ms 5708 KB Output is correct
11 Correct 3 ms 5804 KB Output is correct
12 Correct 3 ms 5708 KB Output is correct
13 Correct 3 ms 5792 KB Output is correct
14 Correct 3 ms 5708 KB Output is correct
15 Correct 3 ms 5708 KB Output is correct
16 Correct 3 ms 5784 KB Output is correct
17 Correct 4 ms 5916 KB Output is correct
18 Correct 5 ms 5964 KB Output is correct
19 Correct 4 ms 5964 KB Output is correct
20 Correct 3 ms 5836 KB Output is correct
21 Correct 5 ms 5824 KB Output is correct
22 Correct 4 ms 5828 KB Output is correct
23 Correct 4 ms 5924 KB Output is correct
24 Correct 4 ms 5964 KB Output is correct
25 Correct 3 ms 5924 KB Output is correct
26 Correct 3 ms 5836 KB Output is correct
27 Correct 5 ms 5828 KB Output is correct
28 Correct 4 ms 5964 KB Output is correct
29 Correct 5 ms 5964 KB Output is correct
30 Correct 3 ms 5836 KB Output is correct
31 Correct 3 ms 5964 KB Output is correct
32 Correct 4 ms 5796 KB Output is correct
33 Correct 125 ms 20148 KB Output is correct
34 Correct 69 ms 22400 KB Output is correct
35 Correct 107 ms 16024 KB Output is correct
36 Correct 216 ms 30460 KB Output is correct
37 Correct 22 ms 13540 KB Output is correct
38 Correct 253 ms 33228 KB Output is correct
39 Correct 250 ms 33304 KB Output is correct
40 Correct 231 ms 33212 KB Output is correct
41 Correct 243 ms 33340 KB Output is correct
42 Correct 216 ms 33280 KB Output is correct
43 Correct 233 ms 33244 KB Output is correct
44 Correct 215 ms 33296 KB Output is correct
45 Correct 257 ms 33340 KB Output is correct
46 Correct 215 ms 33200 KB Output is correct
47 Correct 214 ms 33292 KB Output is correct
48 Correct 66 ms 25044 KB Output is correct
49 Correct 103 ms 30024 KB Output is correct
50 Correct 30 ms 10816 KB Output is correct
51 Correct 30 ms 15236 KB Output is correct
52 Correct 15 ms 10696 KB Output is correct
53 Correct 123 ms 31384 KB Output is correct
54 Correct 69 ms 17020 KB Output is correct
55 Correct 205 ms 24852 KB Output is correct
56 Correct 93 ms 18296 KB Output is correct
57 Correct 143 ms 29704 KB Output is correct
58 Correct 24 ms 16444 KB Output is correct
59 Correct 30 ms 14324 KB Output is correct
60 Correct 73 ms 27320 KB Output is correct
61 Correct 74 ms 28304 KB Output is correct
62 Correct 67 ms 23968 KB Output is correct
63 Correct 86 ms 20648 KB Output is correct
64 Correct 67 ms 23012 KB Output is correct
65 Correct 100 ms 33432 KB Output is correct
66 Correct 50 ms 12412 KB Output is correct
67 Correct 118 ms 25236 KB Output is correct
68 Correct 143 ms 33980 KB Output is correct
69 Correct 24 ms 8052 KB Output is correct
70 Correct 7 ms 6092 KB Output is correct
71 Correct 57 ms 18116 KB Output is correct
72 Correct 95 ms 28452 KB Output is correct
73 Correct 176 ms 37284 KB Output is correct
74 Correct 202 ms 33840 KB Output is correct
75 Correct 153 ms 37272 KB Output is correct
76 Correct 156 ms 35988 KB Output is correct
77 Correct 195 ms 34140 KB Output is correct