oj.uz

Submission #237894

# Submission time Handle Problem Language Result Execution time Memory
237894 2020-06-09T08:29:32 Z quocnguyen1012 Split the Attractions (IOI19_split) C++14
100 / 100
 234 ms 17648 KB 
#ifndef LOCAL
#include "split.h"
#endif // LOCAL
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array

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

const int maxn = 1e5 + 5;

class DSU
{
public:
  vector<int> lab;
  DSU(int n)
  {
    lab.assign(n, -1);
  }
  int finds(int u)
  {
    if(lab[u] < 0) return u;
    return lab[u] = finds(lab[u]);
  }
  bool merges(int u, int v)
  {
    u = finds(u); v = finds(v);
    if(u == v) return false;
    if(lab[v] < lab[u]) swap(u, v);
    lab[u] += lab[v]; lab[v] = u;
    return true;
  }
  bool same(int u, int v)
  {
    return (finds(u) == finds(v));
  }
  int sz(int x)
  {
    return -lab[finds(x)];
  }
};

int sz[maxn], par[maxn];
vector<int> adj[maxn];

int findcen(int mxsize)
{
  function<void(int)> dfs = [&](int u)
  {
    sz[u] = 1;
    for(int v : adj[u]) if(v != par[u]){
      par[v] = u;
      dfs(v);
      sz[u] += sz[v];
    }
  };
  dfs(0);
  int u = 0;
  while(true){
    ii mx = mp(-1, -1);
    for(int v : adj[u]) if(v != par[u]){
      mx = max(mx, mp(sz[v], v));
    }
    if(mx.fi <= mxsize) return u;
    u = mx.se;
  }
  assert(0);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
  DSU dsu(n);
  vector<int> col(n, 0);
  int m = p.size();
  int ca, cb, cc;
  {
    vector<ii> v;
    v.eb(a, 1); v.eb(b, 2); v.eb(c, 3);
    sort(v.begin(), v.end());
    tie(a, ca) = v[0]; tie(b, cb) = v[1];
    tie(c, cc) = v[2];
  }
  for(int i = 0; i < m; ++i){
    if(dsu.merges(p[i], q[i])){
      adj[p[i]].eb(q[i]);
      adj[q[i]].eb(p[i]);
    }
  }
  dsu = DSU(n);
  int r = findcen(n - b);
  for(int i = 0; i < n; ++i){
    for(int j : adj[i]){
      if(i != r && j != r){
        dsu.merges(i, j);
      }
    }
  }
  for(int i = 0; i < m; ++i){
    int u = p[i], v = q[i];
    if(dsu.sz(u) >= a || dsu.sz(v) >= a) continue;
    if(u == r || v == r) continue;
    if(dsu.merges(u, v)){
      adj[u].eb(v); adj[v].eb(u);
    }
  }

  function<void(int, int &, int, int)> go = [&](int u, int & need, int co, int bad)
  {
    if(u == bad || need == 0 || col[u] != 0) return;
    col[u] = co;
    --need;
    for(int v : adj[u]) go(v, need, co, bad);
  };
  for(int v : adj[r]) if(dsu.sz(v) >= a){
    go(v, a, ca, r);
    go(r, b, cb, -1);
    for(int i = 0; i < n; ++i)
      if(col[i] == 0) col[i] = cc;
    break;
  }
  return col;
}

