oj.uz

Submission #445677

# Submission time Handle Problem Language Result Execution time Memory
445677 2021-07-19T08:56:14 Z blue Split the Attractions (IOI19_split) C++17
100 / 100
 178 ms 26068 KB 
#include "split.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cassert>
using namespace std;
 
int A, A_index, B, B_index, C, C_index;
 
struct group
{
    int v;
    int i;
};
 
bool operator < (group A, group B)
{
    return A.v < B.v;
}
 
 
const int maxN = 100'000;
vector<int> edge[1+maxN];
int N;
 
vector<int> st_edge[1+maxN];
vector<int> visit(1+maxN, 0);
 
vector<int> temp_size(1+maxN, 1);
 
void dfs(int u)
{
    visit[u] = 1;
    for(int v: edge[u])
    {
        if(visit[v]) continue;
        st_edge[u].push_back(v);
        st_edge[v].push_back(u);
        dfs(v);
        temp_size[u] += temp_size[v];
    }
}
  
vector<int> new_size(1+maxN, 1);
 
vector<int> centroid_depth(1+maxN);
 
void new_dfs(int u)
{
    visit[u] = 1;
    for(int v: st_edge[u])
    {
        if(visit[v]) continue;
        centroid_depth[v] = centroid_depth[u] + 1;
        new_dfs(v);
        new_size[u] += new_size[v];
    }
}

int centroid;
 
vector<int> res;
 
int A_count = 0, B_count = 0;
 
void A_dfs(int u)
{
    if(A_count == A) return;
 
    res[u] = A_index;
    A_count++;
 
    for(int v: st_edge[u])
    {
        if(v == centroid) continue;
        if(res[v] == A_index) continue;
        A_dfs(v);
    }
}
 
void B_dfs(int u)
{
    if(B_count == B) return;
 
    res[u] = B_index;
    B_count++;
 
    for(int v: st_edge[u])
    {
        if(res[v] != C_index) continue;
        B_dfs(v);
    }
}
 
int subtree_ct = 0;
vector<int> subtree_index(1+maxN, 0);
vector<int> subtree_size(1);
 
void final_tree_dfs(int u)
{
    subtree_index[u] = subtree_ct;
    subtree_size[subtree_ct]++;
    for(int v: st_edge[u])
    {
        if(v == centroid || subtree_index[v]) continue;
        final_tree_dfs(v);
    }
}
 
