oj.uz

답안 #292032

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292032 2020-09-06T08:27:13 Z AlexLuchianov Split the Attractions (IOI19_split) C++14
100 / 100
 241 ms 32744 KB 
#include "split.h"
#include <vector>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <queue>
#include <iostream>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

std::vector<std::vector<int>> g;
std::vector<std::vector<int>> tree;

std::vector<int> level;
std::vector<int> sz;

void dfs(int node) {
  sz[node] = 1;
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h];
    if(level[to] == 0) {
      level[to] = level[node] + 1;
      dfs(to);
      tree[to].push_back(node);
      tree[node].push_back(to);

      sz[node] += sz[to];
    }
  }
}

int find_centroid(int node, int target) {
  for(int h = 0; h < tree[node].size(); h++) {
    int to = tree[node][h];
    if(sz[to] < sz[node] && target <= sz[to])
      return find_centroid(to, target);
  }
  return node;
}

void extract(int node, int parent, std::vector<int> &ord) {
  for(int h = 0; h < tree[node].size(); h++) {
    int to = tree[node][h];
    if(to != parent)
      extract(to, node, ord);
  } 
  ord.push_back(node);
}

void mark(int node, std::vector<int> &seen, std::vector<int> &sol, int &scount, int color) {
  if(scount == 0)
    return ;
  sol[node] = color;
  scount--;
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h];
    if(sol[to] == 3 && seen[to] == 1)
      mark(to, seen, sol, scount, color);
  }
}