#ifdef LOCAL
signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int n, m, a, b, c; cin >> n >> m >> a >> b >> c;
  vector<int> x(m), y(m);
  for(int i = 0; i < m; ++i) cin >> x[i];
  for(int i = 0; i < m; ++i) cin >> y[i];
  vector<int> res = find_split(n, a, b, c, x, y);
  for(auto & it : res) cout << it << ' ';
}
#endif // LOCAL

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2688 KB ok, correct split
2 Correct 6 ms 2816 KB ok, correct split
3 Correct 6 ms 2688 KB ok, correct split
4 Correct 6 ms 2688 KB ok, correct split
5 Correct 6 ms 2688 KB ok, correct split
6 Correct 6 ms 2688 KB ok, correct split
7 Correct 182 ms 17520 KB ok, correct split
8 Correct 93 ms 15216 KB ok, correct split
9 Correct 112 ms 14832 KB ok, correct split
10 Correct 117 ms 17648 KB ok, correct split
11 Correct 128 ms 16368 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB ok, correct split
2 Correct 7 ms 2688 KB ok, correct split
3 Correct 6 ms 2688 KB ok, correct split
4 Correct 100 ms 11504 KB ok, correct split
5 Correct 91 ms 10224 KB ok, correct split
6 Correct 153 ms 17648 KB ok, correct split
7 Correct 150 ms 15088 KB ok, correct split
8 Correct 115 ms 12656 KB ok, correct split
9 Correct 148 ms 10096 KB ok, correct split
10 Correct 66 ms 10088 KB ok, correct split
11 Correct 64 ms 10088 KB ok, correct split
12 Correct 63 ms 10472 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB ok, correct split
2 Correct 89 ms 10224 KB ok, correct split
3 Correct 34 ms 5728 KB ok, correct split
4 Correct 6 ms 2688 KB ok, correct split
5 Correct 104 ms 12856 KB ok, correct split
6 Correct 103 ms 12912 KB ok, correct split
7 Correct 143 ms 12912 KB ok, correct split
8 Correct 104 ms 13552 KB ok, correct split
9 Correct 164 ms 12912 KB ok, correct split
10 Correct 43 ms 5244 KB ok, no valid answer
11 Correct 46 ms 6460 KB ok, no valid answer
12 Correct 76 ms 10348 KB ok, no valid answer
13 Correct 93 ms 10224 KB ok, no valid answer
14 Correct 80 ms 10472 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB ok, correct split
2 Correct 6 ms 2688 KB ok, no valid answer
3 Correct 6 ms 2688 KB ok, correct split
4 Correct 6 ms 2816 KB ok, correct split
5 Correct 8 ms 2688 KB ok, correct split
6 Correct 6 ms 2688 KB ok, correct split
7 Correct 6 ms 2688 KB ok, correct split
8 Correct 6 ms 2688 KB ok, correct split
9 Correct 8 ms 2944 KB ok, correct split
10 Correct 8 ms 3072 KB ok, correct split
11 Correct 6 ms 2688 KB ok, correct split
12 Correct 11 ms 2944 KB ok, correct split
13 Correct 7 ms 2736 KB ok, correct split
14 Correct 6 ms 2688 KB ok, correct split
15 Correct 7 ms 2688 KB ok, correct split
16 Correct 7 ms 2688 KB ok, correct split
17 Correct 7 ms 2688 KB ok, correct split
18 Correct 7 ms 2688 KB ok, correct split
19 Correct 7 ms 2688 KB ok, correct split
20 Correct 8 ms 2688 KB ok, correct split
21 Correct 8 ms 2996 KB ok, correct split
22 Correct 9 ms 2944 KB ok, correct split
23 Correct 8 ms 2944 KB ok, correct split
24 Correct 11 ms 2944 KB ok, correct split
25 Correct 13 ms 2944 KB ok, correct split
26 Correct 10 ms 2944 KB ok, correct split
27 Correct 8 ms 2944 KB ok, correct split
28 Correct 8 ms 2944 KB ok, correct split
29 Correct 6 ms 2688 KB ok, correct split
30 Correct 8 ms 2944 KB ok, correct split
31 Correct 7 ms 2688 KB ok, correct split
32 Correct 7 ms 2688 KB ok, correct split
33 Correct 8 ms 2688 KB ok, correct split
34 Correct 8 ms 2944 KB ok, correct split
35 Correct 8 ms 2944 KB ok, correct split
36 Correct 8 ms 2816 KB ok, correct split
37 Correct 9 ms 2944 KB ok, correct split
38 Correct 8 ms 2944 KB ok, correct split
39 Correct 9 ms 2944 KB ok, correct split
40 Correct 8 ms 2944 KB ok, correct split
41 Correct 8 ms 2816 KB ok, correct split
42 Correct 7 ms 2816 KB ok, correct split
43 Correct 8 ms 2944 KB ok, correct split
44 Correct 8 ms 2944 KB ok, correct split
45 Correct 11 ms 2944 KB ok, correct split
46 Correct 7 ms 2944 KB ok, correct split
47 Correct 10 ms 2944 KB ok, no valid answer
48 Correct 8 ms 2944 KB ok, correct split
49 Correct 7 ms 2944 KB ok, correct split
50 Correct 6 ms 2688 KB ok, no valid answer
51 Correct 6 ms 2688 KB ok, no valid answer
52 Correct 7 ms 2816 KB ok, no valid answer
53 Correct 8 ms 2944 KB ok, no valid answer
54 Correct 7 ms 2944 KB ok, no valid answer
55 Correct 8 ms 2944 KB ok, no valid answer
56 Correct 8 ms 2944 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2688 KB ok, correct split
2 Correct 6 ms 2816 KB ok, correct split
3 Correct 6 ms 2688 KB ok, correct split
4 Correct 6 ms 2688 KB ok, correct split
5 Correct 6 ms 2688 KB ok, correct split
6 Correct 6 ms 2688 KB ok, correct split
7 Correct 182 ms 17520 KB ok, correct split
8 Correct 93 ms 15216 KB ok, correct split
9 Correct 112 ms 14832 KB ok, correct split
10 Correct 117 ms 17648 KB ok, correct split
11 Correct 128 ms 16368 KB ok, correct split
12 Correct 6 ms 2688 KB ok, correct split
13 Correct 7 ms 2688 KB ok, correct split
14 Correct 6 ms 2688 KB ok, correct split
15 Correct 100 ms 11504 KB ok, correct split
16 Correct 91 ms 10224 KB ok, correct split
17 Correct 153 ms 17648 KB ok, correct split
18 Correct 150 ms 15088 KB ok, correct split
19 Correct 115 ms 12656 KB ok, correct split
20 Correct 148 ms 10096 KB ok, correct split
21 Correct 66 ms 10088 KB ok, correct split
22 Correct 64 ms 10088 KB ok, correct split
23 Correct 63 ms 10472 KB ok, correct split
24 Correct 6 ms 2688 KB ok, correct split
25 Correct 89 ms 10224 KB ok, correct split
26 Correct 34 ms 5728 KB ok, correct split
27 Correct 6 ms 2688 KB ok, correct split
28 Correct 104 ms 12856 KB ok, correct split
29 Correct 103 ms 12912 KB ok, correct split
30 Correct 143 ms 12912 KB ok, correct split
31 Correct 104 ms 13552 KB ok, correct split
32 Correct 164 ms 12912 KB ok, correct split
33 Correct 43 ms 5244 KB ok, no valid answer
34 Correct 46 ms 6460 KB ok, no valid answer
35 Correct 76 ms 10348 KB ok, no valid answer
36 Correct 93 ms 10224 KB ok, no valid answer
37 Correct 80 ms 10472 KB ok, no valid answer
38 Correct 6 ms 2688 KB ok, correct split
39 Correct 6 ms 2688 KB ok, no valid answer
40 Correct 6 ms 2688 KB ok, correct split
41 Correct 6 ms 2816 KB ok, correct split
42 Correct 8 ms 2688 KB ok, correct split
43 Correct 6 ms 2688 KB ok, correct split
44 Correct 6 ms 2688 KB ok, correct split
45 Correct 6 ms 2688 KB ok, correct split
46 Correct 8 ms 2944 KB ok, correct split
47 Correct 8 ms 3072 KB ok, correct split
48 Correct 6 ms 2688 KB ok, correct split
49 Correct 11 ms 2944 KB ok, correct split
50 Correct 7 ms 2736 KB ok, correct split
51 Correct 6 ms 2688 KB ok, correct split
52 Correct 7 ms 2688 KB ok, correct split
53 Correct 7 ms 2688 KB ok, correct split
54 Correct 7 ms 2688 KB ok, correct split
55 Correct 7 ms 2688 KB ok, correct split
56 Correct 7 ms 2688 KB ok, correct split
57 Correct 8 ms 2688 KB ok, correct split
58 Correct 8 ms 2996 KB ok, correct split
59 Correct 9 ms 2944 KB ok, correct split
60 Correct 8 ms 2944 KB ok, correct split
61 Correct 11 ms 2944 KB ok, correct split
62 Correct 13 ms 2944 KB ok, correct split
63 Correct 10 ms 2944 KB ok, correct split
64 Correct 8 ms 2944 KB ok, correct split
65 Correct 8 ms 2944 KB ok, correct split
66 Correct 6 ms 2688 KB ok, correct split
67 Correct 8 ms 2944 KB ok, correct split
68 Correct 7 ms 2688 KB ok, correct split
69 Correct 7 ms 2688 KB ok, correct split
70 Correct 8 ms 2688 KB ok, correct split
71 Correct 8 ms 2944 KB ok, correct split
72 Correct 8 ms 2944 KB ok, correct split
73 Correct 8 ms 2816 KB ok, correct split
74 Correct 9 ms 2944 KB ok, correct split
75 Correct 8 ms 2944 KB ok, correct split
76 Correct 9 ms 2944 KB ok, correct split
77 Correct 8 ms 2944 KB ok, correct split
78 Correct 8 ms 2816 KB ok, correct split
79 Correct 7 ms 2816 KB ok, correct split
80 Correct 8 ms 2944 KB ok, correct split
81 Correct 8 ms 2944 KB ok, correct split
82 Correct 11 ms 2944 KB ok, correct split
83 Correct 7 ms 2944 KB ok, correct split
84 Correct 10 ms 2944 KB ok, no valid answer
85 Correct 8 ms 2944 KB ok, correct split
86 Correct 7 ms 2944 KB ok, correct split
87 Correct 6 ms 2688 KB ok, no valid answer
88 Correct 6 ms 2688 KB ok, no valid answer
89 Correct 7 ms 2816 KB ok, no valid answer
90 Correct 8 ms 2944 KB ok, no valid answer
91 Correct 7 ms 2944 KB ok, no valid answer
92 Correct 8 ms 2944 KB ok, no valid answer
93 Correct 8 ms 2944 KB ok, no valid answer
94 Correct 156 ms 10736 KB ok, correct split
95 Correct 164 ms 12912 KB ok, correct split
96 Correct 127 ms 12020 KB ok, correct split
97 Correct 79 ms 5720 KB ok, correct split
98 Correct 64 ms 5848 KB ok, correct split
99 Correct 50 ms 6904 KB ok, correct split
100 Correct 141 ms 12912 KB ok, correct split
101 Correct 150 ms 12120 KB ok, correct split
102 Correct 121 ms 12140 KB ok, correct split
103 Correct 111 ms 12012 KB ok, correct split
104 Correct 105 ms 13656 KB ok, correct split
105 Correct 92 ms 7436 KB ok, correct split
106 Correct 100 ms 13160 KB ok, correct split
107 Correct 116 ms 10352 KB ok, correct split
108 Correct 106 ms 10268 KB ok, correct split
109 Correct 143 ms 12656 KB ok, correct split
110 Correct 200 ms 13036 KB ok, correct split
111 Correct 151 ms 13164 KB ok, correct split
112 Correct 147 ms 13548 KB ok, correct split
113 Correct 234 ms 13420 KB ok, correct split
114 Correct 17 ms 3840 KB ok, correct split
115 Correct 17 ms 3760 KB ok, correct split
116 Correct 146 ms 13040 KB ok, correct split
117 Correct 177 ms 12876 KB ok, correct split
118 Correct 125 ms 10228 KB ok, correct split
119 Correct 108 ms 10224 KB ok, correct split
120 Correct 109 ms 13244 KB ok, correct split
121 Correct 82 ms 10228 KB ok, no valid answer
122 Correct 86 ms 10224 KB ok, no valid answer
123 Correct 134 ms 13040 KB ok, no valid answer
124 Correct 127 ms 12876 KB ok, no valid answer
125 Correct 86 ms 11240 KB ok, no valid answer
126 Correct 72 ms 9724 KB ok, no valid answer
127 Correct 114 ms 11696 KB ok, no valid answer