oj.uz

Submission #144414

# Submission time Handle Problem Language Result Execution time Memory
144414 2019-08-16T20:28:46 Z xiaowuc1 Split the Attractions (IOI19_split) C++14
100 / 100
 161 ms 17016 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

vector<int> edges[100005];

int ufpar[100005];
int ufsz[100005];

int find(int x) {
  return ufpar[x] == x ? x : (ufpar[x] = find(ufpar[x]));
}
bool merge(int x, int y) {
  x = find(x);
  y = find(y);
  if(x == y) return false;
  if(ufsz[x] < ufsz[y]) swap(x, y);
  ufsz[x] += ufsz[y];
  ufpar[y] = x;
  return true;
}

// spanning tree is rooted at 0
int treeSize[100005];
int dfsParent[100005];
bool dfsSeen[100005];
int assignedColor[100005];
int ret[100005];

bool ufcolor(int curr, int need, int want) {
  ret[curr] = want;
  if(--need == 0) return true;
  queue<int> q;
  q.push(curr);
  while(!q.empty()) {
    curr = q.front(); q.pop();
    for(int out: edges[curr]) {
      if(find(out) != find(curr)) continue;
      if(ret[out]) continue;
      ret[out] = want;
      if(--need == 0) return true;
      q.push(out);
    }
  }
  return false;
}

vector<int> consolidate(int n) {
  vector<int> ans;
  map<int, int> dp;
  for(int i = 0; i < n; i++) {
    assert(ret[i] >= 1 && ret[i] <= 3);
    ans.push_back(ret[i]);
    dp[ret[i]]++;
  }
  return ans;
}

void downColor(int curr, int par, int& need, int want) {
  assert(ret[curr] == 0);
  ret[curr] = want;
  assert(need-- > 0);
  if(need > 0 && dfsParent[curr] >= 0 && dfsParent[curr] != par) {
    downColor(dfsParent[curr], curr, need, want);
  }
  for(int out: edges[curr]) {
    if(need == 0) break;
    if(out == par) continue;
    if(dfsParent[out] != curr) continue;
    downColor(out, curr, need, want);
  }
}

bool upColor(int curr, int need, int want) {
  queue<int> q;
  q.push(curr);
  ret[curr] = want;
  if(--need == 0) return true;
  while(!q.empty()) {
    curr = q.front(); q.pop();
    for(int out: edges[curr]) {
      if(ret[out]) continue;
      ret[out] = want;
      if(--need == 0) return true;
      q.push(out);
    }
  }
  return false;
}

void fillRest(int n, int want) {
  for(int i = 0; i < n; i++) {
    if(ret[i] == 0) ret[i] = want;
  }
}