vector<int> extra_edge[1+maxN];

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
    N = n;
    int M = p.size();
    for(int j = 0; j < M; j++)
    {
        edge[ p[j] ].push_back( q[j] );
        edge[ q[j] ].push_back( p[j] );
    }
 
    vector<group> G{group{a, 1}, group{b, 2}, group{c, 3}};
    sort(G.begin(), G.end());
 
    A = G[0].v;
    A_index = G[0].i;
 
    B = G[1].v;
    B_index = G[1].i;
 
    C = G[2].v;
    C_index = G[2].i;
 
    dfs(0);
    for(centroid = 0; centroid < N; centroid++)
    {
        bool good = 1;
        if(2 * (N - temp_size[centroid]) > N) good = 0;
 
        for(int v: st_edge[centroid])
        {
            if(temp_size[v] > temp_size[centroid]) continue;
            if(2 * temp_size[v] > N) good = 0;
        }
 
        if(good) break;
    }
    visit = vector<int>(N, 0);
    centroid_depth[centroid] = 0;
    new_dfs(centroid);
 
    res = vector<int>(N, C_index);
 
    for(int X: st_edge[centroid])
    {
        if(A <= new_size[X] && B <= N - new_size[X])
        {
            A_dfs(X);
 
            B_dfs(centroid);
            return res;
        }
    }
 
    for(int u: st_edge[centroid])
    {
        subtree_ct++;
        subtree_size.push_back(0);
        final_tree_dfs(u);
    }
 
    for(int j = 0; j < M; j++)
    {
        if(subtree_index[ p[j] ] == subtree_index[ q[j] ]) continue;
        if(p[j] == centroid || q[j] == centroid) continue;
 
        extra_edge[ subtree_index[ p[j] ] ].push_back( subtree_index[ q[j] ] );
        extra_edge[ subtree_index[ q[j] ] ].push_back( subtree_index[ p[j] ] );
    }
 
    vector<int> group_visit(1+maxN, 0);
    vector<int> group_size(1+maxN, 0);
    int curr = 0;
    queue<int> tbv;
    vector<bool> added_to_queue(1+maxN, 0);
 
    bool solution_exists = 0;
  
    vector<int> original_A(1+maxN, 0);
    for(int u = 1; u <= subtree_ct; u++)
    {
        if(group_visit[u]) continue;
 
        curr++;
 
        tbv.push(u);
        added_to_queue[u] = 1;
        while(!tbv.empty())
        {
            int U = tbv.front();
            tbv.pop();
 
            group_visit[U] = curr;
            group_size[curr] += subtree_size[U];
 
            if(group_size[curr] >= A)
            {
                solution_exists = 1;
                for(int i = 0; i < N; i++)
                {
                    if(group_visit[ subtree_index[i] ] == curr)
                    {
                        original_A[i] = 1;
                    }
                }
                break;
            }
 
 
            for(int v: extra_edge[U])
            {
                if(group_visit[v]) continue;
 
                if(added_to_queue[v]) continue;
                tbv.push(v);
                added_to_queue[v] = 1;
            }
        }
 
        if(solution_exists) break;
    }
    if(!solution_exists) return vector<int>(N, 0);
 
    res = vector<int>(N, C_index);
    int count_of_A = 0, count_of_B = 0;
 
    added_to_queue = vector<bool>(N, 0);
 
    while(!tbv.empty()) tbv.pop();
    for(int x: st_edge[centroid])
    {
        if(original_A[x])
        {
            tbv.push(x);
            added_to_queue[x] = 1;
            break;
        }
    }
 
    while(!tbv.empty())
    {
        int u = tbv.front();
        tbv.pop();
        res[u] = A_index;
        count_of_A++;
        if(count_of_A == A) break;
        for(int v: edge[u])
        {
            if(original_A[v] && !added_to_queue[v])
            {
                tbv.push(v);
                added_to_queue[v] = 1;
            }
        }
    }
  
    while(!tbv.empty()) tbv.pop();
 
    added_to_queue = vector<bool>(N, 0);
 
    tbv.push(centroid);
    added_to_queue[centroid] = 1;
    while(!tbv.empty())
    {
        int u = tbv.front();
        tbv.pop();
 
        res[u] = B_index;
        count_of_B++;
        if(count_of_B == B) break;
        for(int v: edge[u])
        {
            if(res[v] == C_index)
            {
                if(added_to_queue[v]) continue;
                added_to_queue[v] = 1;
                tbv.push(v);
            }
        }
    }
    return res;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9292 KB ok, correct split
