oj.uz

답안 #805474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805474 2023-08-03T16:57:55 Z Meloric Split the Attractions (IOI19_split) C++14
100 / 100
 113 ms 19516 KB 
#include <bits/stdc++.h>
#define pb push_back
//#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound
#define debug(x) cerr << "\n" << (#x) << " is " << (x) << endl;

using namespace std;

const int inf = 1e18;

void p(auto A){
	for(auto e : A)cout << e << ' ';
	cout << '\n';
}

struct edge{
	int u, v, use;
	edge(){
		use = 1;
	}
	int f(int a){
		if(a==u)return v;
		else return u;
	}
	array<int, 3> get(){
		return {u, v, use};
	}
};

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
	array<int, 3> col = {1, 2, 3};
	array<int, 3> siz = {a, b, c};
	sort(all(col), [&](int i, int j){return siz[i-1] < siz[j-1];});
	sort(all(siz));
	int m = p.size();
	
	vector<edge>E(m);
	vector<vector<int>> g(n);
	
	for(int i = 0; i< m; i++){
		int u = p[i];
		int v = q[i];
		g[u].pb(i);
		g[v].pb(i);
		E[i].v = v;
		E[i].u = u;
	}
	
	vector<int> vis(n);
	auto dfs1 = [&](auto&& self, int u, int par)->void{
		vis[u] = 1;
		for(auto e : g[u]){
			int v = E[e].f(u);
			if(v==par)continue;
			if(vis[v]){
				E[e].use = 0;
				continue;
			}
			self(self, v, u);
		}
	};
	dfs1(dfs1, 0, 0);
	
	vector<int> sz(n, 1);
	auto dfs2 = [&](auto&& self, int u, int par)->int{
		int ret = -1;
		int flag = 1;
		for(auto e : g[u])if(E[e].use){
			int v = E[e].f(u);
			if(v==par)continue;
			ret = max(ret, self(self, v, u));
			sz[u]+=sz[v];
			if(sz[v] > n/2)flag = 0;
		}
		if(n-sz[u] > n/2)flag = 0;
		if(flag)ret = u;
		return ret;
	};
	
	int root = dfs2(dfs2, 0, 0);
	
	//debug(root);
	
	vector<int>P(n, -1);
	
	auto find = [&](int u)->int{
		while(P[u] >= 0)u = P[u];
		return u;
	};
	
	int start = -1;
	
	for(int i = 0; i< n; i++)if(i != root && -P[i] >= siz[0])start = i;
	if(start ==-1)for(auto e : E){
		auto [u, v, use] = e.get();
		if(!use)continue;
		if(u == root)continue;
		if(v == root)continue;
		u = find(u);
		v = find(v);
		if(u == v)continue;
		if(P[u] > P[v])swap(u, v);
		P[u]+=P[v];
		P[v] = u;			
		if(-P[u] >= siz[0])start = u;
	}
	
	if(start == -1)for(auto& e : E){
			auto [u, v, use] = e.get();
			if(use)continue;
			if(u==root)continue;
			if(v==root)continue;
			u=find(u);
			v=find(v);
			if(u==v)continue;
			e.use = 1;
			if(P[u]>P[v])swap(u, v);
			P[u]+=P[v];
			P[v]=u;
			if(-P[u] >= siz[0])start = u;
	}
	
	vector<int>out(n);
	if(start == -1){
		return out;
	}

	if(-P[start] >= siz[1]){
		swap(col[0], col[1]);
		swap(siz[0], siz[1]);
	}
	
	vector<int>st;
	st.pb(start);
	while(siz[0]){
		assert(st.size());
		int u = st.back();
		st.pop_back();
		if(u == root)continue;
		if(out[u])continue;
		siz[0]--;
		out[u] = col[0];
		for(auto e : g[u])if(E[e].use)st.pb(E[e].f(u));
	}
	st.clear();
	st.pb(root);
	while(siz[1]){
		assert(st.size());
		int u = st.back();
		st.pop_back();
		if(out[u])continue;
		siz[1]--;
		out[u] = col[1];
		for(auto e : g[u])st.pb(E[e].f(u));
	}
	for(auto& e : out)if(!e)e=col[2];
	return out;
}
/*
void solve(){
	int n, m; cin >> n >> m;
	int a, b, c; cin >> a >> b >> c;
	vector<int>P(m), Q(m);
	for(int i = 0; i< m; i++)cin >> P[i] >> Q[i];
	vector<int> ans = find_split(n, a, b, c, P, Q);
	for(auto e : ans)cout << e << ' ';
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t = 1;
	//cin >> t;
	while(t--)solve();
}
*/

