oj.uz

답안 #415774

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
415774 2021-06-01T13:39:31 Z MarcoMeijer Cats or Dogs (JOI18_catdog) C++14
100 / 100
 2189 ms 63044 KB 
#include "catdog.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define RE(a,b) REP(a,0,b)
#define RE1(a,b) REP(a,1,b+1)
#define FOR(a,b) for(auto& a : b)
#define pb push_back
#define all(a) a.begin(),a.end()
#define fi first
#define se second

const int INF	= 1e6;
const int MX	= 2e5;
const int N	  = 1<<20;
const int MOD	= 1e9+7;

int n;
int a[MX];

// tree stuff
vi adj[MX], chl[MX];
int sz[MX], par[MX], dep[MX];
void dfs(int u, int p) {
  sz[u] = 1;
  par[u] = p;
  dep[u] = dep[p]+1;
  FOR(v,adj[u]) {
    if(v == p) continue;
    dfs(v,u);
    sz[u] += sz[v];
    chl[u].pb(v);
  }
}

// hld
int hd[MX], tl[MX], segi[MX], curseg=0;
void HLD(int u, int head) {
  hd[u] = head;
  segi[u] = curseg++;
  tl[head] = u;
  tl[u] = u;
  if(chl[u].empty()) return;
  int bst = chl[u][0];
  FOR(v,chl[u]) if(sz[v]>sz[bst]) bst = v;
  HLD(bst,head);
  FOR(v,chl[u]) if(v != bst) HLD(v,v);
  tl[u] = tl[head];
}

// seg
struct T {
  T() {
    RE(j,2) a[j][ j] = 0;
    RE(j,2) a[j][!j] = INF;
  }
  int a[2][2];
};
T seg[N*2];
T combine(T a, T b) {
  T res;
  RE(i,2) RE(j,2) res.a[i][j] = INF;
  RE(i,2) RE(j,2) RE(k,2) RE(l,2)
    res.a[i][l] = min(res.a[i][l], a.a[i][j] + b.a[k][l] + (j==k?0:1));
  return res;
}
void combine(int p) {
  seg[p] = combine(seg[p*2], seg[p*2+1]);
}
void buildSeg(int p=1, int l=0, int r=N-1) {
  if(l == r) {
    RE(j,2) seg[p].a[j][ j] = 0;
    RE(j,2) seg[p].a[j][!j] = INF;
    return;
  }
  int m=(l+r)/2;
  buildSeg(p*2,l,m);
  buildSeg(p*2+1,m+1,r);
  combine(p);
}
void addSeg(int i, int x, int v, int p=1, int l=0, int r=N-1) {
  if(i < l || i > r) return;
  if(l == r) {
    seg[p].a[x][x] += v;
    return;
  }
  int m=(l+r)/2;
  addSeg(i,x,v,p*2,l,m);
  addSeg(i,x,v,p*2+1,m+1,r);
  combine(p);
}
T getSeg(int i, int j, int p=1, int l=0, int r=N-1) {
  if(j < l || i > r) return {};
  if(i <= l && j >= r) return seg[p];
  int m=(l+r)/2;
  T a=getSeg(i,j,p*2,l,m);
  T b=getSeg(i,j,p*2+1,m+1,r);
  return combine(a,b);
}

// updates
int ans=0;
int getRes(T a, int x) {
  return min(a.a[x][0], a.a[x][1]);
}
void update(int u, int v1, int v2) {
  while(true) {
    T oldValue = getSeg(segi[hd[u]], segi[tl[u]]);
    addSeg(segi[u], 0, v1);
    addSeg(segi[u], 1, v2);
    T newValue = getSeg(segi[hd[u]], segi[tl[u]]);
    if(hd[u] == 1) {
      ans = INF;
      RE(i,2) RE(j,2) ans = min(ans, newValue.a[i][j]);
      break;
    } else {
      v1 = getRes(newValue,0) - getRes(oldValue,0);
      v2 = getRes(newValue,1) - getRes(oldValue,1);
      u = par[hd[u]];
    }
  }
}

