oj.uz

Submission #800289

# Submission time Handle Problem Language Result Execution time Memory
800289 2023-08-01T13:06:58 Z MilosMilutinovic Cats or Dogs (JOI18_catdog) C++14
100 / 100
 433 ms 25784 KB 
#include "catdog.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = (int) 1e5;

int n, sz[MAX], pr[MAX], hd[MAX];
int from[MAX], to[MAX], col[MAX];
int ver[MAX], id[MAX], rt[MAX];
int dp_a[MAX], dp_b[MAX], cnt;
vector<int> g[MAX];

struct node {
  int a[2][2];
  node() {}
  node(int v) {
    for (int i = 0; i < 2; i++) {
      for (int j = 0; j < 2; j++) {
        a[i][j] = v;
      }
    }
  }
};

node st[8 * MAX];


void dfs_hld(int v, int p) {
  sz[v] = 1;
  hd[v] = -1;
  pr[v] = p;
  for (int u : g[v]) {
    if (u == p) {
      continue;
    }
    dfs_hld(u, v);
    sz[v] += sz[u];
    if (hd[v] == -1 || sz[u] > sz[hd[v]]) {
      hd[v] = u;
    }
  }
}

void dfs(int v, int p) {
  if (hd[v] != -1) {
    rt[hd[v]] = rt[v];
    id[hd[v]] = cnt++;
    dfs(hd[v], v);
  }
  for (int u : g[v]) {
    if (u == p || u == hd[v]) {
      continue;
    }
    id[u] = cnt++;
    rt[u] = u;
    dfs(u, v);
  }
}

const int inf = (int) 1e9;

node f(node l, node r) {
  node res(inf);
  for (int xl = 0; xl < 2; xl++) {
    for (int yl = 0; yl < 2; yl++) {
      for (int xr = 0; xr < 2; xr++) {
        for (int yr = 0; yr < 2; yr++) {
          res.a[xl][yr] = min(res.a[xl][yr], l.a[xl][yl] + r.a[xr][yr] + (yl != xr ? 1 : 0));
        }
      }
    }
  }
  return res;
};

void pull(int v) {
  st[v] = f(st[v * 2], st[v * 2 + 1]);
}

void Build(int v, int l, int r) {
  if (l == r) {
    st[v].a[0][0] = dp_a[ver[l]];
    st[v].a[0][1] = inf;
    st[v].a[1][0] = inf;
    st[v].a[1][1] = dp_b[ver[l]];
    return;
  }
  int mid = l + r >> 1;
  Build(v * 2, l, mid);
  Build(v * 2 + 1, mid + 1, r);
  pull(v);
}

void Modify(int v, int l, int r, int i) {
  if (l == r) {
    st[v].a[0][0] = (col[ver[l]] != 1 ? dp_a[ver[l]] : inf);
    st[v].a[0][1] = inf;
    st[v].a[1][0] = inf;
    st[v].a[1][1] = (col[ver[l]] != 0 ? dp_b[ver[l]] : inf);
    return;
  }
  int mid = l + r >> 1;
  if (i <= mid) {
    Modify(v * 2, l, mid, i);
  } else {
    Modify(v * 2 + 1, mid + 1, r, i);
  }
  pull(v);
}

node Query(int v, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) {
    return st[v];
  }
  int mid = l + r >> 1;
  if (qr <= mid) {
    return Query(v * 2, l, mid, ql, qr);
  } else if (ql > mid) {
    return Query(v * 2 + 1, mid + 1, r, ql, qr);
  } else {
    return f(Query(v * 2, l, mid, ql, qr), Query(v * 2 + 1, mid + 1, r, ql, qr));
  }
}

void Update(int v) {
  while (true) {
    if (rt[v] != 0) {
      int x = pr[rt[v]];
      int y = rt[v];
      node nd = Query(1, 0, n - 1, from[y], to[y]);
      {
        dp_a[x] -= min({nd.a[0][0], nd.a[0][1], nd.a[1][0] + 1, nd.a[1][1] + 1});
        dp_b[x] -= min({nd.a[1][0], nd.a[1][1], nd.a[0][0] + 1, nd.a[0][1] + 1});
      }
    }
    Modify(1, 0, n - 1, id[v]);
    if (rt[v] != 0) {
      int x = pr[rt[v]];
      int y = rt[v];
      node nd = Query(1, 0, n - 1, from[y], to[y]);
      {
        dp_a[x] += min({nd.a[0][0], nd.a[0][1], nd.a[1][0] + 1, nd.a[1][1] + 1});
        dp_b[x] += min({nd.a[1][0], nd.a[1][1], nd.a[0][0] + 1, nd.a[0][1] + 1});
      }
      v = x;
    } else {
      return;
    }
  }
}