void dfs(int curr, int par) {
  treeSize[curr] = 1;
  dfsSeen[curr] = true;
  dfsParent[curr] = par;
  for(int out: edges[curr]) {
    if(dfsSeen[out]) continue;
    dfs(out, curr);
    treeSize[curr] += treeSize[out];
  }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
  for(int i = 0; i < p.size(); i++) {
    edges[p[i]].push_back(q[i]);
    edges[q[i]].push_back(p[i]);
  }
  dfs(0, -1);
  vector<pii> sizes;
  sizes.emplace_back(a, 1);
  sizes.emplace_back(b, 2);
  sizes.emplace_back(c, 3);
  sort(sizes.begin(), sizes.end());
  // is there a subtree such that it can be colored with size a and the other half can be colored with size b
  for(int i = 1; i < n; i++) {
    if(treeSize[i] >= sizes[0].first && n-treeSize[i] >= sizes[1].first) {
      downColor(i, dfsParent[i], sizes[0].first, sizes[0].second);
      assert(upColor(dfsParent[i], sizes[1].first, sizes[1].second));
      fillRest(n, sizes[2].second);
      return consolidate(n);
    }
    if(treeSize[i] >= sizes[1].first && n-treeSize[i] >= sizes[0].first) {
      downColor(dfsParent[i], i, sizes[0].first, sizes[0].second);
      assert(upColor(i, sizes[1].first, sizes[1].second));
      fillRest(n, sizes[2].second);
      return consolidate(n);
    }
  }
  // find a node such that, when deleted, all trees have size < a
  int critical = -1;
  for(int i = 0; i < n; i++) {
    int largestTree = 0;
    int parentSize = n-1;
    for(int out: edges[i]) {
      if(dfsParent[out] != i) continue;
      largestTree = max(largestTree, treeSize[out]);
      parentSize -= treeSize[out];
    }
    largestTree = max(largestTree, parentSize);
    if(largestTree >= sizes[0].first) continue;
    critical = i;
    break;
  }
  assert(critical != -1);
  for(int i = 0; i < n; i++) {
    ufpar[i] = i;
    ufsz[i] = 1;
  }
  for(int i = 1; i < n; i++) {
    if(i == critical || dfsParent[i] == critical) continue;
    assert(merge(i, dfsParent[i]));
    assert(ufsz[find(i)] < sizes[0].first);
  }
  for(int i = 0; i < n; i++) {
    for(int out: edges[i]) {
      if(i == critical || out == critical) continue;
      if(!merge(i, out)) continue;
      if(ufsz[find(i)] >= sizes[0].first) {
        ufcolor(i, sizes[0].first, sizes[0].second);
        assert(upColor(critical, sizes[1].first, sizes[1].second));
        fillRest(n, sizes[2].second);
        return consolidate(n);
      }
    }
  }
  vector<int> ans;
  ans.resize(n);
  return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:111:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < p.size(); i++) {
                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 5 ms 2680 KB ok, correct split
6 Correct 4 ms 2676 KB ok, correct split
7 Correct 97 ms 13892 KB ok, correct split
8 Correct 85 ms 12408 KB ok, correct split
9 Correct 95 ms 11984 KB ok, correct split
10 Correct 93 ms 13944 KB ok, correct split
11 Correct 103 ms 13960 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2616 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 103 ms 12636 KB ok, correct split
5 Correct 77 ms 9464 KB ok, correct split
6 Correct 131 ms 13944 KB ok, correct split
7 Correct 87 ms 12280 KB ok, correct split
8 Correct 137 ms 11680 KB ok, correct split
9 Correct 104 ms 9308 KB ok, correct split
10 Correct 64 ms 9840 KB ok, correct split
11 Correct 64 ms 9840 KB ok, correct split
12 Correct 78 ms 9840 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 91 ms 9380 KB ok, correct split
3 Correct 34 ms 5500 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 93 ms 11128 KB ok, correct split
6 Correct 85 ms 11128 KB ok, correct split
7 Correct 91 ms 11212 KB ok, correct split
8 Correct 89 ms 11344 KB ok, correct split
9 Correct 86 ms 11276 KB ok, correct split
10 Correct 28 ms 4984 KB ok, no valid answer
11 Correct 42 ms 6136 KB ok, no valid answer
12 Correct 73 ms 9816 KB ok, no valid answer
13 Correct 85 ms 9592 KB ok, no valid answer
14 Correct 74 ms 9840 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB ok, correct split
2 Correct 4 ms 2680 KB ok, correct split
3 Correct 4 ms 2680 KB ok, correct split
4 Correct 4 ms 2680 KB ok, correct split
5 Correct 5 ms 2680 KB ok, correct split
6 Correct 4 ms 2676 KB ok, correct split
7 Correct 97 ms 13892 KB ok, correct split
8 Correct 85 ms 12408 KB ok, correct split
9 Correct 95 ms 11984 KB ok, correct split
10 Correct 93 ms 13944 KB ok, correct split
11 Correct 103 ms 13960 KB ok, correct split
12 Correct 4 ms 2680 KB ok, correct split
13 Correct 4 ms 2616 KB ok, correct split
14 Correct 4 ms 2680 KB ok, correct split
15 Correct 103 ms 12636 KB ok, correct split
16 Correct 77 ms 9464 KB ok, correct split
17 Correct 131 ms 13944 KB ok, correct split
18 Correct 87 ms 12280 KB ok, correct split
19 Correct 137 ms 11680 KB ok, correct split
20 Correct 104 ms 9308 KB ok, correct split
21 Correct 64 ms 9840 KB ok, correct split
22 Correct 64 ms 9840 KB ok, correct split
23 Correct 78 ms 9840 KB ok, correct split
24 Correct 4 ms 2680 KB ok, correct split
25 Correct 91 ms 9380 KB ok, correct split
26 Correct 34 ms 5500 KB ok, correct split
27 Correct 4 ms 2680 KB ok, correct split
28 Correct 93 ms 11128 KB ok, correct split
29 Correct 85 ms 11128 KB ok, correct split
30 Correct 91 ms 11212 KB ok, correct split
31 Correct 89 ms 11344 KB ok, correct split
32 Correct 86 ms 11276 KB ok, correct split
33 Correct 28 ms 4984 KB ok, no valid answer
34 Correct 42 ms 6136 KB ok, no valid answer
35 Correct 73 ms 9816 KB ok, no valid answer
36 Correct 85 ms 9592 KB ok, no valid answer
37 Correct 74 ms 9840 KB ok, no valid answer
38 Correct 4 ms 2680 KB ok, correct split
39 Correct 4 ms 2680 KB ok, no valid answer
40 Correct 4 ms 2680 KB ok, correct split
41 Correct 4 ms 2680 KB ok, correct split
42 Correct 4 ms 2680 KB ok, correct split
43 Correct 4 ms 2680 KB ok, correct split
44 Correct 4 ms 2680 KB ok, correct split
45 Correct 4 ms 2680 KB ok, correct split
46 Correct 6 ms 2936 KB ok, correct split
47 Correct 6 ms 2940 KB ok, correct split
48 Correct 4 ms 2680 KB ok, correct split
49 Correct 6 ms 2936 KB ok, correct split
50 Correct 4 ms 2680 KB ok, correct split
51 Correct 5 ms 2680 KB ok, correct split
52 Correct 4 ms 2680 KB ok, correct split
53 Correct 4 ms 2680 KB ok, correct split
54 Correct 4 ms 2680 KB ok, correct split
55 Correct 4 ms 2680 KB ok, correct split
56 Correct 4 ms 2680 KB ok, correct split
57 Correct 5 ms 2808 KB ok, correct split
58 Correct 6 ms 2936 KB ok, correct split
59 Correct 5 ms 2936 KB ok, correct split
60 Correct 5 ms 2936 KB ok, correct split
61 Correct 5 ms 2936 KB ok, correct split
62 Correct 5 ms 2936 KB ok, correct split
63 Correct 6 ms 2936 KB ok, correct split
64 Correct 6 ms 3064 KB ok, correct split
65 Correct 6 ms 2936 KB ok, correct split
66 Correct 4 ms 2680 KB ok, correct split
67 Correct 7 ms 2936 KB ok, correct split
68 Correct 5 ms 2808 KB ok, correct split
69 Correct 4 ms 2680 KB ok, correct split
70 Correct 4 ms 2680 KB ok, correct split
71 Correct 6 ms 2936 KB ok, correct split
72 Correct 6 ms 2936 KB ok, correct split
73 Correct 5 ms 2936 KB ok, correct split
74 Correct 6 ms 2936 KB ok, correct split
75 Correct 6 ms 2940 KB ok, correct split
76 Correct 7 ms 2936 KB ok, correct split
77 Correct 6 ms 2948 KB ok, correct split
78 Correct 5 ms 2808 KB ok, correct split
79 Correct 5 ms 2808 KB ok, correct split
80 Correct 8 ms 2936 KB ok, correct split
81 Correct 7 ms 2936 KB ok, correct split
82 Correct 7 ms 2936 KB ok, correct split
83 Correct 5 ms 2856 KB ok, correct split
84 Correct 5 ms 2936 KB ok, no valid answer
85 Correct 6 ms 2936 KB ok, correct split
86 Correct 6 ms 3064 KB ok, correct split
87 Correct 5 ms 2680 KB ok, no valid answer
88 Correct 5 ms 2680 KB ok, no valid answer
89 Correct 6 ms 2808 KB ok, no valid answer
90 Correct 7 ms 2940 KB ok, no valid answer
91 Correct 5 ms 2936 KB ok, no valid answer
92 Correct 6 ms 2936 KB ok, no valid answer
93 Correct 6 ms 2936 KB ok, no valid answer
94 Correct 121 ms 12536 KB ok, correct split
95 Correct 159 ms 17016 KB ok, correct split
96 Correct 129 ms 15520 KB ok, correct split
97 Correct 37 ms 6008 KB ok, correct split
98 Correct 37 ms 6080 KB ok, correct split
99 Correct 62 ms 8280 KB ok, correct split
100 Correct 158 ms 14452 KB ok, correct split
101 Correct 148 ms 13184 KB ok, correct split
102 Correct 101 ms 12784 KB ok, correct split
103 Correct 94 ms 12656 KB ok, correct split
104 Correct 106 ms 14052 KB ok, correct split
105 Correct 63 ms 8056 KB ok, correct split
106 Correct 114 ms 14816 KB ok, correct split
107 Correct 122 ms 11384 KB ok, correct split
108 Correct 122 ms 11296 KB ok, correct split
109 Correct 147 ms 14712 KB ok, correct split
110 Correct 125 ms 14448 KB ok, correct split
111 Correct 125 ms 14576 KB ok, correct split
112 Correct 161 ms 14796 KB ok, correct split
113 Correct 144 ms 14832 KB ok, correct split
114 Correct 16 ms 4088 KB ok, correct split
115 Correct 15 ms 3960 KB ok, correct split
116 Correct 127 ms 14708 KB ok, correct split
117 Correct 128 ms 14320 KB ok, correct split
118 Correct 84 ms 10484 KB ok, correct split
119 Correct 90 ms 10488 KB ok, correct split
120 Correct 87 ms 12920 KB ok, correct split
121 Correct 86 ms 10744 KB ok, no valid answer
122 Correct 91 ms 10876 KB ok, no valid answer
123 Correct 136 ms 14584 KB ok, no valid answer
124 Correct 147 ms 14584 KB ok, no valid answer
125 Correct 110 ms 11888 KB ok, no valid answer
126 Correct 59 ms 10128 KB ok, no valid answer
127 Correct 94 ms 12400 KB ok, no valid answer