// init
void initialize(int N, std::vector<int> A, std::vector<int> B) {
  n = N;
  RE(i,n-1) {
    adj[A[i]].pb(B[i]);
    adj[B[i]].pb(A[i]);
  }
  dfs(1,1);
  HLD(1,1);
  buildSeg();
}

// interaction
int cat(int v) {
  a[v] = 1;
  update(v,INF,0);
  return ans;
}
int dog(int v) {
  a[v] = 2;
  update(v,0,INF);
  return ans;
}
int neighbor(int v) {
  if(a[v] == 1) update(v,-INF,0);
  if(a[v] == 2) update(v,0,-INF);
  a[v] = 0;
  return ans;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 42516 KB Output is correct
2 Correct 64 ms 42444 KB Output is correct
3 Correct 64 ms 42492 KB Output is correct
4 Correct 62 ms 42444 KB Output is correct
5 Correct 72 ms 42468 KB Output is correct
6 Correct 71 ms 42460 KB Output is correct
7 Correct 66 ms 42540 KB Output is correct
8 Correct 67 ms 42528 KB Output is correct
9 Correct 68 ms 42504 KB Output is correct
10 Correct 68 ms 42540 KB Output is correct
11 Correct 70 ms 42536 KB Output is correct
12 Correct 68 ms 42528 KB Output is correct
13 Correct 74 ms 42536 KB Output is correct
14 Correct 68 ms 42540 KB Output is correct
15 Correct 79 ms 42456 KB Output is correct
16 Correct 72 ms 42528 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 42516 KB Output is correct
2 Correct 64 ms 42444 KB Output is correct
3 Correct 64 ms 42492 KB Output is correct
4 Correct 62 ms 42444 KB Output is correct
5 Correct 72 ms 42468 KB Output is correct
6 Correct 71 ms 42460 KB Output is correct
7 Correct 66 ms 42540 KB Output is correct
8 Correct 67 ms 42528 KB Output is correct
9 Correct 68 ms 42504 KB Output is correct
10 Correct 68 ms 42540 KB Output is correct
11 Correct 70 ms 42536 KB Output is correct
12 Correct 68 ms 42528 KB Output is correct
13 Correct 74 ms 42536 KB Output is correct
14 Correct 68 ms 42540 KB Output is correct
15 Correct 79 ms 42456 KB Output is correct
16 Correct 72 ms 42528 KB Output is correct
17 Correct 74 ms 42612 KB Output is correct
18 Correct 73 ms 42608 KB Output is correct
19 Correct 69 ms 42596 KB Output is correct
20 Correct 72 ms 42560 KB Output is correct
21 Correct 66 ms 42576 KB Output is correct
22 Correct 77 ms 42572 KB Output is correct
23 Correct 77 ms 42628 KB Output is correct
24 Correct 74 ms 42520 KB Output is correct
25 Correct 75 ms 42712 KB Output is correct
26 Correct 80 ms 42580 KB Output is correct
27 Correct 78 ms 42496 KB Output is correct
28 Correct 70 ms 42636 KB Output is correct
29 Correct 74 ms 42700 KB Output is correct
30 Correct 75 ms 42560 KB Output is correct
31 Correct 75 ms 42564 KB Output is correct
32 Correct 70 ms 42572 KB Output is correct

Subtask #3
62.0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 42516 KB Output is correct
2 Correct 64 ms 42444 KB Output is correct
3 Correct 64 ms 42492 KB Output is correct
4 Correct 62 ms 42444 KB Output is correct
5 Correct 72 ms 42468 KB Output is correct
6 Correct 71 ms 42460 KB Output is correct
7 Correct 66 ms 42540 KB Output is correct
8 Correct 67 ms 42528 KB Output is correct
9 Correct 68 ms 42504 KB Output is correct
10 Correct 68 ms 42540 KB Output is correct
11 Correct 70 ms 42536 KB Output is correct
12 Correct 68 ms 42528 KB Output is correct
13 Correct 74 ms 42536 KB Output is correct
14 Correct 68 ms 42540 KB Output is correct
15 Correct 79 ms 42456 KB Output is correct
16 Correct 72 ms 42528 KB Output is correct
17 Correct 74 ms 42612 KB Output is correct
18 Correct 73 ms 42608 KB Output is correct
19 Correct 69 ms 42596 KB Output is correct
20 Correct 72 ms 42560 KB Output is correct
21 Correct 66 ms 42576 KB Output is correct
22 Correct 77 ms 42572 KB Output is correct
23 Correct 77 ms 42628 KB Output is correct
24 Correct 74 ms 42520 KB Output is correct
25 Correct 75 ms 42712 KB Output is correct
26 Correct 80 ms 42580 KB Output is correct
27 Correct 78 ms 42496 KB Output is correct
28 Correct 70 ms 42636 KB Output is correct
29 Correct 74 ms 42700 KB Output is correct
30 Correct 75 ms 42560 KB Output is correct
31 Correct 75 ms 42564 KB Output is correct
32 Correct 70 ms 42572 KB Output is correct
33 Correct 1219 ms 49108 KB Output is correct
34 Correct 345 ms 49348 KB Output is correct
35 Correct 1210 ms 47688 KB Output is correct
36 Correct 1811 ms 53612 KB Output is correct
37 Correct 89 ms 45588 KB Output is correct
38 Correct 2189 ms 54744 KB Output is correct
39 Correct 1923 ms 54744 KB Output is correct
40 Correct 2057 ms 54744 KB Output is correct
41 Correct 2013 ms 54744 KB Output is correct
42 Correct 1748 ms 54756 KB Output is correct
43 Correct 1819 ms 54744 KB Output is correct
44 Correct 1872 ms 54748 KB Output is correct
45 Correct 1798 ms 54748 KB Output is correct
46 Correct 2133 ms 54752 KB Output is correct
47 Correct 1768 ms 54744 KB Output is correct
48 Correct 651 ms 50244 KB Output is correct
49 Correct 586 ms 52088 KB Output is correct
50 Correct 309 ms 44896 KB Output is correct
51 Correct 282 ms 46456 KB Output is correct
52 Correct 144 ms 44580 KB Output is correct
53 Correct 805 ms 53020 KB Output is correct
54 Correct 667 ms 47428 KB Output is correct
55 Correct 1854 ms 51352 KB Output is correct
56 Correct 1112 ms 48348 KB Output is correct
57 Correct 1363 ms 52808 KB Output is correct
58 Correct 141 ms 46480 KB Output is correct
59 Correct 256 ms 46268 KB Output is correct
60 Correct 488 ms 51116 KB Output is correct
61 Correct 559 ms 51688 KB Output is correct
62 Correct 368 ms 49592 KB Output is correct
63 Correct 157 ms 51492 KB Output is correct
64 Correct 175 ms 53300 KB Output is correct
65 Correct 193 ms 59452 KB Output is correct
66 Correct 294 ms 46976 KB Output is correct
67 Correct 213 ms 54512 KB Output is correct
68 Correct 464 ms 59816 KB Output is correct
69 Correct 197 ms 44256 KB Output is correct
70 Correct 107 ms 42820 KB Output is correct
71 Correct 249 ms 50524 KB Output is correct
72 Correct 298 ms 57024 KB Output is correct
73 Correct 846 ms 63000 KB Output is correct
74 Correct 959 ms 59592 KB Output is correct
75 Correct 486 ms 63044 KB Output is correct
76 Correct 460 ms 61772 KB Output is correct
77 Correct 842 ms 59952 KB Output is correct