2 Correct 7 ms 9292 KB ok, correct split
3 Correct 6 ms 9252 KB ok, correct split
4 Correct 6 ms 9232 KB ok, correct split
5 Correct 6 ms 9292 KB ok, correct split
6 Correct 6 ms 9292 KB ok, correct split
7 Correct 111 ms 23728 KB ok, correct split
8 Correct 138 ms 21992 KB ok, correct split
9 Correct 119 ms 21468 KB ok, correct split
10 Correct 114 ms 24108 KB ok, correct split
11 Correct 128 ms 24160 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9292 KB ok, correct split
2 Correct 6 ms 9292 KB ok, correct split
3 Correct 7 ms 9292 KB ok, correct split
4 Correct 129 ms 21732 KB ok, correct split
5 Correct 120 ms 18108 KB ok, correct split
6 Correct 138 ms 24040 KB ok, correct split
7 Correct 111 ms 21820 KB ok, correct split
8 Correct 178 ms 19880 KB ok, correct split
9 Correct 107 ms 17892 KB ok, correct split
10 Correct 79 ms 18660 KB ok, correct split
11 Correct 81 ms 18608 KB ok, correct split
12 Correct 84 ms 18648 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9292 KB ok, correct split
2 Correct 115 ms 18316 KB ok, correct split
3 Correct 39 ms 12684 KB ok, correct split
4 Correct 6 ms 9292 KB ok, correct split
5 Correct 123 ms 19936 KB ok, correct split
6 Correct 114 ms 19668 KB ok, correct split
7 Correct 110 ms 19720 KB ok, correct split
8 Correct 134 ms 20668 KB ok, correct split
9 Correct 145 ms 19424 KB ok, correct split
10 Correct 34 ms 13116 KB ok, no valid answer
11 Correct 49 ms 14684 KB ok, no valid answer
12 Correct 102 ms 20012 KB ok, no valid answer
13 Correct 110 ms 19352 KB ok, no valid answer
14 Correct 84 ms 20216 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9292 KB ok, correct split
2 Correct 7 ms 10052 KB ok, no valid answer
3 Correct 7 ms 9292 KB ok, correct split
4 Correct 6 ms 9292 KB ok, correct split
5 Correct 6 ms 9292 KB ok, correct split
6 Correct 6 ms 9292 KB ok, correct split
7 Correct 6 ms 9260 KB ok, correct split
8 Correct 6 ms 9292 KB ok, correct split
9 Correct 8 ms 9548 KB ok, correct split
10 Correct 9 ms 9548 KB ok, correct split
11 Correct 6 ms 9292 KB ok, correct split
12 Correct 9 ms 9548 KB ok, correct split
13 Correct 6 ms 9292 KB ok, correct split
14 Correct 7 ms 9280 KB ok, correct split
15 Correct 6 ms 9312 KB ok, correct split
16 Correct 6 ms 9292 KB ok, correct split
17 Correct 6 ms 9292 KB ok, correct split
18 Correct 6 ms 9292 KB ok, correct split
19 Correct 7 ms 9292 KB ok, correct split
20 Correct 7 ms 9420 KB ok, correct split
21 Correct 8 ms 9548 KB ok, correct split
22 Correct 8 ms 9548 KB ok, correct split
23 Correct 8 ms 9548 KB ok, correct split
24 Correct 8 ms 9548 KB ok, correct split
25 Correct 8 ms 9548 KB ok, correct split
26 Correct 9 ms 10436 KB ok, correct split
27 Correct 9 ms 10436 KB ok, correct split
28 Correct 9 ms 10380 KB ok, correct split
29 Correct 7 ms 10052 KB ok, correct split
30 Correct 8 ms 9532 KB ok, correct split
31 Correct 7 ms 9292 KB ok, correct split
32 Correct 6 ms 9292 KB ok, correct split
33 Correct 6 ms 9292 KB ok, correct split
34 Correct 9 ms 10352 KB ok, correct split
35 Correct 9 ms 10308 KB ok, correct split
36 Correct 9 ms 10308 KB ok, correct split
37 Correct 9 ms 10308 KB ok, correct split
38 Correct 9 ms 10364 KB ok, correct split
39 Correct 10 ms 10436 KB ok, correct split
40 Correct 9 ms 9548 KB ok, correct split
41 Correct 8 ms 9420 KB ok, correct split
42 Correct 9 ms 9420 KB ok, correct split
43 Correct 11 ms 10436 KB ok, correct split
44 Correct 8 ms 9548 KB ok, correct split
45 Correct 9 ms 10308 KB ok, correct split
46 Correct 8 ms 9548 KB ok, correct split
47 Correct 8 ms 10308 KB ok, no valid answer
48 Correct 7 ms 9420 KB ok, correct split
49 Correct 8 ms 9548 KB ok, correct split
50 Correct 6 ms 10052 KB ok, no valid answer
51 Correct 7 ms 10052 KB ok, no valid answer
52 Correct 9 ms 10308 KB ok, no valid answer
53 Correct 9 ms 10308 KB ok, no valid answer
54 Correct 8 ms 10308 KB ok, no valid answer
55 Correct 8 ms 10308 KB ok, no valid answer
56 Correct 10 ms 10308 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9292 KB ok, correct split
2 Correct 7 ms 9292 KB ok, correct split
3 Correct 6 ms 9252 KB ok, correct split
4 Correct 6 ms 9232 KB ok, correct split
5 Correct 6 ms 9292 KB ok, correct split
6 Correct 6 ms 9292 KB ok, correct split
7 Correct 111 ms 23728 KB ok, correct split
8 Correct 138 ms 21992 KB ok, correct split
9 Correct 119 ms 21468 KB ok, correct split
10 Correct 114 ms 24108 KB ok, correct split
11 Correct 128 ms 24160 KB ok, correct split
12 Correct 6 ms 9292 KB ok, correct split
13 Correct 6 ms 9292 KB ok, correct split
14 Correct 7 ms 9292 KB ok, correct split
15 Correct 129 ms 21732 KB ok, correct split
16 Correct 120 ms 18108 KB ok, correct split
17 Correct 138 ms 24040 KB ok, correct split
18 Correct 111 ms 21820 KB ok, correct split
19 Correct 178 ms 19880 KB ok, correct split
20 Correct 107 ms 17892 KB ok, correct split
21 Correct 79 ms 18660 KB ok, correct split
22 Correct 81 ms 18608 KB ok, correct split
23 Correct 84 ms 18648 KB ok, correct split
24 Correct 6 ms 9292 KB ok, correct split
25 Correct 115 ms 18316 KB ok, correct split
26 Correct 39 ms 12684 KB ok, correct split
27 Correct 6 ms 9292 KB ok, correct split
28 Correct 123 ms 19936 KB ok, correct split
29 Correct 114 ms 19668 KB ok, correct split
30 Correct 110 ms 19720 KB ok, correct split
31 Correct 134 ms 20668 KB ok, correct split
32 Correct 145 ms 19424 KB ok, correct split
33 Correct 34 ms 13116 KB ok, no valid answer
34 Correct 49 ms 14684 KB ok, no valid answer
35 Correct 102 ms 20012 KB ok, no valid answer
36 Correct 110 ms 19352 KB ok, no valid answer
37 Correct 84 ms 20216 KB ok, no valid answer
38 Correct 6 ms 9292 KB ok, correct split
39 Correct 7 ms 10052 KB ok, no valid answer
40 Correct 7 ms 9292 KB ok, correct split
41 Correct 6 ms 9292 KB ok, correct split
42 Correct 6 ms 9292 KB ok, correct split
43 Correct 6 ms 9292 KB ok, correct split
44 Correct 6 ms 9260 KB ok, correct split
45 Correct 6 ms 9292 KB ok, correct split
46 Correct 8 ms 9548 KB ok, correct split
47 Correct 9 ms 9548 KB ok, correct split
48 Correct 6 ms 9292 KB ok, correct split
49 Correct 9 ms 9548 KB ok, correct split
50 Correct 6 ms 9292 KB ok, correct split
51 Correct 7 ms 9280 KB ok, correct split
52 Correct 6 ms 9312 KB ok, correct split
53 Correct 6 ms 9292 KB ok, correct split
54 Correct 6 ms 9292 KB ok, correct split
55 Correct 6 ms 9292 KB ok, correct split
56 Correct 7 ms 9292 KB ok, correct split
57 Correct 7 ms 9420 KB ok, correct split
58 Correct 8 ms 9548 KB ok, correct split
59 Correct 8 ms 9548 KB ok, correct split
60 Correct 8 ms 9548 KB ok, correct split
61 Correct 8 ms 9548 KB ok, correct split
62 Correct 8 ms 9548 KB ok, correct split
63 Correct 9 ms 10436 KB ok, correct split
64 Correct 9 ms 10436 KB ok, correct split
65 Correct 9 ms 10380 KB ok, correct split
66 Correct 7 ms 10052 KB ok, correct split
67 Correct 8 ms 9532 KB ok, correct split
68 Correct 7 ms 9292 KB ok, correct split
69 Correct 6 ms 9292 KB ok, correct split
70 Correct 6 ms 9292 KB ok, correct split
71 Correct 9 ms 10352 KB ok, correct split
72 Correct 9 ms 10308 KB ok, correct split
73 Correct 9 ms 10308 KB ok, correct split
74 Correct 9 ms 10308 KB ok, correct split
75 Correct 9 ms 10364 KB ok, correct split
76 Correct 10 ms 10436 KB ok, correct split
77 Correct 9 ms 9548 KB ok, correct split
78 Correct 8 ms 9420 KB ok, correct split
79 Correct 9 ms 9420 KB ok, correct split
80 Correct 11 ms 10436 KB ok, correct split
81 Correct 8 ms 9548 KB ok, correct split
82 Correct 9 ms 10308 KB ok, correct split
83 Correct 8 ms 9548 KB ok, correct split
84 Correct 8 ms 10308 KB ok, no valid answer
85 Correct 7 ms 9420 KB ok, correct split
86 Correct 8 ms 9548 KB ok, correct split
87 Correct 6 ms 10052 KB ok, no valid answer
88 Correct 7 ms 10052 KB ok, no valid answer
89 Correct 9 ms 10308 KB ok, no valid answer
90 Correct 9 ms 10308 KB ok, no valid answer
91 Correct 8 ms 10308 KB ok, no valid answer
92 Correct 8 ms 10308 KB ok, no valid answer
93 Correct 10 ms 10308 KB ok, no valid answer
94 Correct 115 ms 20224 KB ok, correct split
95 Correct 150 ms 23800 KB ok, correct split
96 Correct 163 ms 22732 KB ok, correct split
97 Correct 39 ms 12644 KB ok, correct split
98 Correct 38 ms 12732 KB ok, correct split
99 Correct 55 ms 14188 KB ok, correct split
100 Correct 154 ms 20324 KB ok, correct split
101 Correct 145 ms 19900 KB ok, correct split
102 Correct 121 ms 19456 KB ok, correct split
103 Correct 118 ms 19380 KB ok, correct split
104 Correct 116 ms 20780 KB ok, correct split
105 Correct 68 ms 16172 KB ok, correct split
106 Correct 145 ms 26068 KB ok, correct split
107 Correct 112 ms 19688 KB ok, correct split
108 Correct 113 ms 19644 KB ok, correct split
109 Correct 171 ms 21508 KB ok, correct split
110 Correct 162 ms 22112 KB ok, correct split
111 Correct 151 ms 22120 KB ok, correct split
112 Correct 171 ms 22492 KB ok, correct split
113 Correct 171 ms 22420 KB ok, correct split
114 Correct 17 ms 10508 KB ok, correct split
115 Correct 17 ms 10464 KB ok, correct split
116 Correct 166 ms 22088 KB ok, correct split
117 Correct 148 ms 22096 KB ok, correct split
118 Correct 114 ms 17980 KB ok, correct split
119 Correct 105 ms 17852 KB ok, correct split
120 Correct 111 ms 21216 KB ok, correct split
121 Correct 112 ms 19192 KB ok, no valid answer
122 Correct 102 ms 19556 KB ok, no valid answer
123 Correct 169 ms 21676 KB ok, no valid answer
124 Correct 152 ms 21620 KB ok, no valid answer
125 Correct 106 ms 20584 KB ok, no valid answer
126 Correct 70 ms 19124 KB ok, no valid answer
127 Correct 119 ms 20912 KB ok, no valid answer