oj.uz

답안 #443279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443279 2021-07-10T09:27:22 Z peijar Split the Attractions (IOI19_split) C++17
100 / 100
 254 ms 22408 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

struct UnionFind {
  vector<int> id;

  UnionFind() {}
  UnionFind(int N) { id.assign(N, -1); }

  int sz(int u) { return -id[find(u)]; }

  int find(int u) {
    if (id[u] < 0)
      return u;
    return id[u] = find(id[u]);
  }

  bool merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v)
      return false;
    if (id[u] > id[v])
      swap(u, v);
    id[u] += id[v];
    id[v] = u;
    return true;
  }
};

const int MAXN = 2e5;

bitset<MAXN> allowed, seen;
vector<int> adj[MAXN];
vector<pair<int, int>> aretes;
UnionFind dsu(MAXN);
UnionFind dsu2(MAXN);
int sz[MAXN];
int maxSz[MAXN];
int par[MAXN];
int nbSommets, nbAretes;
vector<int> vertices;
int nbRestant;
int centroid = 0;

void dfs(int u, int p) {
  par[u] = p;
  sz[u] = 1;
  maxSz[u] = 0;
  for (int v : adj[u])
    if (v != p) {
      dfs(v, u);
      sz[u] += sz[v];
      maxSz[u] = max(maxSz[u], sz[v]);
    }
}

void dfsRestricted(int u) {
  if (seen[u] or !allowed[u] or !nbRestant)
    return;
  seen[u] = true;
  nbRestant--;
  vertices.push_back(u);
  for (int v : adj[u])
    dfsRestricted(v);
}

vector<int> solve(int a, int b,
                  int c) { // Solves when there is one cc with sz >= min but < 2
                           // * min - 1 or < n / 2
  for (auto [u, v] : aretes)
    adj[u].push_back(v), adj[v].push_back(u);
  int minSz = min({a, b, c});
  int goodCC = -1;
  for (int i = 0; i < nbSommets; ++i)
    if (i != centroid and dsu2.sz(i) >= minSz)
      goodCC = dsu2.find(i);
  for (int i = 0; i < nbSommets; ++i)
    if (goodCC == dsu2.find(i))
      allowed[i] = true;
  nbRestant = minSz;
  dfsRestricted(goodCC);
  assert(!nbRestant);
  int order[3] = {0, 1, 2};
  int sz[3] = {a, b, c};
  vector<int> ret(nbSommets);
  sort(order, order + 3, [&](int i, int j) { return sz[i] < sz[j]; });
  allowed.reset();
  allowed.flip();
  for (int u : vertices) {
    ret[u] = order[0] + 1;
    allowed[u] = false;
  }
  vertices.clear();
  nbRestant = sz[order[1]];
  dfsRestricted(centroid);
  assert(!nbRestant);
  for (int u : vertices)
    ret[u] = order[1] + 1;
  for (int i = 0; i < nbSommets; ++i)
    if (!ret[i])
      ret[i] = order[2] + 1;
  return ret;
};