void initialize(int n, vector<int> x, vector<int> y) {
  ::n = n;
  for (int i = 0; i < n - 1; i++) {
    --x[i]; --y[i];
    g[x[i]].push_back(y[i]);
    g[y[i]].push_back(x[i]);
  }
  for (int i = 0; i < n; i++) {
    col[i] = -1;
  }
  dfs_hld(0, -1);
  id[0] = cnt++;
  dfs(0, -1);
  for (int i = 0; i < n; i++) {
    ver[id[i]] = i;
  }
  Build(1, 0, n - 1);
  for (int i = 0; i < n; i++) {
    from[i] = n;
    to[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    from[rt[i]] = min(from[rt[i]], id[i]);
    to[rt[i]] = max(to[rt[i]], id[i]);
  }
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return id[i] > id[j];
  });
  for (int i : order) {
    for (int j : g[i]) {
      if (j == pr[i] || hd[i] == j) {
        continue;
      }
      node nd = Query(1, 0, n - 1, from[j], to[j]);
      dp_a[i] += min({nd.a[0][0], nd.a[0][1], nd.a[1][0] + 1, nd.a[1][1] + 1});
      dp_b[i] += min({nd.a[1][0], nd.a[1][1], nd.a[0][0] + 1, nd.a[0][1] + 1});
    }
    Modify(1, 0, n - 1, id[i]);
  }
}

int solve() {
  node nd = Query(1, 0, n - 1, from[0], to[0]);
  int res = inf;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 2; j++) {
      res = min(res, nd.a[i][j]);
    }
  }
  return res;
}

int cat(int v) {
  --v;
  col[v] = 0;
  Update(v);
  return solve();
}

int dog(int v) {
  --v;
  col[v] = 1;
  Update(v);
  return solve();
}

int neighbor(int v) {
  --v;
  col[v] = -1;
  Update(v);
  return solve();
}

Compilation message

catdog.cpp: In function 'void Build(int, int, int)':
catdog.cpp:89:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |   int mid = l + r >> 1;
      |             ~~^~~
catdog.cpp: In function 'void Modify(int, int, int, int)':
catdog.cpp:103:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  103 |   int mid = l + r >> 1;
      |             ~~^~~
catdog.cpp: In function 'node Query(int, int, int, int, int)':
catdog.cpp:116:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2664 KB Output is correct
5 Correct 2 ms 2664 KB Output is correct
6 Correct 1 ms 2664 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2664 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 3 ms 2772 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 2 ms 2668 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 3 ms 2772 KB Output is correct
25 Correct 3 ms 2668 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2772 KB Output is correct
29 Correct 2 ms 2772 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2788 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 250 ms 11148 KB Output is correct
34 Correct 104 ms 11868 KB Output is correct
35 Correct 211 ms 9508 KB Output is correct
36 Correct 372 ms 17740 KB Output is correct
37 Correct 32 ms 6980 KB Output is correct
38 Correct 420 ms 18892 KB Output is correct
39 Correct 433 ms 18928 KB Output is correct
40 Correct 407 ms 18896 KB Output is correct
41 Correct 423 ms 19092 KB Output is correct
42 Correct 379 ms 18916 KB Output is correct
43 Correct 392 ms 18892 KB Output is correct
44 Correct 372 ms 18856 KB Output is correct
45 Correct 388 ms 18824 KB Output is correct
46 Correct 421 ms 18896 KB Output is correct
47 Correct 403 ms 18892 KB Output is correct
48 Correct 128 ms 14984 KB Output is correct
49 Correct 153 ms 17160 KB Output is correct
50 Correct 46 ms 6092 KB Output is correct
51 Correct 58 ms 8776 KB Output is correct
52 Correct 25 ms 5728 KB Output is correct
53 Correct 197 ms 17748 KB Output is correct
54 Correct 129 ms 9640 KB Output is correct
55 Correct 323 ms 15444 KB Output is correct
56 Correct 203 ms 10388 KB Output is correct
57 Correct 290 ms 17428 KB Output is correct
58 Correct 37 ms 9080 KB Output is correct
59 Correct 52 ms 7500 KB Output is correct
60 Correct 125 ms 16164 KB Output is correct
61 Correct 144 ms 16580 KB Output is correct
62 Correct 90 ms 14524 KB Output is correct
63 Correct 60 ms 12824 KB Output is correct
64 Correct 57 ms 14572 KB Output is correct
65 Correct 88 ms 22104 KB Output is correct
66 Correct 60 ms 7740 KB Output is correct
67 Correct 75 ms 17740 KB Output is correct
68 Correct 146 ms 22512 KB Output is correct
69 Correct 24 ms 4564 KB Output is correct
70 Correct 6 ms 2900 KB Output is correct
71 Correct 55 ms 12116 KB Output is correct
72 Correct 90 ms 20172 KB Output is correct
73 Correct 203 ms 25784 KB Output is correct
74 Correct 263 ms 22208 KB Output is correct
75 Correct 152 ms 25676 KB Output is correct
76 Correct 148 ms 24432 KB Output is correct
77 Correct 246 ms 22620 KB Output is correct