std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q) {
  g.resize(n);
  tree.resize(n);
  level.resize(n);
  sz.resize(n);

  int id1 = 1, id2 = 2, id3 = 3;
  if(b < a) {
    std::swap(id1, id2);
    std::swap(a, b);
  }
  if(c < a) {
    std::swap(id1, id3);
    std::swap(a, c);
  }
  if(c < b) {
    std::swap(id2, id3);
    std::swap(b, c);
  }

  for(int i = 0; i < p.size(); i++) {
    int x = p[i];
    int y = q[i];
    g[x].push_back(y);
    g[y].push_back(x);
  }
  level[0] = 1;
  dfs(0);
  std::vector<int> sol(n, 3);
  int centroid = find_centroid(0, sz[0] / 2);
  std::vector<int> mult(n);
  std::vector<std::vector<int>> big;

  for(int h = 0; h < tree[centroid].size(); h++) {
    std::vector<int> aux;
    extract(tree[centroid][h], centroid, aux);
    big.push_back(aux);
    for(int i = 0; i < aux.size(); i++)
      mult[aux[i]] = h;
  }

  std::vector<int> used(n);
  std::vector<std::vector<int>> bigg;
  bigg.resize(big.size());

  for(int i = 0; i < p.size(); i++) {
    if(p[i] == centroid || q[i] == centroid)
      continue;

    if(mult[p[i]] != mult[q[i]]) {
      bigg[mult[p[i]]].push_back(mult[q[i]]);
      bigg[mult[q[i]]].push_back(mult[p[i]]);
    }
  }

  for(int i = 0; i < big.size(); i++) {
    if(used[i] == 0) {
      std::vector<int> current;
      std::queue<int> q;
      q.push(i);
      used[i] = 1;
      while(0 < q.size() && current.size() < a) {
        int node = q.front();
        q.pop();
        for(int h = 0; h < big[node].size(); h++)
          current.push_back(big[node][h]);

        for(int h = 0; h < bigg[node].size(); h++) {
          int to = bigg[node][h];
          if(used[to] == 0) {
            used[to] = 1;
            q.push(to);
          }
        }
      }
      if(current.size() < a)
        continue;
      else {
        std::vector<int> seen(n, 0);
        for(int i = 0; i < current.size(); i++)
          seen[current[i]] = 1;
        mark(current[0], seen, sol, a, 1);
        seen = std::vector<int>(n, 1);
        mark(centroid, seen, sol, b, 2);
        for(int i = 0; i < sol.size(); i++)
          if(sol[i] == 1)
            sol[i] = id1;
          else if(sol[i] == 2)
            sol[i] = id2;
          else if(sol[i] == 3)
            sol[i] = id3;
        return sol;
      }
    }
  }
  return std::vector<int>(n, 0);
}

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:21:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   for(int h = 0; h < g[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~
split.cpp: In function 'int find_centroid(int, int)':
split.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for(int h = 0; h < tree[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~
split.cpp: In function 'void extract(int, int, std::vector<int>&)':
split.cpp:44:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int h = 0; h < tree[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~
split.cpp: In function 'void mark(int, std::vector<int>&, std::vector<int>&, int&, int)':
split.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |   for(int h = 0; h < g[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:84:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for(int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
split.cpp:97:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   for(int h = 0; h < tree[centroid].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~~~~~
split.cpp:101:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |     for(int i = 0; i < aux.size(); i++)
      |                    ~~^~~~~~~~~~~~
split.cpp:109:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |   for(int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~
split.cpp:119:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |   for(int i = 0; i < big.size(); i++) {
      |                  ~~^~~~~~~~~~~~
split.cpp:125:44: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  125 |       while(0 < q.size() && current.size() < a) {
      |                             ~~~~~~~~~~~~~~~^~~
split.cpp:128:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |         for(int h = 0; h < big[node].size(); h++)
      |                        ~~^~~~~~~~~~~~~~~~~~
split.cpp:131:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int h = 0; h < bigg[node].size(); h++) {
      |                        ~~^~~~~~~~~~~~~~~~~~~
split.cpp:139:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  139 |       if(current.size() < a)
      |          ~~~~~~~~~~~~~~~^~~
split.cpp:143:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |         for(int i = 0; i < current.size(); i++)
      |                        ~~^~~~~~~~~~~~~~~~
split.cpp:148:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  148 |         for(int i = 0; i < sol.size(); i++)
      |                        ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 177 ms 22064 KB ok, correct split
8 Correct 142 ms 20656 KB ok, correct split
9 Correct 151 ms 20272 KB ok, correct split
10 Correct 160 ms 22376 KB ok, correct split
11 Correct 159 ms 22320 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 0 ms 256 KB ok, correct split
4 Correct 165 ms 21684 KB ok, correct split
5 Correct 125 ms 17400 KB ok, correct split
6 Correct 143 ms 22320 KB ok, correct split
7 Correct 157 ms 20528 KB ok, correct split
8 Correct 197 ms 20344 KB ok, correct split
9 Correct 134 ms 17512 KB ok, correct split
10 Correct 117 ms 25068 KB ok, correct split
11 Correct 107 ms 25020 KB ok, correct split
12 Correct 116 ms 25316 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB ok, correct split
2 Correct 127 ms 17620 KB ok, correct split
3 Correct 39 ms 7288 KB ok, correct split
4 Correct 1 ms 384 KB ok, correct split
5 Correct 159 ms 19296 KB ok, correct split
6 Correct 162 ms 19312 KB ok, correct split
7 Correct 170 ms 19232 KB ok, correct split
8 Correct 177 ms 19488 KB ok, correct split
9 Correct 177 ms 19208 KB ok, correct split
10 Correct 33 ms 5880 KB ok, no valid answer
11 Correct 72 ms 8812 KB ok, no valid answer
12 Correct 160 ms 21772 KB ok, no valid answer
13 Correct 150 ms 17880 KB ok, no valid answer
14 Correct 148 ms 24932 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, no valid answer
3 Correct 0 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 1 ms 256 KB ok, correct split
6 Correct 0 ms 256 KB ok, correct split
7 Correct 1 ms 392 KB ok, correct split
8 Correct 1 ms 384 KB ok, correct split
9 Correct 3 ms 768 KB ok, correct split
10 Correct 4 ms 768 KB ok, correct split
11 Correct 1 ms 384 KB ok, correct split
12 Correct 3 ms 896 KB ok, correct split
13 Correct 1 ms 256 KB ok, correct split
14 Correct 1 ms 256 KB ok, correct split
15 Correct 1 ms 384 KB ok, correct split
16 Correct 1 ms 384 KB ok, correct split
17 Correct 0 ms 256 KB ok, correct split
18 Correct 0 ms 256 KB ok, correct split
19 Correct 1 ms 384 KB ok, correct split
20 Correct 2 ms 512 KB ok, correct split
21 Correct 3 ms 768 KB ok, correct split
22 Correct 3 ms 768 KB ok, correct split
23 Correct 3 ms 768 KB ok, correct split
24 Correct 4 ms 776 KB ok, correct split
25 Correct 3 ms 792 KB ok, correct split
26 Correct 4 ms 1156 KB ok, correct split
27 Correct 4 ms 1024 KB ok, correct split
28 Correct 4 ms 1024 KB ok, correct split
29 Correct 1 ms 384 KB ok, correct split
30 Correct 4 ms 1024 KB ok, correct split
31 Correct 2 ms 384 KB ok, correct split
32 Correct 1 ms 384 KB ok, correct split
33 Correct 1 ms 384 KB ok, correct split
34 Correct 3 ms 896 KB ok, correct split
35 Correct 3 ms 768 KB ok, correct split
36 Correct 3 ms 768 KB ok, correct split
37 Correct 4 ms 896 KB ok, correct split
38 Correct 4 ms 896 KB ok, correct split
39 Correct 4 ms 896 KB ok, correct split
40 Correct 4 ms 896 KB ok, correct split
41 Correct 2 ms 512 KB ok, correct split
42 Correct 2 ms 512 KB ok, correct split
43 Correct 4 ms 896 KB ok, correct split
44 Correct 4 ms 768 KB ok, correct split
45 Correct 4 ms 896 KB ok, correct split
46 Correct 3 ms 768 KB ok, correct split
47 Correct 3 ms 768 KB ok, no valid answer
48 Correct 4 ms 768 KB ok, correct split
49 Correct 3 ms 872 KB ok, correct split
50 Correct 1 ms 256 KB ok, no valid answer
51 Correct 1 ms 256 KB ok, no valid answer
52 Correct 3 ms 768 KB ok, no valid answer
53 Correct 4 ms 768 KB ok, no valid answer
54 Correct 4 ms 972 KB ok, no valid answer
55 Correct 3 ms 896 KB ok, no valid answer
56 Correct 3 ms 896 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB ok, correct split
2 Correct 0 ms 256 KB ok, correct split
3 Correct 1 ms 256 KB ok, correct split
4 Correct 1 ms 256 KB ok, correct split
5 Correct 1 ms 384 KB ok, correct split
6 Correct 1 ms 384 KB ok, correct split
7 Correct 177 ms 22064 KB ok, correct split
8 Correct 142 ms 20656 KB ok, correct split
9 Correct 151 ms 20272 KB ok, correct split
10 Correct 160 ms 22376 KB ok, correct split
11 Correct 159 ms 22320 KB ok, correct split
12 Correct 0 ms 256 KB ok, correct split
13 Correct 0 ms 256 KB ok, correct split
14 Correct 0 ms 256 KB ok, correct split
15 Correct 165 ms 21684 KB ok, correct split
16 Correct 125 ms 17400 KB ok, correct split
17 Correct 143 ms 22320 KB ok, correct split
18 Correct 157 ms 20528 KB ok, correct split
19 Correct 197 ms 20344 KB ok, correct split
20 Correct 134 ms 17512 KB ok, correct split
21 Correct 117 ms 25068 KB ok, correct split
22 Correct 107 ms 25020 KB ok, correct split
23 Correct 116 ms 25316 KB ok, correct split
24 Correct 0 ms 256 KB ok, correct split
25 Correct 127 ms 17620 KB ok, correct split
26 Correct 39 ms 7288 KB ok, correct split
27 Correct 1 ms 384 KB ok, correct split
28 Correct 159 ms 19296 KB ok, correct split
29 Correct 162 ms 19312 KB ok, correct split
30 Correct 170 ms 19232 KB ok, correct split
31 Correct 177 ms 19488 KB ok, correct split
32 Correct 177 ms 19208 KB ok, correct split
33 Correct 33 ms 5880 KB ok, no valid answer
34 Correct 72 ms 8812 KB ok, no valid answer
35 Correct 160 ms 21772 KB ok, no valid answer
36 Correct 150 ms 17880 KB ok, no valid answer
37 Correct 148 ms 24932 KB ok, no valid answer
38 Correct 1 ms 256 KB ok, correct split
39 Correct 0 ms 256 KB ok, no valid answer
40 Correct 0 ms 256 KB ok, correct split
41 Correct 1 ms 256 KB ok, correct split
42 Correct 1 ms 256 KB ok, correct split
43 Correct 0 ms 256 KB ok, correct split
44 Correct 1 ms 392 KB ok, correct split
45 Correct 1 ms 384 KB ok, correct split
46 Correct 3 ms 768 KB ok, correct split
47 Correct 4 ms 768 KB ok, correct split
48 Correct 1 ms 384 KB ok, correct split
49 Correct 3 ms 896 KB ok, correct split
50 Correct 1 ms 256 KB ok, correct split
51 Correct 1 ms 256 KB ok, correct split
52 Correct 1 ms 384 KB ok, correct split
53 Correct 1 ms 384 KB ok, correct split
54 Correct 0 ms 256 KB ok, correct split
55 Correct 0 ms 256 KB ok, correct split
56 Correct 1 ms 384 KB ok, correct split
57 Correct 2 ms 512 KB ok, correct split
58 Correct 3 ms 768 KB ok, correct split
59 Correct 3 ms 768 KB ok, correct split
60 Correct 3 ms 768 KB ok, correct split
61 Correct 4 ms 776 KB ok, correct split
62 Correct 3 ms 792 KB ok, correct split
63 Correct 4 ms 1156 KB ok, correct split
64 Correct 4 ms 1024 KB ok, correct split
65 Correct 4 ms 1024 KB ok, correct split
66 Correct 1 ms 384 KB ok, correct split
67 Correct 4 ms 1024 KB ok, correct split
68 Correct 2 ms 384 KB ok, correct split
69 Correct 1 ms 384 KB ok, correct split
70 Correct 1 ms 384 KB ok, correct split
71 Correct 3 ms 896 KB ok, correct split
72 Correct 3 ms 768 KB ok, correct split
73 Correct 3 ms 768 KB ok, correct split
74 Correct 4 ms 896 KB ok, correct split
75 Correct 4 ms 896 KB ok, correct split
76 Correct 4 ms 896 KB ok, correct split
77 Correct 4 ms 896 KB ok, correct split
78 Correct 2 ms 512 KB ok, correct split
79 Correct 2 ms 512 KB ok, correct split
80 Correct 4 ms 896 KB ok, correct split
81 Correct 4 ms 768 KB ok, correct split
82 Correct 4 ms 896 KB ok, correct split
83 Correct 3 ms 768 KB ok, correct split
84 Correct 3 ms 768 KB ok, no valid answer
85 Correct 4 ms 768 KB ok, correct split
86 Correct 3 ms 872 KB ok, correct split
87 Correct 1 ms 256 KB ok, no valid answer
88 Correct 1 ms 256 KB ok, no valid answer
89 Correct 3 ms 768 KB ok, no valid answer
90 Correct 4 ms 768 KB ok, no valid answer
91 Correct 4 ms 972 KB ok, no valid answer
92 Correct 3 ms 896 KB ok, no valid answer
93 Correct 3 ms 896 KB ok, no valid answer
94 Correct 161 ms 19772 KB ok, correct split
95 Correct 241 ms 24500 KB ok, correct split
96 Correct 234 ms 22892 KB ok, correct split
97 Correct 42 ms 7160 KB ok, correct split
98 Correct 50 ms 7288 KB ok, correct split
99 Correct 67 ms 8568 KB ok, correct split
100 Correct 198 ms 21116 KB ok, correct split
101 Correct 213 ms 20088 KB ok, correct split
102 Correct 166 ms 21484 KB ok, correct split
103 Correct 157 ms 22120 KB ok, correct split
104 Correct 169 ms 21396 KB ok, correct split
105 Correct 78 ms 11512 KB ok, correct split
106 Correct 239 ms 32744 KB ok, correct split
107 Correct 170 ms 17788 KB ok, correct split
108 Correct 155 ms 17652 KB ok, correct split
109 Correct 207 ms 20604 KB ok, correct split
110 Correct 202 ms 21744 KB ok, correct split
111 Correct 219 ms 21488 KB ok, correct split
112 Correct 196 ms 22084 KB ok, correct split
113 Correct 186 ms 21764 KB ok, correct split
114 Correct 15 ms 2688 KB ok, correct split
115 Correct 14 ms 2432 KB ok, correct split
116 Correct 212 ms 21488 KB ok, correct split
117 Correct 195 ms 21108 KB ok, correct split
118 Correct 158 ms 17720 KB ok, correct split
119 Correct 149 ms 17148 KB ok, correct split
120 Correct 157 ms 19988 KB ok, correct split
121 Correct 152 ms 16988 KB ok, no valid answer
122 Correct 131 ms 18772 KB ok, no valid answer
123 Correct 208 ms 20604 KB ok, no valid answer
124 Correct 202 ms 20732 KB ok, no valid answer
125 Correct 156 ms 23396 KB ok, no valid answer
126 Correct 110 ms 22500 KB ok, no valid answer
127 Correct 170 ms 22248 KB ok, no valid answer