oj.uz

Submission #203697

# Submission time Handle Problem Language Result Execution time Memory
203697 2020-02-21T21:28:58 Z fedoseevtimofey Cats or Dogs (JOI18_catdog) C++14
100 / 100
 1198 ms 26488 KB 
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <random>
#include <complex>
#include <iomanip>
#include <cassert>
#include <functional>
          
using namespace std;
        
typedef long long ll;

const int N = 1e5 + 7;
const int Inf = 1e9;

int n;

vector <int> g[N];
int par[N];

struct Node {
  int dp[2][2];
  Node() {
    dp[0][0] = 0;
    dp[1][1] = 0;
    dp[0][1] = Inf;
    dp[1][0] = Inf;
  }
  Node operator +(const Node &other) const {
    Node res;
    for (int i = 0; i < 2; ++i) {
      for (int j = 0; j < 2; ++j) {
        res.dp[i][j] = Inf;
      }
    }
    for (int i = 0; i < 2; ++i) {
      for (int j = 0; j < 2; ++j) {
        for (int k = 0; k < 2; ++k) {
          for (int t = 0; t < 2; ++t) {
            res.dp[i][t] = min(res.dp[i][t], dp[i][j] + other.dp[k][t] + (j != k));
          }
        }
      }
    }
    return res;
  } 
};

int sz[N];

void dfs(int u, int p) {
  par[u] = p;
  if (p != -1) {
    g[u].erase(find(g[u].begin(), g[u].end(), p));
  }
  sz[u] = 1;
  for (auto v : g[u]) {
    dfs(v, u);
    sz[u] += sz[v];
  }
  sort(g[u].begin(), g[u].end(), [&] (int a, int b) {
    return sz[a] > sz[b];
  });
} 

vector <int> e;
int in[N], st[N], en[N];
int dp[N][2];

int hld(int u, int beg) {
  e.push_back(u);
  in[u] = (int)e.size() - 1;
  st[u] = beg;
  if (!g[u].empty()) {
    en[u] = hld(g[u][0], beg);
    for (int i = 1; i < (int)g[u].size(); ++i) {
      hld(g[u][i], g[u][i]);
    }
  } else {
    en[u] = u;
  }
  return en[u];
}

Node t[4 * N];

void build(int l, int r, int v) {
  if (l == r) {
    t[v] = Node();
  } else {
    int m = (l + r) >> 1;
    build(l, m, 2 * v + 1);
    build(m + 1, r, 2 * v + 2);
    t[v] = t[2 * v + 1] + t[2 * v + 2];
  }
}

void initialize(int _n, vector <int> a, vector <int> b) {
  n = _n;
  for (int i = 0; i + 1 < n; ++i) {
    --a[i], --b[i];
    g[a[i]].push_back(b[i]);
    g[b[i]].push_back(a[i]);
  }
  dfs(0, -1);
  hld(0, 0);
  /*for (int i = 0; i < n; ++i) {
    cout << st[i] + 1 << ' ' << en[i] + 1 << endl;
  }*/
  build(0, n - 1, 0);
}

void modify(int id, pair <int, int> val, int l, int r, int v) {
  if (l == r) {
    t[v].dp[0][0] = val.first;
    t[v].dp[1][1] = val.second;
    t[v].dp[0][1] = Inf;
    t[v].dp[1][0] = Inf;
  } else {
    int m = (l + r) >> 1;
    if (id <= m) modify(id, val, l, m, 2 * v + 1);
    else modify(id, val, m + 1, r, 2 * v + 2);
    t[v] = t[2 * v + 1] + t[2 * v + 2];
  }
}

Node get(int ql, int qr, int l, int r, int v) {
  if (qr < l || r < ql) return Node();
  if (ql <= l && r <= qr) return t[v];
  int m = (l + r) >> 1;
  return get(ql, qr, l, m, 2 * v + 1) + get(ql, qr, m + 1, r, 2 * v + 2);
}
  
