oj.uz

Submission #545831

# Submission time Handle Problem Language Result Execution time Memory
545831 2022-04-05T14:16:21 Z HappyPacMan Split the Attractions (IOI19_split) C++14
100 / 100
 147 ms 33672 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 2;
vector<pair<int,int> > color;
vector<int> adj[maxn],adjTree[maxn],sack[maxn],res;
bool vis[maxn];
int N,M,A,B,C,subSize[maxn],par[maxn],centroid;

void dfsTree(int u){
    bool isCentroid = true;
    vis[u] = true;
    subSize[u] = 1;
    for(int v : adj[u]){
        if(!vis[v]){
            dfsTree(v);
            subSize[u] += subSize[v];
            if(subSize[v] > N/2){
                isCentroid = false;
            }
            adjTree[u].push_back(v);
            adjTree[v].push_back(u);
        }
    }
    if(isCentroid && N-subSize[u] <= N/2){
        centroid = u;
    }
}
void dfsLow(int u,int c){
    if(A == 0) return;
    res[u] = c;
    A--;
    for(int v : adj[u]){
        if(par[v] == par[u] && !res[v]){
            dfsLow(v,c);
        }
    }
}
void dfsMid(int u,int c){
    if(B == 0) return;
    res[u] = c;
    B--;
    for(int v : adj[u]){
        if(!res[v]){
            dfsMid(v,c);
        }
    }
}

