oj.uz

Submission #796168

# Submission time Handle Problem Language Result Execution time Memory
796168 2023-07-28T07:18:34 Z _martynas Split the Attractions (IOI19_split) C++14
100 / 100
 89 ms 20196 KB 
#include "split.h"
#include <algorithm>
#include <iostream>

using namespace std;

const int mxn = 1e5+5;

bool visited[mxn];
int sz[mxn];
vector<int> par;
vector<int> color, adj[mxn];
vector<pair<int, int>> new_edges;

void dfs(int u) {
    visited[u] = true;
    sz[u] = 1;
    for(int v : adj[u]) if(!visited[v]) {
        par[v] = u;
        new_edges.push_back({u, v});
        dfs(v); sz[u] += sz[v];
    }
}

int find_centroid(int u, int n) {
    visited[u] = true;
    for(int v : adj[u]) if(!visited[v] && 2*sz[v]>n) {
        return find_centroid(v, n);
    }
    return u;
}

void mark(int u, int m, vector<int> &where, int &cnt) {
    if(cnt <= 0) return;
    visited[u] = true;
    where[u] = m;
    cnt--;
    for(int v : adj[u]) if(!visited[v]) {
        mark(v, m, where, cnt);
    }
}

int get_par(int u) {
    return par[u] == u ? u : par[u] = get_par(par[u]);
}