void update(int v) {
  //cout << "Update " << v + 1 << endl;
  while (v != -1) {
    Node bef = get(in[st[v]], in[en[v]], 0, n - 1, 0);
    modify(in[v], make_pair(dp[v][0], dp[v][1]), 0, n - 1, 0); 
    //cout << "Now in " << v + 1 << ' ' << dp[v][0] << ' ' << dp[v][1] << endl;
    Node aft = get(in[st[v]], in[en[v]], 0, n - 1, 0); 
    int u = par[st[v]];
    dp[u][0] -= min(min(bef.dp[0][0], bef.dp[0][1]), min(bef.dp[1][0], bef.dp[1][1]) + 1);
    dp[u][0] += min(min(aft.dp[0][0], aft.dp[0][1]), min(aft.dp[1][0], aft.dp[1][1]) + 1);
    dp[u][1] -= min(min(bef.dp[1][0], bef.dp[1][1]), min(bef.dp[0][0], bef.dp[0][1]) + 1);
    dp[u][1] += min(min(aft.dp[1][0], aft.dp[1][1]), min(aft.dp[0][0], aft.dp[0][1]) + 1);
    v = u;
  } 
}

int have[N];

int get() {
  int ret = Inf;
  Node res = get(in[st[0]], in[en[0]], 0, n - 1, 0);
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < 2; ++j) {
      ret = min(ret, res.dp[i][j]);
    }
  }
  return ret;
}

int cat(int v) {
  --v;
  dp[v][1] += Inf;
  have[v] = 0;
  update(v);
  return get();
}

int dog(int v) {
  --v;
  dp[v][0] += Inf;
  have[v] = 1;
  update(v);
  return get();
}

int neighbor(int v) {
  --v;
  if (have[v] == 0) dp[v][1] -= Inf;
  else if (have[v] == 1) dp[v][0] -= Inf;
  update(v);
  return get();
}
  