vector<int> find_split(int n,int a,int b,int c,vector<int> p,vector<int> q){
    N = n,M = p.size();
    for(int i=0;i<M;i++){
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }
    for(int i=0;i<N;i++){
        par[i] = i;
        sack[i].push_back(i);
    }
	color = {{a,1},{b,2},{c,3}};
	sort(color.begin(),color.end());
	A = color[0].first,B = color[1].first,C = color[2].first;
	res = vector<int>(N);
	dfsTree(0);
	for(int i=0;i<N;i++){
	    if(i != centroid){
	        for(int j : adjTree[i]){
	            if(j != centroid && par[i] != par[j]){
	                if(sack[par[i]].size() > sack[par[j]].size()){
	                    int idx = par[j];
	                    for(int it : sack[idx]){
	                        par[it] = par[i];
	                        sack[par[i]].push_back(it);
	                    }
	                    sack[idx].clear();
	                }else{
	                    int idx = par[i];
	                    for(int it : sack[idx]){
	                        par[it] = par[j];
	                        sack[par[j]].push_back(it);
	                    }
	                    sack[idx].clear();
	                }
	            }
	        }
            if(sack[par[i]].size() >= A){
                dfsLow(par[i],color[0].second);
                dfsMid(centroid,color[1].second);
                for(int &it : res) if(!it) it = color[2].second;
                return res;
            }
	    }
	}
	for(int i=0;i<N;i++){
	    if(i != centroid){
	        for(int j : adj[i]){
	            if(j != centroid && par[i] != par[j]){
	                if(sack[par[i]].size() > sack[par[j]].size()){
	                    int idx = par[j];
	                    for(int it : sack[idx]){
	                        par[it] = par[i];
	                        sack[par[i]].push_back(it);
	                    }
	                    sack[idx].clear();
	                }else{
	                    int idx = par[i];
	                    for(int it : sack[idx]){
	                        par[it] = par[j];
	                        sack[par[j]].push_back(it);
	                    }
	                    sack[idx].clear();
	                }
	            }
	        }
            if(sack[par[i]].size() >= A){
                dfsLow(par[i],color[0].second);
                dfsMid(centroid,color[1].second);
                for(int &it : res) if(!it) it = color[2].second;
                return res;
            }
	    }
	}
	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:86:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |             if(sack[par[i]].size() >= A){
      |                ~~~~~~~~~~~~~~~~~~~~^~~~
split.cpp:115:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  115 |             if(sack[par[i]].size() >= A){
      |                ~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 4 ms 7252 KB ok, correct split
3 Correct 4 ms 7252 KB ok, correct split
4 Correct 4 ms 7252 KB ok, correct split
5 Correct 4 ms 7252 KB ok, correct split
6 Correct 4 ms 7296 KB ok, correct split
7 Correct 122 ms 33208 KB ok, correct split
8 Correct 82 ms 27340 KB ok, correct split
9 Correct 97 ms 26432 KB ok, correct split
10 Correct 89 ms 30528 KB ok, correct split
11 Correct 113 ms 33672 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 4 ms 7252 KB ok, correct split
3 Correct 4 ms 7252 KB ok, correct split
4 Correct 101 ms 25248 KB ok, correct split
5 Correct 86 ms 20272 KB ok, correct split
6 Correct 88 ms 29252 KB ok, correct split
7 Correct 88 ms 25928 KB ok, correct split
8 Correct 108 ms 21876 KB ok, correct split
9 Correct 89 ms 20044 KB ok, correct split
10 Correct 64 ms 20728 KB ok, correct split
11 Correct 59 ms 20708 KB ok, correct split
12 Correct 60 ms 20676 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7352 KB ok, correct split
2 Correct 110 ms 21352 KB ok, correct split
3 Correct 32 ms 12884 KB ok, correct split
4 Correct 6 ms 7356 KB ok, correct split
5 Correct 124 ms 27468 KB ok, correct split
6 Correct 115 ms 26964 KB ok, correct split
7 Correct 113 ms 27124 KB ok, correct split
8 Correct 131 ms 28720 KB ok, correct split
9 Correct 117 ms 26728 KB ok, correct split
10 Correct 32 ms 12272 KB ok, no valid answer
11 Correct 54 ms 14668 KB ok, no valid answer
12 Correct 90 ms 22060 KB ok, no valid answer
13 Correct 105 ms 22704 KB ok, no valid answer
14 Correct 63 ms 21812 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB ok, correct split
2 Correct 3 ms 7252 KB ok, no valid answer
3 Correct 3 ms 7252 KB ok, correct split
4 Correct 3 ms 7252 KB ok, correct split
5 Correct 4 ms 7252 KB ok, correct split
6 Correct 4 ms 7252 KB ok, correct split
7 Correct 4 ms 7252 KB ok, correct split
8 Correct 4 ms 7332 KB ok, correct split
9 Correct 6 ms 7764 KB ok, correct split
10 Correct 6 ms 7764 KB ok, correct split
11 Correct 5 ms 7380 KB ok, correct split
12 Correct 6 ms 7748 KB ok, correct split
13 Correct 4 ms 7360 KB ok, correct split
14 Correct 4 ms 7252 KB ok, correct split
15 Correct 4 ms 7252 KB ok, correct split
16 Correct 4 ms 7252 KB ok, correct split
17 Correct 5 ms 7352 KB ok, correct split
18 Correct 4 ms 7252 KB ok, correct split
19 Correct 4 ms 7356 KB ok, correct split
20 Correct 5 ms 7508 KB ok, correct split
21 Correct 6 ms 7756 KB ok, correct split
22 Correct 6 ms 7748 KB ok, correct split
23 Correct 6 ms 7764 KB ok, correct split
24 Correct 6 ms 7764 KB ok, correct split
25 Correct 7 ms 7764 KB ok, correct split
26 Correct 5 ms 7764 KB ok, correct split
27 Correct 8 ms 7748 KB ok, correct split
28 Correct 6 ms 7684 KB ok, correct split
29 Correct 4 ms 7380 KB ok, correct split
30 Correct 6 ms 7744 KB ok, correct split
31 Correct 4 ms 7380 KB ok, correct split
32 Correct 4 ms 7380 KB ok, correct split
33 Correct 4 ms 7380 KB ok, correct split
34 Correct 6 ms 7620 KB ok, correct split
35 Correct 6 ms 7764 KB ok, correct split
36 Correct 6 ms 7636 KB ok, correct split
37 Correct 6 ms 7744 KB ok, correct split
38 Correct 6 ms 7764 KB ok, correct split
39 Correct 6 ms 7764 KB ok, correct split
40 Correct 9 ms 7880 KB ok, correct split
41 Correct 5 ms 7496 KB ok, correct split
42 Correct 5 ms 7508 KB ok, correct split
43 Correct 6 ms 7764 KB ok, correct split
44 Correct 6 ms 7764 KB ok, correct split
45 Correct 6 ms 7764 KB ok, correct split
46 Correct 6 ms 7764 KB ok, correct split
47 Correct 6 ms 7792 KB ok, no valid answer
48 Correct 6 ms 7668 KB ok, correct split
49 Correct 6 ms 7764 KB ok, correct split
50 Correct 4 ms 7348 KB ok, no valid answer
51 Correct 4 ms 7296 KB ok, no valid answer
52 Correct 5 ms 7636 KB ok, no valid answer
53 Correct 8 ms 7748 KB ok, no valid answer
54 Correct 6 ms 7620 KB ok, no valid answer
55 Correct 6 ms 7636 KB ok, no valid answer
56 Correct 5 ms 7636 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB ok, correct split
2 Correct 4 ms 7252 KB ok, correct split
3 Correct 4 ms 7252 KB ok, correct split
4 Correct 4 ms 7252 KB ok, correct split
5 Correct 4 ms 7252 KB ok, correct split
6 Correct 4 ms 7296 KB ok, correct split
7 Correct 122 ms 33208 KB ok, correct split
8 Correct 82 ms 27340 KB ok, correct split
9 Correct 97 ms 26432 KB ok, correct split
10 Correct 89 ms 30528 KB ok, correct split
11 Correct 113 ms 33672 KB ok, correct split
12 Correct 4 ms 7252 KB ok, correct split
13 Correct 4 ms 7252 KB ok, correct split
14 Correct 4 ms 7252 KB ok, correct split
15 Correct 101 ms 25248 KB ok, correct split
16 Correct 86 ms 20272 KB ok, correct split
17 Correct 88 ms 29252 KB ok, correct split
18 Correct 88 ms 25928 KB ok, correct split
19 Correct 108 ms 21876 KB ok, correct split
20 Correct 89 ms 20044 KB ok, correct split
21 Correct 64 ms 20728 KB ok, correct split
22 Correct 59 ms 20708 KB ok, correct split
23 Correct 60 ms 20676 KB ok, correct split
24 Correct 4 ms 7352 KB ok, correct split
25 Correct 110 ms 21352 KB ok, correct split
26 Correct 32 ms 12884 KB ok, correct split
27 Correct 6 ms 7356 KB ok, correct split
28 Correct 124 ms 27468 KB ok, correct split
29 Correct 115 ms 26964 KB ok, correct split
30 Correct 113 ms 27124 KB ok, correct split
31 Correct 131 ms 28720 KB ok, correct split
32 Correct 117 ms 26728 KB ok, correct split
33 Correct 32 ms 12272 KB ok, no valid answer
34 Correct 54 ms 14668 KB ok, no valid answer
35 Correct 90 ms 22060 KB ok, no valid answer
36 Correct 105 ms 22704 KB ok, no valid answer
37 Correct 63 ms 21812 KB ok, no valid answer
38 Correct 4 ms 7380 KB ok, correct split
39 Correct 3 ms 7252 KB ok, no valid answer
40 Correct 3 ms 7252 KB ok, correct split
41 Correct 3 ms 7252 KB ok, correct split
42 Correct 4 ms 7252 KB ok, correct split
43 Correct 4 ms 7252 KB ok, correct split
44 Correct 4 ms 7252 KB ok, correct split
45 Correct 4 ms 7332 KB ok, correct split
46 Correct 6 ms 7764 KB ok, correct split
47 Correct 6 ms 7764 KB ok, correct split
48 Correct 5 ms 7380 KB ok, correct split
49 Correct 6 ms 7748 KB ok, correct split
50 Correct 4 ms 7360 KB ok, correct split
51 Correct 4 ms 7252 KB ok, correct split
52 Correct 4 ms 7252 KB ok, correct split
53 Correct 4 ms 7252 KB ok, correct split
54 Correct 5 ms 7352 KB ok, correct split
55 Correct 4 ms 7252 KB ok, correct split
56 Correct 4 ms 7356 KB ok, correct split
57 Correct 5 ms 7508 KB ok, correct split
58 Correct 6 ms 7756 KB ok, correct split
59 Correct 6 ms 7748 KB ok, correct split
60 Correct 6 ms 7764 KB ok, correct split
61 Correct 6 ms 7764 KB ok, correct split
62 Correct 7 ms 7764 KB ok, correct split
63 Correct 5 ms 7764 KB ok, correct split
64 Correct 8 ms 7748 KB ok, correct split
65 Correct 6 ms 7684 KB ok, correct split
66 Correct 4 ms 7380 KB ok, correct split
67 Correct 6 ms 7744 KB ok, correct split
68 Correct 4 ms 7380 KB ok, correct split
69 Correct 4 ms 7380 KB ok, correct split
70 Correct 4 ms 7380 KB ok, correct split
71 Correct 6 ms 7620 KB ok, correct split
72 Correct 6 ms 7764 KB ok, correct split
73 Correct 6 ms 7636 KB ok, correct split
74 Correct 6 ms 7744 KB ok, correct split
75 Correct 6 ms 7764 KB ok, correct split
76 Correct 6 ms 7764 KB ok, correct split
77 Correct 9 ms 7880 KB ok, correct split
78 Correct 5 ms 7496 KB ok, correct split
79 Correct 5 ms 7508 KB ok, correct split
80 Correct 6 ms 7764 KB ok, correct split
81 Correct 6 ms 7764 KB ok, correct split
82 Correct 6 ms 7764 KB ok, correct split
83 Correct 6 ms 7764 KB ok, correct split
84 Correct 6 ms 7792 KB ok, no valid answer
85 Correct 6 ms 7668 KB ok, correct split
86 Correct 6 ms 7764 KB ok, correct split
87 Correct 4 ms 7348 KB ok, no valid answer
88 Correct 4 ms 7296 KB ok, no valid answer
89 Correct 5 ms 7636 KB ok, no valid answer
90 Correct 8 ms 7748 KB ok, no valid answer
91 Correct 6 ms 7620 KB ok, no valid answer
92 Correct 6 ms 7636 KB ok, no valid answer
93 Correct 5 ms 7636 KB ok, no valid answer
94 Correct 134 ms 27084 KB ok, correct split
95 Correct 147 ms 32844 KB ok, correct split
96 Correct 140 ms 31056 KB ok, correct split
97 Correct 33 ms 12904 KB ok, correct split
98 Correct 31 ms 13004 KB ok, correct split
99 Correct 49 ms 15940 KB ok, correct split
100 Correct 132 ms 26832 KB ok, correct split
101 Correct 140 ms 25688 KB ok, correct split
102 Correct 109 ms 23492 KB ok, correct split
103 Correct 119 ms 23348 KB ok, correct split
104 Correct 101 ms 25364 KB ok, correct split
105 Correct 61 ms 16692 KB ok, correct split
106 Correct 105 ms 25376 KB ok, correct split
107 Correct 104 ms 22600 KB ok, correct split
108 Correct 115 ms 22696 KB ok, correct split
109 Correct 141 ms 25796 KB ok, correct split
110 Correct 136 ms 26052 KB ok, correct split
111 Correct 138 ms 26820 KB ok, correct split
112 Correct 144 ms 25940 KB ok, correct split
113 Correct 136 ms 25940 KB ok, correct split
114 Correct 14 ms 9688 KB ok, correct split
115 Correct 14 ms 9324 KB ok, correct split
116 Correct 126 ms 25664 KB ok, correct split
117 Correct 128 ms 26316 KB ok, correct split
118 Correct 119 ms 23496 KB ok, correct split
119 Correct 112 ms 22976 KB ok, correct split
120 Correct 132 ms 29232 KB ok, correct split
121 Correct 102 ms 22256 KB ok, no valid answer
122 Correct 99 ms 22592 KB ok, no valid answer
123 Correct 141 ms 27600 KB ok, no valid answer
124 Correct 143 ms 27184 KB ok, no valid answer
125 Correct 94 ms 22676 KB ok, no valid answer
126 Correct 56 ms 20452 KB ok, no valid answer
127 Correct 107 ms 22964 KB ok, no valid answer