oj.uz

Submission #265197

# Submission time Handle Problem Language Result Execution time Memory
265197 2020-08-14T13:53:08 Z Bruteforceman Split the Attractions (IOI19_split) C++14
100 / 100
 329 ms 30824 KB 
#include "bits/stdc++.h"
#include "split.h"
using namespace std;
const int maxn = 1e5 + 10;
vector <int> graph[maxn];
vector <int> g[maxn];
vector <int> aux[maxn];
int sub[maxn];
int id[maxn];
bool vis[maxn];
vector <int> cont[maxn];

void makeTree(int x) {
  vis[x] = true;
  for(int i : graph[x]) {
    if(vis[i] == false) {
      g[x].push_back(i);
      g[i].push_back(x);
      makeTree(i);
    }
  }
}
 
void dfs(int x, int par) {
  sub[x] = 1;
  for(int i : g[x]) {
    if(i != par) {
      dfs(i, x);
      sub[x] += sub[i];
    }
  }
}
int centroid(int x, int par, int range) {
  for(int i : g[x]) {
    if(i != par && range < sub[i]) {
      return centroid(i, x, range);
    }
  }
  return x;
}
void assignId(int x, int par, int idx) {
  id[x] = idx;
  cont[idx].push_back(x);
  for(int i : g[x]) {
    if(i != par) {
      assignId(i, x, idx);
    }
  }
}
void getNodes(int x, int &sum, vector <int> &v) {
  if(sum <= 0) return ;
  vis[x] = true;
  v.push_back(x);
  sum -= int(cont[x].size());
  for(int i : aux[x]) {
    if(vis[i] == false) {
      getNodes(i, sum, v);
    }
  }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
  vector <int> res (n, 0);
  int valA = 1, valB = 2, valC = 3;
  if(a > b) {
    swap(a, b);
    swap(valA, valB);
  }
  if(b > c) {
    swap(b, c);
    swap(valB, valC);
  }
  if(a > b) {
    swap(a, b);
    swap(valA, valB);
  }
  fill(vis, vis + n, false);
  for(int i = 0; i < p.size(); i++) {
    graph[p[i]].push_back(q[i]);
    graph[q[i]].push_back(p[i]);
  }
  makeTree(0);
  dfs(0, -1);
  int root = centroid(0, -1, n / 2);
  for(int i : g[root]) {
    assignId(i, root, i);
  }
  for(int i = 0; i < p.size(); i++) {
    if(p[i] == root || q[i] == root) continue;
    int x = id[p[i]];
    int y = id[q[i]];
    aux[x].push_back(y);
    aux[y].push_back(x);
  }
  bool good = false;
  auto assign = [&] (vector <int> v, int x, int valX) {
    for(int i : v) {
      if(x > 0) {
        res[i] = valX;
        x -= 1;
      }
    }
  };
  function <void(int, int&, int)> assignGraph = [&] (int x, int &cnt, int val) {
    if(cnt <= 0) return ;
    res[x] = val;
    cnt -= 1;
    vis[x] = true;
    for(int i : graph[x]) {
      if(vis[i] == false) {
        assignGraph(i, cnt, val);
      }
    }
  };
  for(int i : g[root]) {
    if(cont[i].size() >= a) {
      good = true;
      assign(cont[i], a, valA);
      break;
    }
  }
  if(not good) {
    fill(vis, vis + n, false);
    for(int i : g[root]) {
      int tmp = a;
      vector <int> v;
      getNodes(i, tmp, v);
      if(tmp <= 0) {
        fill(vis, vis + n, true);
        for(int j : v) for(int k : cont[j]) vis[k] = false; 
        assignGraph(i, a, valA);
        break;
      }
    }
  }
  if(*max_element(res.begin(), res.end()) == 0) return res;
  fill(vis, vis + n, false);
  for(int i = 0; i < n; i++) if(res[i] != 0) vis[i] = true;
  assignGraph(root, b, valB);
  for(int i = 0; i < n; i++) if(res[i] == 0) res[i] = valC;
  return res;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:77:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |   for(int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
split.cpp:87:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |   for(int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
split.cpp:115:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  115 |     if(cont[i].size() >= a) {
      |        ~~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 8 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 7 ms 9728 KB ok, correct split
5 Correct 7 ms 9728 KB ok, correct split
6 Correct 7 ms 9728 KB ok, correct split
7 Correct 210 ms 27008 KB ok, correct split
8 Correct 145 ms 25244 KB ok, correct split
9 Correct 169 ms 24792 KB ok, correct split
10 Correct 175 ms 27296 KB ok, correct split
11 Correct 163 ms 27300 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 7 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 163 ms 25744 KB ok, correct split
5 Correct 127 ms 21496 KB ok, correct split
6 Correct 142 ms 27416 KB ok, correct split
7 Correct 151 ms 25148 KB ok, correct split
8 Correct 190 ms 24312 KB ok, correct split
9 Correct 131 ms 21376 KB ok, correct split
10 Correct 100 ms 23440 KB ok, correct split
11 Correct 115 ms 23540 KB ok, correct split
12 Correct 117 ms 23536 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 9728 KB ok, correct split
2 Correct 158 ms 22004 KB ok, correct split
3 Correct 52 ms 14456 KB ok, correct split
4 Correct 7 ms 9728 KB ok, correct split
5 Correct 151 ms 23380 KB ok, correct split
6 Correct 140 ms 22900 KB ok, correct split
7 Correct 144 ms 23024 KB ok, correct split
8 Correct 150 ms 24028 KB ok, correct split
9 Correct 141 ms 22900 KB ok, correct split
10 Correct 49 ms 13816 KB ok, no valid answer
11 Correct 69 ms 15864 KB ok, no valid answer
12 Correct 126 ms 22516 KB ok, no valid answer
13 Correct 137 ms 21752 KB ok, no valid answer
14 Correct 150 ms 23536 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB ok, correct split
2 Correct 8 ms 9728 KB ok, correct split
3 Correct 7 ms 9728 KB ok, correct split
4 Correct 7 ms 9728 KB ok, correct split
5 Correct 7 ms 9728 KB ok, correct split
6 Correct 7 ms 9728 KB ok, correct split
7 Correct 210 ms 27008 KB ok, correct split
8 Correct 145 ms 25244 KB ok, correct split
9 Correct 169 ms 24792 KB ok, correct split
10 Correct 175 ms 27296 KB ok, correct split
11 Correct 163 ms 27300 KB ok, correct split
12 Correct 7 ms 9728 KB ok, correct split
13 Correct 7 ms 9728 KB ok, correct split
14 Correct 7 ms 9728 KB ok, correct split
15 Correct 163 ms 25744 KB ok, correct split
16 Correct 127 ms 21496 KB ok, correct split
17 Correct 142 ms 27416 KB ok, correct split
18 Correct 151 ms 25148 KB ok, correct split
19 Correct 190 ms 24312 KB ok, correct split
20 Correct 131 ms 21376 KB ok, correct split
21 Correct 100 ms 23440 KB ok, correct split
22 Correct 115 ms 23540 KB ok, correct split
23 Correct 117 ms 23536 KB ok, correct split
24 Correct 8 ms 9728 KB ok, correct split
25 Correct 158 ms 22004 KB ok, correct split
26 Correct 52 ms 14456 KB ok, correct split
27 Correct 7 ms 9728 KB ok, correct split
28 Correct 151 ms 23380 KB ok, correct split
29 Correct 140 ms 22900 KB ok, correct split
30 Correct 144 ms 23024 KB ok, correct split
31 Correct 150 ms 24028 KB ok, correct split
32 Correct 141 ms 22900 KB ok, correct split
33 Correct 49 ms 13816 KB ok, no valid answer
34 Correct 69 ms 15864 KB ok, no valid answer
35 Correct 126 ms 22516 KB ok, no valid answer
36 Correct 137 ms 21752 KB ok, no valid answer
37 Correct 150 ms 23536 KB ok, no valid answer
38 Correct 8 ms 9728 KB ok, correct split
39 Correct 8 ms 9728 KB ok, no valid answer
40 Correct 7 ms 9728 KB ok, correct split
41 Correct 7 ms 9728 KB ok, correct split
42 Correct 7 ms 9728 KB ok, correct split
43 Correct 8 ms 9728 KB ok, correct split
44 Correct 8 ms 9676 KB ok, correct split
45 Correct 8 ms 9728 KB ok, correct split
46 Correct 10 ms 10112 KB ok, correct split
47 Correct 11 ms 10112 KB ok, correct split
48 Correct 7 ms 9728 KB ok, correct split
49 Correct 10 ms 10112 KB ok, correct split
50 Correct 7 ms 9728 KB ok, correct split
51 Correct 7 ms 9728 KB ok, correct split
52 Correct 7 ms 9728 KB ok, correct split
53 Correct 7 ms 9728 KB ok, correct split
54 Correct 7 ms 9728 KB ok, correct split
55 Correct 7 ms 9728 KB ok, correct split
56 Correct 7 ms 9728 KB ok, correct split
57 Correct 8 ms 9856 KB ok, correct split
58 Correct 9 ms 10112 KB ok, correct split
59 Correct 11 ms 10112 KB ok, correct split
60 Correct 9 ms 10112 KB ok, correct split
61 Correct 9 ms 10112 KB ok, correct split
62 Correct 11 ms 10112 KB ok, correct split
63 Correct 10 ms 10240 KB ok, correct split
64 Correct 11 ms 10240 KB ok, correct split
65 Correct 10 ms 10240 KB ok, correct split
66 Correct 7 ms 9728 KB ok, correct split
67 Correct 12 ms 10240 KB ok, correct split
68 Correct 7 ms 9856 KB ok, correct split
69 Correct 7 ms 9728 KB ok, correct split
70 Correct 8 ms 9728 KB ok, correct split
71 Correct 12 ms 10112 KB ok, correct split
72 Correct 12 ms 10112 KB ok, correct split
73 Correct 11 ms 9984 KB ok, correct split
74 Correct 12 ms 10112 KB ok, correct split
75 Correct 12 ms 10112 KB ok, correct split
76 Correct 10 ms 10112 KB ok, correct split
77 Correct 10 ms 10112 KB ok, correct split
78 Correct 8 ms 9984 KB ok, correct split
79 Correct 9 ms 9984 KB ok, correct split
80 Correct 10 ms 10112 KB ok, correct split
81 Correct 11 ms 10112 KB ok, correct split
82 Correct 12 ms 10112 KB ok, correct split
83 Correct 9 ms 10112 KB ok, correct split
84 Correct 9 ms 10112 KB ok, no valid answer
85 Correct 9 ms 9984 KB ok, correct split
86 Correct 11 ms 10112 KB ok, correct split
87 Correct 7 ms 9728 KB ok, no valid answer
88 Correct 0 ms 9704 KB ok, no valid answer
89 Correct 11 ms 9984 KB ok, no valid answer
90 Correct 11 ms 10112 KB ok, no valid answer
91 Correct 9 ms 10112 KB ok, no valid answer
92 Correct 9 ms 10112 KB ok, no valid answer
93 Correct 9 ms 10112 KB ok, no valid answer
94 Correct 175 ms 24088 KB ok, correct split
95 Correct 231 ms 29252 KB ok, correct split
96 Correct 227 ms 27920 KB ok, correct split
97 Correct 59 ms 14584 KB ok, correct split
98 Correct 67 ms 14712 KB ok, correct split
99 Correct 88 ms 17444 KB ok, correct split
100 Correct 245 ms 26700 KB ok, correct split
101 Correct 200 ms 24808 KB ok, correct split
102 Correct 286 ms 24804 KB ok, correct split
103 Correct 207 ms 24916 KB ok, correct split
104 Correct 188 ms 26236 KB ok, correct split
105 Correct 118 ms 17784 KB ok, correct split
106 Correct 197 ms 30824 KB ok, correct split
107 Correct 176 ms 21880 KB ok, correct split
108 Correct 185 ms 21420 KB ok, correct split
109 Correct 329 ms 25696 KB ok, correct split
110 Correct 188 ms 26224 KB ok, correct split
111 Correct 196 ms 25712 KB ok, correct split
112 Correct 188 ms 26480 KB ok, correct split
113 Correct 206 ms 26036 KB ok, correct split
114 Correct 23 ms 11776 KB ok, correct split
115 Correct 25 ms 11488 KB ok, correct split
116 Correct 196 ms 26200 KB ok, correct split
117 Correct 192 ms 25460 KB ok, correct split
118 Correct 144 ms 21444 KB ok, correct split
119 Correct 157 ms 21368 KB ok, correct split
120 Correct 155 ms 24932 KB ok, correct split
121 Correct 156 ms 21752 KB ok, no valid answer
122 Correct 166 ms 22388 KB ok, no valid answer
123 Correct 244 ms 26744 KB ok, no valid answer
124 Correct 218 ms 26360 KB ok, no valid answer
125 Correct 192 ms 24304 KB ok, no valid answer
126 Correct 131 ms 22512 KB ok, no valid answer
127 Correct 215 ms 25072 KB ok, no valid answer