#ifdef LOCAL
int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int n;
  cin >> n;
  vector <int> a(n - 1), b(n - 1);
  for (int i = 0; i + 1 < n; ++i) {
    cin >> a[i] >> b[i];
  }
  initialize(n, a, b);  
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int t, v;
    cin >> t >> v;
    if (t == 1) {
      cout << cat(v) << '\n';
    } else if (t == 2) {
      cout << dog(v) << '\n';
    } else {
      cout << neighbor(v) << '\n';
    }
  }
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8952 KB Output is correct
2 Correct 10 ms 8952 KB Output is correct
3 Correct 10 ms 8952 KB Output is correct
4 Correct 10 ms 8952 KB Output is correct
5 Correct 10 ms 8952 KB Output is correct
6 Correct 10 ms 8952 KB Output is correct
7 Correct 10 ms 8952 KB Output is correct
8 Correct 10 ms 8952 KB Output is correct
9 Correct 10 ms 8952 KB Output is correct
10 Correct 10 ms 8952 KB Output is correct
11 Correct 10 ms 8952 KB Output is correct
12 Correct 10 ms 8952 KB Output is correct
13 Correct 10 ms 8952 KB Output is correct
14 Correct 10 ms 8952 KB Output is correct
15 Correct 10 ms 8956 KB Output is correct
16 Correct 10 ms 8952 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8952 KB Output is correct
2 Correct 10 ms 8952 KB Output is correct
3 Correct 10 ms 8952 KB Output is correct
4 Correct 10 ms 8952 KB Output is correct
5 Correct 10 ms 8952 KB Output is correct
6 Correct 10 ms 8952 KB Output is correct
7 Correct 10 ms 8952 KB Output is correct
8 Correct 10 ms 8952 KB Output is correct
9 Correct 10 ms 8952 KB Output is correct
10 Correct 10 ms 8952 KB Output is correct
11 Correct 10 ms 8952 KB Output is correct
12 Correct 10 ms 8952 KB Output is correct
13 Correct 10 ms 8952 KB Output is correct
14 Correct 10 ms 8952 KB Output is correct
15 Correct 10 ms 8956 KB Output is correct
16 Correct 10 ms 8952 KB Output is correct
17 Correct 14 ms 8952 KB Output is correct
18 Correct 13 ms 9080 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 10 ms 8952 KB Output is correct
21 Correct 11 ms 8952 KB Output is correct
22 Correct 12 ms 8952 KB Output is correct
23 Correct 14 ms 9080 KB Output is correct
24 Correct 14 ms 9080 KB Output is correct
25 Correct 12 ms 8952 KB Output is correct
26 Correct 11 ms 8952 KB Output is correct
27 Correct 10 ms 8952 KB Output is correct
28 Correct 10 ms 9080 KB Output is correct
29 Correct 12 ms 9080 KB Output is correct
30 Correct 11 ms 8952 KB Output is correct
31 Correct 10 ms 8952 KB Output is correct
32 Correct 11 ms 8952 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8952 KB Output is correct
2 Correct 10 ms 8952 KB Output is correct
3 Correct 10 ms 8952 KB Output is correct
4 Correct 10 ms 8952 KB Output is correct
5 Correct 10 ms 8952 KB Output is correct
6 Correct 10 ms 8952 KB Output is correct
7 Correct 10 ms 8952 KB Output is correct
8 Correct 10 ms 8952 KB Output is correct
9 Correct 10 ms 8952 KB Output is correct
10 Correct 10 ms 8952 KB Output is correct
11 Correct 10 ms 8952 KB Output is correct
12 Correct 10 ms 8952 KB Output is correct
13 Correct 10 ms 8952 KB Output is correct
14 Correct 10 ms 8952 KB Output is correct
15 Correct 10 ms 8956 KB Output is correct
16 Correct 10 ms 8952 KB Output is correct
17 Correct 14 ms 8952 KB Output is correct
18 Correct 13 ms 9080 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 10 ms 8952 KB Output is correct
21 Correct 11 ms 8952 KB Output is correct
22 Correct 12 ms 8952 KB Output is correct
23 Correct 14 ms 9080 KB Output is correct
24 Correct 14 ms 9080 KB Output is correct
25 Correct 12 ms 8952 KB Output is correct
26 Correct 11 ms 8952 KB Output is correct
27 Correct 10 ms 8952 KB Output is correct
28 Correct 10 ms 9080 KB Output is correct
29 Correct 12 ms 9080 KB Output is correct
30 Correct 11 ms 8952 KB Output is correct
31 Correct 10 ms 8952 KB Output is correct
32 Correct 11 ms 8952 KB Output is correct
33 Correct 674 ms 14052 KB Output is correct
34 Correct 214 ms 15100 KB Output is correct
35 Correct 654 ms 13936 KB Output is correct
36 Correct 1073 ms 19256 KB Output is correct
37 Correct 31 ms 11896 KB Output is correct
38 Correct 1198 ms 20320 KB Output is correct
39 Correct 1136 ms 20120 KB Output is correct
40 Correct 1143 ms 20064 KB Output is correct
41 Correct 1192 ms 20320 KB Output is correct
42 Correct 1077 ms 20128 KB Output is correct
43 Correct 1115 ms 20192 KB Output is correct
44 Correct 1056 ms 20192 KB Output is correct
45 Correct 1046 ms 20192 KB Output is correct
46 Correct 1067 ms 20064 KB Output is correct
47 Correct 1088 ms 20192 KB Output is correct
48 Correct 337 ms 17216 KB Output is correct
49 Correct 362 ms 18848 KB Output is correct
50 Correct 142 ms 11512 KB Output is correct
51 Correct 148 ms 13020 KB Output is correct
52 Correct 63 ms 11128 KB Output is correct
53 Correct 456 ms 18540 KB Output is correct
54 Correct 359 ms 13484 KB Output is correct
55 Correct 894 ms 17380 KB Output is correct
56 Correct 558 ms 14496 KB Output is correct
57 Correct 775 ms 18356 KB Output is correct
58 Correct 55 ms 12972 KB Output is correct
59 Correct 146 ms 12924 KB Output is correct
60 Correct 308 ms 17908 KB Output is correct
61 Correct 333 ms 18528 KB Output is correct
62 Correct 201 ms 16208 KB Output is correct
63 Correct 93 ms 16504 KB Output is correct
64 Correct 93 ms 18036 KB Output is correct
65 Correct 107 ms 22900 KB Output is correct
66 Correct 167 ms 13048 KB Output is correct
67 Correct 130 ms 19188 KB Output is correct
68 Correct 285 ms 23416 KB Output is correct
69 Correct 75 ms 10744 KB Output is correct
70 Correct 25 ms 9208 KB Output is correct
71 Correct 124 ms 15908 KB Output is correct
72 Correct 169 ms 21368 KB Output is correct
73 Correct 473 ms 26488 KB Output is correct
74 Correct 539 ms 23160 KB Output is correct
75 Correct 315 ms 26484 KB Output is correct
76 Correct 326 ms 25204 KB Output is correct
77 Correct 556 ms 23544 KB Output is correct