vector<int> find_split(int n, int a, int b, int c, vector<int> p,
                       vector<int> q) {
  nbSommets = n;
  nbAretes = p.size();
  for (int i = 0; i < nbAretes; ++i) {
    aretes.emplace_back(p[i], q[i]);
    if (dsu.merge(p[i], q[i])) {
      adj[p[i]].push_back(q[i]);
      adj[q[i]].push_back(p[i]);
    }
  }
  int orderSz[3] = {a, b, c};
  sort(orderSz, orderSz + 3);

  dfs(0, 0);

  for (int i = 1; i < nbSommets; ++i)
    if (max(nbSommets - sz[i], maxSz[i]) <
        max(nbSommets - sz[centroid], maxSz[centroid]))
      centroid = i;
  dfs(centroid, centroid);
  for (int i = 0; i < nbSommets; ++i)
    if (par[i] != centroid)
      assert(dsu2.merge(i, par[i]));
  for (int i = 0; i < nbSommets; ++i)
    if (i != centroid and dsu2.sz(i) >= orderSz[0]) {
      // cerr << "HEY1" << endl;
      return solve(a, b, c);
    }

  for (auto [u, v] : aretes)
    if (u != centroid and v != centroid and dsu2.merge(u, v)) {
      if (dsu2.sz(u) >= orderSz[0]) {
        // cerr << "HEY2" << ' ' << dsu2.sz(u) << endl;
        return solve(a, b, c);
      }
    }
  vector<int> ret(nbSommets);
  return ret;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6604 KB ok, correct split
2 Correct 4 ms 6604 KB ok, correct split
3 Correct 4 ms 6604 KB ok, correct split
4 Correct 4 ms 6604 KB ok, correct split
5 Correct 5 ms 6604 KB ok, correct split
6 Correct 4 ms 6604 KB ok, correct split
7 Correct 130 ms 21428 KB ok, correct split
8 Correct 135 ms 18868 KB ok, correct split
9 Correct 129 ms 18476 KB ok, correct split
10 Correct 137 ms 21120 KB ok, correct split
11 Correct 144 ms 20272 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB ok, correct split
2 Correct 4 ms 6608 KB ok, correct split
3 Correct 4 ms 6604 KB ok, correct split
4 Correct 136 ms 16616 KB ok, correct split
5 Correct 115 ms 15116 KB ok, correct split
6 Correct 149 ms 21176 KB ok, correct split
7 Correct 129 ms 18992 KB ok, correct split
8 Correct 160 ms 18556 KB ok, correct split
9 Correct 159 ms 14124 KB ok, correct split
10 Correct 71 ms 14904 KB ok, correct split
11 Correct 76 ms 14892 KB ok, correct split
12 Correct 72 ms 14884 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB ok, correct split
2 Correct 149 ms 15084 KB ok, correct split
3 Correct 38 ms 9820 KB ok, correct split
4 Correct 4 ms 6604 KB ok, correct split
5 Correct 154 ms 16624 KB ok, correct split
6 Correct 155 ms 16308 KB ok, correct split
7 Correct 154 ms 16348 KB ok, correct split
8 Correct 172 ms 17508 KB ok, correct split
9 Correct 131 ms 16300 KB ok, correct split
10 Correct 29 ms 8948 KB ok, no valid answer
11 Correct 53 ms 10036 KB ok, no valid answer
12 Correct 103 ms 13796 KB ok, no valid answer
13 Correct 90 ms 13760 KB ok, no valid answer
14 Correct 73 ms 14136 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6604 KB ok, correct split
2 Correct 5 ms 6476 KB ok, no valid answer
3 Correct 6 ms 6604 KB ok, correct split
4 Correct 5 ms 6540 KB ok, correct split
5 Correct 5 ms 6604 KB ok, correct split
6 Correct 6 ms 6604 KB ok, correct split
7 Correct 6 ms 6552 KB ok, correct split
8 Correct 4 ms 6604 KB ok, correct split
9 Correct 7 ms 6812 KB ok, correct split
10 Correct 7 ms 6860 KB ok, correct split
11 Correct 4 ms 6604 KB ok, correct split
12 Correct 7 ms 6796 KB ok, correct split
13 Correct 6 ms 6580 KB ok, correct split
14 Correct 5 ms 6604 KB ok, correct split
15 Correct 5 ms 6604 KB ok, correct split
16 Correct 5 ms 6584 KB ok, correct split
17 Correct 5 ms 6604 KB ok, correct split
18 Correct 5 ms 6604 KB ok, correct split
19 Correct 5 ms 6604 KB ok, correct split
20 Correct 6 ms 6732 KB ok, correct split
21 Correct 8 ms 6852 KB ok, correct split
22 Correct 6 ms 6860 KB ok, correct split
23 Correct 6 ms 6844 KB ok, correct split
24 Correct 6 ms 6860 KB ok, correct split
25 Correct 8 ms 6860 KB ok, correct split
26 Correct 7 ms 6860 KB ok, correct split
27 Correct 7 ms 6852 KB ok, correct split
28 Correct 8 ms 6860 KB ok, correct split
29 Correct 5 ms 6584 KB ok, correct split
30 Correct 8 ms 6860 KB ok, correct split
31 Correct 6 ms 6732 KB ok, correct split
32 Correct 5 ms 6556 KB ok, correct split
33 Correct 5 ms 6624 KB ok, correct split
34 Correct 7 ms 6860 KB ok, correct split
35 Correct 7 ms 6860 KB ok, correct split
36 Correct 6 ms 6732 KB ok, correct split
37 Correct 7 ms 6904 KB ok, correct split
38 Correct 7 ms 6860 KB ok, correct split
39 Correct 7 ms 6860 KB ok, correct split
40 Correct 16 ms 6920 KB ok, correct split
41 Correct 6 ms 6720 KB ok, correct split
42 Correct 6 ms 6732 KB ok, correct split
43 Correct 11 ms 6860 KB ok, correct split
44 Correct 7 ms 6852 KB ok, correct split
45 Correct 7 ms 6848 KB ok, correct split
46 Correct 6 ms 6860 KB ok, correct split
47 Correct 7 ms 6860 KB ok, no valid answer
48 Correct 9 ms 6732 KB ok, correct split
49 Correct 6 ms 6860 KB ok, correct split
50 Correct 5 ms 6580 KB ok, no valid answer
51 Correct 5 ms 6580 KB ok, no valid answer
52 Correct 7 ms 6732 KB ok, no valid answer
53 Correct 8 ms 6848 KB ok, no valid answer
54 Correct 7 ms 6732 KB ok, no valid answer
55 Correct 8 ms 6744 KB ok, no valid answer
56 Correct 7 ms 6732 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6604 KB ok, correct split
2 Correct 4 ms 6604 KB ok, correct split
3 Correct 4 ms 6604 KB ok, correct split
4 Correct 4 ms 6604 KB ok, correct split
5 Correct 5 ms 6604 KB ok, correct split
6 Correct 4 ms 6604 KB ok, correct split
7 Correct 130 ms 21428 KB ok, correct split
8 Correct 135 ms 18868 KB ok, correct split
9 Correct 129 ms 18476 KB ok, correct split
10 Correct 137 ms 21120 KB ok, correct split
11 Correct 144 ms 20272 KB ok, correct split
12 Correct 4 ms 6604 KB ok, correct split
13 Correct 4 ms 6608 KB ok, correct split
14 Correct 4 ms 6604 KB ok, correct split
15 Correct 136 ms 16616 KB ok, correct split
16 Correct 115 ms 15116 KB ok, correct split
17 Correct 149 ms 21176 KB ok, correct split
18 Correct 129 ms 18992 KB ok, correct split
19 Correct 160 ms 18556 KB ok, correct split
20 Correct 159 ms 14124 KB ok, correct split
21 Correct 71 ms 14904 KB ok, correct split
22 Correct 76 ms 14892 KB ok, correct split
23 Correct 72 ms 14884 KB ok, correct split
24 Correct 4 ms 6604 KB ok, correct split
25 Correct 149 ms 15084 KB ok, correct split
26 Correct 38 ms 9820 KB ok, correct split
27 Correct 4 ms 6604 KB ok, correct split
28 Correct 154 ms 16624 KB ok, correct split
29 Correct 155 ms 16308 KB ok, correct split
30 Correct 154 ms 16348 KB ok, correct split
31 Correct 172 ms 17508 KB ok, correct split
32 Correct 131 ms 16300 KB ok, correct split
33 Correct 29 ms 8948 KB ok, no valid answer
34 Correct 53 ms 10036 KB ok, no valid answer
35 Correct 103 ms 13796 KB ok, no valid answer
36 Correct 90 ms 13760 KB ok, no valid answer
37 Correct 73 ms 14136 KB ok, no valid answer
38 Correct 4 ms 6604 KB ok, correct split
39 Correct 5 ms 6476 KB ok, no valid answer
40 Correct 6 ms 6604 KB ok, correct split
41 Correct 5 ms 6540 KB ok, correct split
42 Correct 5 ms 6604 KB ok, correct split
43 Correct 6 ms 6604 KB ok, correct split
44 Correct 6 ms 6552 KB ok, correct split
45 Correct 4 ms 6604 KB ok, correct split
46 Correct 7 ms 6812 KB ok, correct split
47 Correct 7 ms 6860 KB ok, correct split
48 Correct 4 ms 6604 KB ok, correct split
49 Correct 7 ms 6796 KB ok, correct split
50 Correct 6 ms 6580 KB ok, correct split
51 Correct 5 ms 6604 KB ok, correct split
52 Correct 5 ms 6604 KB ok, correct split
53 Correct 5 ms 6584 KB ok, correct split
54 Correct 5 ms 6604 KB ok, correct split
55 Correct 5 ms 6604 KB ok, correct split
56 Correct 5 ms 6604 KB ok, correct split
57 Correct 6 ms 6732 KB ok, correct split
58 Correct 8 ms 6852 KB ok, correct split
59 Correct 6 ms 6860 KB ok, correct split
60 Correct 6 ms 6844 KB ok, correct split
61 Correct 6 ms 6860 KB ok, correct split
62 Correct 8 ms 6860 KB ok, correct split
63 Correct 7 ms 6860 KB ok, correct split
64 Correct 7 ms 6852 KB ok, correct split
65 Correct 8 ms 6860 KB ok, correct split
66 Correct 5 ms 6584 KB ok, correct split
67 Correct 8 ms 6860 KB ok, correct split
68 Correct 6 ms 6732 KB ok, correct split
69 Correct 5 ms 6556 KB ok, correct split
70 Correct 5 ms 6624 KB ok, correct split
71 Correct 7 ms 6860 KB ok, correct split
72 Correct 7 ms 6860 KB ok, correct split
73 Correct 6 ms 6732 KB ok, correct split
74 Correct 7 ms 6904 KB ok, correct split
75 Correct 7 ms 6860 KB ok, correct split
76 Correct 7 ms 6860 KB ok, correct split
77 Correct 16 ms 6920 KB ok, correct split
78 Correct 6 ms 6720 KB ok, correct split
79 Correct 6 ms 6732 KB ok, correct split
80 Correct 11 ms 6860 KB ok, correct split
81 Correct 7 ms 6852 KB ok, correct split
82 Correct 7 ms 6848 KB ok, correct split
83 Correct 6 ms 6860 KB ok, correct split
84 Correct 7 ms 6860 KB ok, no valid answer
85 Correct 9 ms 6732 KB ok, correct split
86 Correct 6 ms 6860 KB ok, correct split
87 Correct 5 ms 6580 KB ok, no valid answer
88 Correct 5 ms 6580 KB ok, no valid answer
89 Correct 7 ms 6732 KB ok, no valid answer
90 Correct 8 ms 6848 KB ok, no valid answer
91 Correct 7 ms 6732 KB ok, no valid answer
92 Correct 8 ms 6744 KB ok, no valid answer
93 Correct 7 ms 6732 KB ok, no valid answer
94 Correct 173 ms 18232 KB ok, correct split
95 Correct 225 ms 22408 KB ok, correct split
96 Correct 201 ms 20868 KB ok, correct split
97 Correct 42 ms 10408 KB ok, correct split
98 Correct 41 ms 10556 KB ok, correct split
99 Correct 57 ms 13092 KB ok, correct split
100 Correct 222 ms 20904 KB ok, correct split
101 Correct 242 ms 19484 KB ok, correct split
102 Correct 161 ms 19120 KB ok, correct split
103 Correct 167 ms 18280 KB ok, correct split
104 Correct 154 ms 20152 KB ok, correct split
105 Correct 68 ms 12692 KB ok, correct split
106 Correct 136 ms 20512 KB ok, correct split
107 Correct 154 ms 16264 KB ok, correct split
108 Correct 146 ms 16184 KB ok, correct split
109 Correct 254 ms 20660 KB ok, correct split
110 Correct 189 ms 20944 KB ok, correct split
111 Correct 190 ms 21044 KB ok, correct split
112 Correct 173 ms 20924 KB ok, correct split
113 Correct 183 ms 20908 KB ok, correct split
114 Correct 17 ms 8136 KB ok, correct split
115 Correct 25 ms 7976 KB ok, correct split
116 Correct 168 ms 20508 KB ok, correct split
117 Correct 163 ms 20468 KB ok, correct split
118 Correct 149 ms 15228 KB ok, correct split
119 Correct 157 ms 15284 KB ok, correct split
120 Correct 138 ms 18196 KB ok, correct split
121 Correct 110 ms 14896 KB ok, no valid answer
122 Correct 106 ms 14876 KB ok, no valid answer
123 Correct 127 ms 18348 KB ok, no valid answer
124 Correct 144 ms 18356 KB ok, no valid answer
125 Correct 80 ms 16044 KB ok, no valid answer
126 Correct 67 ms 14212 KB ok, no valid answer
127 Correct 136 ms 16928 KB ok, no valid answer