oj.uz

답안 #59011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59011 2018-07-20T06:25:14 Z gusfring Cats or Dogs (JOI18_catdog) C++14
100 / 100
 455 ms 81536 KB 
#include "catdog.h"
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;

const ll inf = 1e16;
const int MAXN = 1e6 + 5, MAXNN = 1e5 + 5;

struct node {
  ll val[2][2];
  node(){
    val[0][0] = val[1][1] = 0, val[0][1] = val[1][0] = inf;
  }
  node operator+(const node &p) const{
    node ret;
    for(int i=0; i<2; ++i)
      for(int j=0; j<2; ++j){
        ret.val[i][j] = inf;
        for(int k=0; k<2; ++k)
          for(int l=0; l<2; ++l)
            ret.val[i][j] = min(ret.val[i][j], val[i][k] + p.val[l][j] + (k ^ l));
      }
    return ret;
  }
};

struct segtree{
  vector<node> val;
  int sz;
  void init(int root, int lo, int hi){
    if(lo == hi) return;
    int mid = (lo + hi)>>1, left = root<<1, right = left | 1;
    init(left, lo, mid);
    init(right, mid + 1, hi);
    val[root] = val[left] + val[right];
  }
  void init(int n){
    int s = 1;
    sz = n;
    while(s < (sz << 1)) s <<= 1;
    val.resize(s);
    init(1, 1, sz);
  }
  void update(int root, int lo, int hi, int x, ll v0, ll v1){
    if(lo == hi){
      val[root].val[0][0] += v0;
      val[root].val[1][1] += v1;
      return;
    }
    int mid = (lo + hi)>>1, left = root<<1, right = left | 1;
    if(x <= mid) update(left, lo, mid, x, v0, v1);
    else update(right, mid + 1, hi, x, v0, v1);
    val[root] = val[left] + val[right];
  }
  void update(int pos, ll x0, ll x1){
    update(1, 1, sz, pos, x0, x1);
  }
  pii query() const{
    int x = min(val[1].val[0][0], val[1].val[0][1]);
    int y = min(val[1].val[1][0], val[1].val[1][1]);
    return pii(min(x, y + 1), min(x + 1, y));
  }
} seg[MAXNN];

int n;
vector<int> edge[MAXNN];
int sz[MAXNN], pathPar[MAXNN], pathPos[MAXNN], par[MAXNN], st[MAXNN];

void dfsSize(int x, int p){
  par[x] = p, sz[x] = 1;
  for(int i : edge[x]){
    if(i == p) continue;
    dfsSize(i, x);
    sz[x] += sz[i];
  }
}

void dfsDecomp(int x, int p){
  int hpath = 0;
  for(int i : edge[x]){
    if(i == p) continue;
    if(sz[x] <= (sz[i] << 1)){
        hpath = i;
        break;
    }
  }
  if(hpath == 0) seg[pathPar[x]].init(pathPos[x]);
  for(int i : edge[x]){
    if(i == p) continue;
    if(i != hpath){
      pathPar[i] = i;
      pathPos[i] = 1;
    }
    else{
      pathPar[i] = pathPar[x];
      pathPos[i] = pathPos[x] + 1;
    }
    dfsDecomp(i, x);
  }
}

void initialize(int N, vector<int> A, vector<int> B) {
  n = N;
  for(int i=0; i<n-1; ++i){
    edge[A[i]].push_back(B[i]);
    edge[B[i]].push_back(A[i]);
  }
  dfsSize(1, 0);
  pathPar[1] = 1, pathPos[1] = 1;
  dfsDecomp(1, 0);
}

void update(int x, int v0, int v1) {
  while(x){
    int path = pathPar[x];
    int pr0, pr1, nx0, nx1;
    tie(pr0, pr1) = seg[path].query();
    seg[path].update(pathPos[x], v0, v1);
    tie(nx0, nx1) = seg[path].query();
    v0 = nx0 - pr0;
    v1 = nx1 - pr1;
    x = par[pathPar[x]];
  }
}

int getAns(){
  pii it = seg[1].query();
  return min(it.first, it.second);
}

int cat(int v){
  st[v] = 1;
  update(v, MAXN, 0);
  return getAns();
}

int dog(int v){
  st[v] = 2;
  update(v, 0, MAXN);
  return getAns();
}