bool join(int u, int v) {
    u = get_par(u), v = get_par(v);
    if(u == v) return false;
    if(sz[u] < sz[v]) swap(u, v);
    sz[u] += sz[v];
    par[v] = u;
    return true;
}

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++) {
        int u = p[i], v = q[i];
        adj[u].push_back(v), adj[v].push_back(u);
    }
    par.resize(n, -1);
    dfs(0);
    for(int i = 0; i < n; i++) {
        adj[i].clear();
    }
    for(auto e : new_edges) {
        adj[e.first].push_back(e.second);
        adj[e.second].push_back(e.first);
    }
    fill(visited, visited+n, false);
    int centroid = find_centroid(0, n);
    vector<pair<int, int>> groups = {pair<int, int>{a, 1}, pair<int, int>{b, 2}, pair<int, int>{c, 3}};
    sort(groups.begin(), groups.end());
	color.resize(n, groups[2].second);
    int small_group = -1;
    int cnt;
    if(par[centroid] != -1) sz[par[centroid]] = n-sz[centroid];
    // continue adding non-tree edges until max sz exceeds min(a, b, c)
    // or the edges run out
    int mx = 0;
    // current maximum
    for(int u : adj[centroid]) mx = max(mx, sz[u]);
    // initial parents (set sizes are equivalent to subtree ones)
    fill(visited, visited+n, false);
    visited[centroid] = true;
    for(int u : adj[centroid]) {
        cnt = mxn;
        mark(u, u, par, cnt);
    }
    // adding edges
    for(int i = 0; i < p.size() && mx < groups[0].first; i++) {
        if(p[i] != centroid && q[i] != centroid && join(p[i], q[i])) {
            adj[p[i]].push_back(q[i]);
            adj[q[i]].push_back(p[i]);
            mx = max(mx, sz[get_par(p[i])]);
        }
    }
    if(mx < groups[0].first) return vector<int>(n, 0);
    fill(visited, visited+n, false);
    for(int u : adj[centroid]) {
        if(sz[u] >= groups[0].first) {
            visited[centroid] = true;
            cnt = groups[0].first;
            mark(u, groups[0].second, color, cnt);
            small_group = u;
            break;
        }
    }
    cnt = groups[1].first;
    mark(centroid, groups[1].second, color, cnt);
	return color;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:57:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for(int i = 0; i < p.size(); i++) {
      |                    ~~^~~~~~~~~~
split.cpp:91:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for(int i = 0; i < p.size() && mx < groups[0].first; i++) {
      |                    ~~^~~~~~~~~~
split.cpp:75:9: warning: variable 'small_group' set but not used [-Wunused-but-set-variable]
   75 |     int small_group = -1;
      |         ^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 1 ms 2644 KB ok, correct split
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 1 ms 2644 KB ok, correct split
6 Correct 1 ms 2644 KB ok, correct split
7 Correct 56 ms 18708 KB ok, correct split
8 Correct 53 ms 15968 KB ok, correct split
9 Correct 73 ms 15060 KB ok, correct split
10 Correct 58 ms 19144 KB ok, correct split
11 Correct 55 ms 19132 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 1 ms 2644 KB ok, correct split
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 66 ms 15180 KB ok, correct split
5 Correct 55 ms 9832 KB ok, correct split
6 Correct 55 ms 19152 KB ok, correct split
7 Correct 51 ms 15644 KB ok, correct split
8 Correct 69 ms 12060 KB ok, correct split
9 Correct 61 ms 9788 KB ok, correct split
10 Correct 36 ms 10176 KB ok, correct split
11 Correct 37 ms 10196 KB ok, correct split
12 Correct 38 ms 10272 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 56 ms 9884 KB ok, correct split
3 Correct 18 ms 5464 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 70 ms 12936 KB ok, correct split
6 Correct 59 ms 12504 KB ok, correct split
7 Correct 53 ms 12332 KB ok, correct split
8 Correct 59 ms 13888 KB ok, correct split
9 Correct 59 ms 12152 KB ok, correct split
10 Correct 20 ms 5192 KB ok, no valid answer
11 Correct 27 ms 6180 KB ok, no valid answer
12 Correct 51 ms 9976 KB ok, no valid answer
13 Correct 48 ms 9932 KB ok, no valid answer
14 Correct 40 ms 10088 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 1 ms 2644 KB ok, correct split
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 1 ms 2644 KB ok, correct split
6 Correct 1 ms 2644 KB ok, correct split
7 Correct 56 ms 18708 KB ok, correct split
8 Correct 53 ms 15968 KB ok, correct split
9 Correct 73 ms 15060 KB ok, correct split
10 Correct 58 ms 19144 KB ok, correct split
11 Correct 55 ms 19132 KB ok, correct split
12 Correct 1 ms 2644 KB ok, correct split
13 Correct 1 ms 2644 KB ok, correct split
14 Correct 1 ms 2644 KB ok, correct split
15 Correct 66 ms 15180 KB ok, correct split
16 Correct 55 ms 9832 KB ok, correct split
17 Correct 55 ms 19152 KB ok, correct split
18 Correct 51 ms 15644 KB ok, correct split
19 Correct 69 ms 12060 KB ok, correct split
20 Correct 61 ms 9788 KB ok, correct split
21 Correct 36 ms 10176 KB ok, correct split
22 Correct 37 ms 10196 KB ok, correct split
23 Correct 38 ms 10272 KB ok, correct split
24 Correct 1 ms 2644 KB ok, correct split
25 Correct 56 ms 9884 KB ok, correct split
26 Correct 18 ms 5464 KB ok, correct split
27 Correct 1 ms 2644 KB ok, correct split
28 Correct 70 ms 12936 KB ok, correct split
29 Correct 59 ms 12504 KB ok, correct split
30 Correct 53 ms 12332 KB ok, correct split
31 Correct 59 ms 13888 KB ok, correct split
32 Correct 59 ms 12152 KB ok, correct split
33 Correct 20 ms 5192 KB ok, no valid answer
34 Correct 27 ms 6180 KB ok, no valid answer
35 Correct 51 ms 9976 KB ok, no valid answer
36 Correct 48 ms 9932 KB ok, no valid answer
37 Correct 40 ms 10088 KB ok, no valid answer
38 Correct 1 ms 2644 KB ok, correct split
39 Correct 1 ms 2644 KB ok, no valid answer
40 Correct 1 ms 2644 KB ok, correct split
41 Correct 1 ms 2644 KB ok, correct split
42 Correct 2 ms 2644 KB ok, correct split
43 Correct 1 ms 2644 KB ok, correct split
44 Correct 2 ms 2644 KB ok, correct split
45 Correct 1 ms 2644 KB ok, correct split
46 Correct 3 ms 2900 KB ok, correct split
47 Correct 3 ms 2900 KB ok, correct split
48 Correct 2 ms 2644 KB ok, correct split
49 Correct 4 ms 2900 KB ok, correct split
50 Correct 1 ms 2644 KB ok, correct split
51 Correct 1 ms 2644 KB ok, correct split
52 Correct 1 ms 2644 KB ok, correct split
53 Correct 1 ms 2644 KB ok, correct split
54 Correct 1 ms 2644 KB ok, correct split
55 Correct 2 ms 2644 KB ok, correct split
56 Correct 2 ms 2644 KB ok, correct split
57 Correct 3 ms 2792 KB ok, correct split
58 Correct 2 ms 2928 KB ok, correct split
59 Correct 2 ms 2900 KB ok, correct split
60 Correct 2 ms 2900 KB ok, correct split
61 Correct 2 ms 2900 KB ok, correct split
62 Correct 3 ms 2900 KB ok, correct split
63 Correct 2 ms 2900 KB ok, correct split
64 Correct 3 ms 2924 KB ok, correct split
65 Correct 3 ms 2856 KB ok, correct split
66 Correct 2 ms 2660 KB ok, correct split
67 Correct 3 ms 2900 KB ok, correct split
68 Correct 2 ms 2644 KB ok, correct split
69 Correct 2 ms 2656 KB ok, correct split
70 Correct 2 ms 2656 KB ok, correct split
71 Correct 2 ms 2796 KB ok, correct split
72 Correct 2 ms 2788 KB ok, correct split
73 Correct 2 ms 2772 KB ok, correct split
74 Correct 3 ms 2924 KB ok, correct split
75 Correct 3 ms 2900 KB ok, correct split
76 Correct 3 ms 2904 KB ok, correct split
77 Correct 3 ms 2900 KB ok, correct split
78 Correct 2 ms 2772 KB ok, correct split
79 Correct 3 ms 2796 KB ok, correct split
80 Correct 3 ms 2924 KB ok, correct split
81 Correct 3 ms 2900 KB ok, correct split
82 Correct 4 ms 2900 KB ok, correct split
83 Correct 2 ms 2900 KB ok, correct split
84 Correct 2 ms 2960 KB ok, no valid answer
85 Correct 2 ms 2772 KB ok, correct split
86 Correct 4 ms 2948 KB ok, correct split
87 Correct 2 ms 2644 KB ok, no valid answer
88 Correct 2 ms 2644 KB ok, no valid answer
89 Correct 3 ms 2772 KB ok, no valid answer
90 Correct 3 ms 2868 KB ok, no valid answer
91 Correct 3 ms 2772 KB ok, no valid answer
92 Correct 3 ms 2900 KB ok, no valid answer
93 Correct 3 ms 2792 KB ok, no valid answer
94 Correct 65 ms 14332 KB ok, correct split
95 Correct 84 ms 20196 KB ok, correct split
96 Correct 72 ms 18304 KB ok, correct split
97 Correct 18 ms 5996 KB ok, correct split
98 Correct 25 ms 6088 KB ok, correct split
99 Correct 34 ms 8932 KB ok, correct split
100 Correct 89 ms 15048 KB ok, correct split
101 Correct 64 ms 13824 KB ok, correct split
102 Correct 59 ms 13064 KB ok, correct split
103 Correct 66 ms 13108 KB ok, correct split
104 Correct 81 ms 14548 KB ok, correct split
105 Correct 28 ms 7888 KB ok, correct split
106 Correct 62 ms 14308 KB ok, correct split
107 Correct 45 ms 11080 KB ok, correct split
108 Correct 56 ms 11080 KB ok, correct split
109 Correct 77 ms 14332 KB ok, correct split
110 Correct 86 ms 14092 KB ok, correct split
111 Correct 73 ms 14172 KB ok, correct split
112 Correct 84 ms 14540 KB ok, correct split
113 Correct 78 ms 14320 KB ok, correct split
114 Correct 8 ms 4180 KB ok, correct split
115 Correct 7 ms 3924 KB ok, correct split
116 Correct 68 ms 14060 KB ok, correct split
117 Correct 70 ms 13976 KB ok, correct split
118 Correct 60 ms 11000 KB ok, correct split
119 Correct 50 ms 11036 KB ok, correct split
120 Correct 66 ms 15840 KB ok, correct split
121 Correct 65 ms 10992 KB ok, no valid answer
122 Correct 51 ms 11232 KB ok, no valid answer
123 Correct 76 ms 15220 KB ok, no valid answer
124 Correct 72 ms 15068 KB ok, no valid answer
125 Correct 51 ms 12096 KB ok, no valid answer
126 Correct 34 ms 10436 KB ok, no valid answer
127 Correct 58 ms 12648 KB ok, no valid answer