Compilation message

split.cpp:14:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const int inf = 1e18;
      |                 ^~~~
split.cpp:16:8: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   16 | void p(auto A){
      |        ^~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:100:8: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  100 |   auto [u, v, use] = e.get();
      |        ^
split.cpp:114:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  114 |    auto [u, v, use] = e.get();
      |         ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 59 ms 14652 KB ok, correct split
8 Correct 50 ms 13132 KB ok, correct split
9 Correct 55 ms 12840 KB ok, correct split
10 Correct 52 ms 14668 KB ok, correct split
11 Correct 59 ms 14972 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 73 ms 13896 KB ok, correct split
5 Correct 47 ms 10184 KB ok, correct split
6 Correct 50 ms 14676 KB ok, correct split
7 Correct 53 ms 13164 KB ok, correct split
8 Correct 104 ms 13388 KB ok, correct split
9 Correct 50 ms 10060 KB ok, correct split
10 Correct 42 ms 11244 KB ok, correct split
11 Correct 37 ms 11252 KB ok, correct split
12 Correct 36 ms 11148 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 48 ms 10164 KB ok, correct split
3 Correct 18 ms 4180 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 55 ms 11720 KB ok, correct split
6 Correct 60 ms 11472 KB ok, correct split
7 Correct 55 ms 11384 KB ok, correct split
8 Correct 54 ms 12236 KB ok, correct split
9 Correct 55 ms 11360 KB ok, correct split
10 Correct 15 ms 3624 KB ok, no valid answer
11 Correct 22 ms 5204 KB ok, no valid answer
12 Correct 46 ms 10472 KB ok, no valid answer
13 Correct 55 ms 10196 KB ok, no valid answer
14 Correct 35 ms 10396 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ok, correct split
2 Correct 0 ms 212 KB ok, correct split
3 Correct 0 ms 212 KB ok, correct split
4 Correct 0 ms 212 KB ok, correct split
5 Correct 0 ms 212 KB ok, correct split
6 Correct 0 ms 212 KB ok, correct split
7 Correct 59 ms 14652 KB ok, correct split
8 Correct 50 ms 13132 KB ok, correct split
9 Correct 55 ms 12840 KB ok, correct split
10 Correct 52 ms 14668 KB ok, correct split
11 Correct 59 ms 14972 KB ok, correct split
12 Correct 0 ms 212 KB ok, correct split
13 Correct 0 ms 212 KB ok, correct split
14 Correct 0 ms 212 KB ok, correct split
15 Correct 73 ms 13896 KB ok, correct split
16 Correct 47 ms 10184 KB ok, correct split
17 Correct 50 ms 14676 KB ok, correct split
18 Correct 53 ms 13164 KB ok, correct split
19 Correct 104 ms 13388 KB ok, correct split
20 Correct 50 ms 10060 KB ok, correct split
21 Correct 42 ms 11244 KB ok, correct split
22 Correct 37 ms 11252 KB ok, correct split
23 Correct 36 ms 11148 KB ok, correct split
24 Correct 0 ms 212 KB ok, correct split
25 Correct 48 ms 10164 KB ok, correct split
26 Correct 18 ms 4180 KB ok, correct split
27 Correct 0 ms 212 KB ok, correct split
28 Correct 55 ms 11720 KB ok, correct split
29 Correct 60 ms 11472 KB ok, correct split
30 Correct 55 ms 11384 KB ok, correct split
31 Correct 54 ms 12236 KB ok, correct split
32 Correct 55 ms 11360 KB ok, correct split
33 Correct 15 ms 3624 KB ok, no valid answer
34 Correct 22 ms 5204 KB ok, no valid answer
35 Correct 46 ms 10472 KB ok, no valid answer
36 Correct 55 ms 10196 KB ok, no valid answer
37 Correct 35 ms 10396 KB ok, no valid answer
38 Correct 1 ms 212 KB ok, correct split
39 Correct 0 ms 212 KB ok, no valid answer
40 Correct 1 ms 212 KB ok, correct split
41 Correct 1 ms 212 KB ok, correct split
42 Correct 0 ms 212 KB ok, correct split
43 Correct 0 ms 212 KB ok, correct split
44 Correct 0 ms 276 KB ok, correct split
45 Correct 0 ms 212 KB ok, correct split
46 Correct 2 ms 596 KB ok, correct split
47 Correct 2 ms 596 KB ok, correct split
48 Correct 0 ms 212 KB ok, correct split
49 Correct 2 ms 596 KB ok, correct split
50 Correct 0 ms 212 KB ok, correct split
51 Correct 0 ms 212 KB ok, correct split
52 Correct 0 ms 212 KB ok, correct split
53 Correct 0 ms 212 KB ok, correct split
54 Correct 0 ms 212 KB ok, correct split
55 Correct 0 ms 212 KB ok, correct split
56 Correct 1 ms 340 KB ok, correct split
57 Correct 1 ms 340 KB ok, correct split
58 Correct 2 ms 468 KB ok, correct split
59 Correct 1 ms 468 KB ok, correct split
60 Correct 1 ms 596 KB ok, correct split
61 Correct 1 ms 580 KB ok, correct split
62 Correct 1 ms 468 KB ok, correct split
63 Correct 2 ms 596 KB ok, correct split
64 Correct 2 ms 632 KB ok, correct split
65 Correct 2 ms 596 KB ok, correct split
66 Correct 1 ms 212 KB ok, correct split
67 Correct 2 ms 596 KB ok, correct split
68 Correct 1 ms 340 KB ok, correct split
69 Correct 1 ms 212 KB ok, correct split
70 Correct 1 ms 340 KB ok, correct split
71 Correct 1 ms 596 KB ok, correct split
72 Correct 2 ms 596 KB ok, correct split
73 Correct 1 ms 468 KB ok, correct split
74 Correct 3 ms 596 KB ok, correct split
75 Correct 2 ms 696 KB ok, correct split
76 Correct 2 ms 564 KB ok, correct split
77 Correct 2 ms 596 KB ok, correct split
78 Correct 1 ms 468 KB ok, correct split
79 Correct 1 ms 468 KB ok, correct split
80 Correct 2 ms 596 KB ok, correct split
81 Correct 2 ms 596 KB ok, correct split
82 Correct 3 ms 596 KB ok, correct split
83 Correct 1 ms 596 KB ok, correct split
84 Correct 1 ms 596 KB ok, no valid answer
85 Correct 1 ms 596 KB ok, correct split
86 Correct 1 ms 596 KB ok, correct split
87 Correct 1 ms 212 KB ok, no valid answer
88 Correct 1 ms 256 KB ok, no valid answer
89 Correct 1 ms 468 KB ok, no valid answer
90 Correct 2 ms 596 KB ok, no valid answer
91 Correct 1 ms 468 KB ok, no valid answer
92 Correct 2 ms 596 KB ok, no valid answer
93 Correct 2 ms 596 KB ok, no valid answer
94 Correct 61 ms 13640 KB ok, correct split
95 Correct 89 ms 19516 KB ok, correct split
96 Correct 77 ms 17368 KB ok, correct split
97 Correct 19 ms 4692 KB ok, correct split
98 Correct 20 ms 4820 KB ok, correct split
99 Correct 41 ms 8020 KB ok, correct split
100 Correct 93 ms 16452 KB ok, correct split
101 Correct 72 ms 14796 KB ok, correct split
102 Correct 68 ms 15044 KB ok, correct split
103 Correct 62 ms 14736 KB ok, correct split
104 Correct 65 ms 16648 KB ok, correct split
105 Correct 30 ms 7212 KB ok, correct split
106 Correct 68 ms 16692 KB ok, correct split
107 Correct 49 ms 11320 KB ok, correct split
108 Correct 50 ms 11320 KB ok, correct split
109 Correct 84 ms 15612 KB ok, correct split
110 Correct 84 ms 15524 KB ok, correct split
111 Correct 87 ms 15600 KB ok, correct split
112 Correct 113 ms 15848 KB ok, correct split
113 Correct 83 ms 15812 KB ok, correct split
114 Correct 9 ms 2260 KB ok, correct split
115 Correct 10 ms 1936 KB ok, correct split
116 Correct 78 ms 15408 KB ok, correct split
117 Correct 105 ms 15300 KB ok, correct split
118 Correct 53 ms 11296 KB ok, correct split
119 Correct 52 ms 11252 KB ok, correct split
120 Correct 55 ms 13856 KB ok, correct split
121 Correct 47 ms 11360 KB ok, no valid answer
122 Correct 44 ms 11300 KB ok, no valid answer
123 Correct 84 ms 16436 KB ok, no valid answer
124 Correct 85 ms 16340 KB ok, no valid answer
125 Correct 49 ms 12684 KB ok, no valid answer
126 Correct 32 ms 10428 KB ok, no valid answer
127 Correct 52 ms 13508 KB ok, no valid answer