int neighbor(int v){
  if(st[v] == 1) update(v, -MAXN, 0);
  else update(v, 0, -MAXN);
  st[v] = 0;
  return getAns();
}

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5880 KB Output is correct
2 Correct 9 ms 5908 KB Output is correct
3 Correct 10 ms 5908 KB Output is correct
4 Correct 7 ms 5908 KB Output is correct
5 Correct 8 ms 5908 KB Output is correct
6 Correct 10 ms 5908 KB Output is correct
7 Correct 6 ms 5948 KB Output is correct
8 Correct 8 ms 6084 KB Output is correct
9 Correct 9 ms 6084 KB Output is correct
10 Correct 9 ms 6084 KB Output is correct
11 Correct 8 ms 6084 KB Output is correct
12 Correct 7 ms 6084 KB Output is correct
13 Correct 8 ms 6084 KB Output is correct
14 Correct 7 ms 6084 KB Output is correct
15 Correct 8 ms 6084 KB Output is correct
16 Correct 7 ms 6084 KB Output is correct
17 Correct 9 ms 6120 KB Output is correct
18 Correct 11 ms 6252 KB Output is correct
19 Correct 9 ms 6252 KB Output is correct
20 Correct 9 ms 6252 KB Output is correct
21 Correct 10 ms 6252 KB Output is correct
22 Correct 9 ms 6252 KB Output is correct
23 Correct 11 ms 6252 KB Output is correct
24 Correct 11 ms 6252 KB Output is correct
25 Correct 8 ms 6252 KB Output is correct
26 Correct 7 ms 6252 KB Output is correct
27 Correct 9 ms 6252 KB Output is correct
28 Correct 10 ms 6508 KB Output is correct
29 Correct 11 ms 6636 KB Output is correct
30 Correct 9 ms 6636 KB Output is correct
31 Correct 9 ms 6636 KB Output is correct
32 Correct 11 ms 6636 KB Output is correct
33 Correct 213 ms 14440 KB Output is correct
34 Correct 148 ms 15648 KB Output is correct
35 Correct 218 ms 15648 KB Output is correct
36 Correct 353 ms 20332 KB Output is correct
37 Correct 54 ms 20332 KB Output is correct
38 Correct 384 ms 21916 KB Output is correct
39 Correct 455 ms 22040 KB Output is correct
40 Correct 341 ms 22040 KB Output is correct
41 Correct 369 ms 22296 KB Output is correct
42 Correct 343 ms 22296 KB Output is correct
43 Correct 366 ms 22296 KB Output is correct
44 Correct 372 ms 22296 KB Output is correct
45 Correct 323 ms 22296 KB Output is correct
46 Correct 333 ms 22296 KB Output is correct
47 Correct 325 ms 22296 KB Output is correct
48 Correct 139 ms 22296 KB Output is correct
49 Correct 166 ms 22296 KB Output is correct
50 Correct 37 ms 22296 KB Output is correct
51 Correct 54 ms 22296 KB Output is correct
52 Correct 34 ms 22296 KB Output is correct
53 Correct 261 ms 22296 KB Output is correct
54 Correct 103 ms 22296 KB Output is correct
55 Correct 341 ms 22296 KB Output is correct
56 Correct 173 ms 22296 KB Output is correct
57 Correct 299 ms 22296 KB Output is correct
58 Correct 74 ms 22296 KB Output is correct
59 Correct 61 ms 22296 KB Output is correct
60 Correct 137 ms 22296 KB Output is correct
61 Correct 134 ms 22296 KB Output is correct
62 Correct 90 ms 22296 KB Output is correct
63 Correct 102 ms 33468 KB Output is correct
64 Correct 138 ms 44860 KB Output is correct
65 Correct 185 ms 65764 KB Output is correct
66 Correct 80 ms 65764 KB Output is correct
67 Correct 176 ms 65764 KB Output is correct
68 Correct 213 ms 65764 KB Output is correct
69 Correct 40 ms 65764 KB Output is correct
70 Correct 13 ms 65764 KB Output is correct
71 Correct 98 ms 65764 KB Output is correct
72 Correct 167 ms 65764 KB Output is correct
73 Correct 312 ms 81536 KB Output is correct
74 Correct 284 ms 81536 KB Output is correct
75 Correct 330 ms 81536 KB Output is correct
76 Correct 265 ms 81536 KB Output is correct
77 Correct 327 ms 81536 KB Output is correct