oj.uz

답안 #143990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143990 2019-08-15T14:48:36 Z sasa Split the Attractions (IOI19_split) C++14
100 / 100
 658 ms 54972 KB 
#include "split.h"
#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <deque>
#include <assert.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <math.h>
#include <bitset>
#include <iomanip>
#include <complex>
using namespace std;
//#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long double ld;
typedef long long ll;
#define X first
#define Y second
#define all(o) o.begin(), o.end()
#define endl '\n'
using namespace std;
const int maxn = 2e5 + 10;
vi adj[maxn], tree[maxn], oth[maxn];
vi g[maxn];
 
int num[3], ans[maxn], sz[maxn], comp[maxn];
bool mark[maxn];
map<pii,bool> mp;
void dfs(int v){
	mark[v] = 1;
	for(auto u : adj[v]){
		if(!mark[u]){
			tree[v].push_back(u);
			tree[u].push_back(v);
			mp[{u, v}] = mp[{v, u}] = 1;
			dfs(u);
		}
		else if(mp.count({u, v}) == 0){
			oth[u].push_back(v);
			oth[v].push_back(u);
		}
	}
}
bool markTree[maxn];
void dfs_tree(int v,int root){
	sz[v] = 1;
	if(v == root){
		memset(markTree, 0, sizeof markTree);
		comp[v] = -1;
	}
	if(markTree[v])
		return;
	markTree[v] = 1;
	for(auto u : tree[v]){
		if(markTree[u])
			continue;
		if(v == root)
			comp[u] = u;
		else
			comp[u] = comp[v];
		dfs_tree(u, root);
		sz[v] += sz[u];
	}
}
int Rem;
void dfs_g(int v){
	if(mark[v] || Rem <= 0)
		return;
	mark[v] = 1;
	Rem -= sz[v];
	if(Rem <= 0) return;
	for(auto u : g[v])
		dfs_g(u);
 
}
int answer[maxn];
int rems = 0;
vi seen;
void dfs_ok(int v,int col){
	if(mark[v] || ans[v] != col || rems <= 0)
		return;
	rems--;
	answer[v] = col;
	mark[v] = 1;
	if(col == 2)
		seen.push_back(v);
	for(auto u : adj[v])
		dfs_ok(u, col);
}
bool dead = false;
void make_ok(int n,int root){
	for(int i=0; i<n; i++)
		answer[i] = 3;
	rems = num[0];
	memset(mark, 0, sizeof mark);
	for(int i=0; i<n; i++)
		if(ans[i] == 1){
			dfs_ok(i, 1);
			break;
		}
	rems = num[1];
	memset(mark, 0, sizeof mark);
	dfs_ok(root, 2);
}
vector<int> find_split(int n, int a1, int b1, int c1, vector<int> from, vector<int> to) {
	int m = from.size();
	num[0] = a1, num[1] = b1, num[2] = c1;
	sort(num, num + 3);
	
	for(int i=0; i<m; i++){
		int u = from[i], v = to[i];
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(0);
	dfs_tree(0, 0);
	int root = 0;
	while(1){
		int bef = root;
		for(auto u : tree[root]){
			if(sz[u] > n/2 && sz[u] < sz[root])
				root = u;
		}
		if(bef == root)
			break;
	}
	memset(sz, 0, sizeof sz);
	dfs_tree(root, root);
	bool can = true;
	if(m == n - 1){
		can = false;
		for(auto u : tree[root]){
			if(sz[u] >= num[0]){
				for(int i=0; i<n; i++)
					ans[i] = (comp[i] == u ? 1 : 2);
				can = true;
				break;
			}
		}
		make_ok(n, root);
	}
	else{
		for(int i=0; i<n; i++){
			for(auto j : oth[i]){
				if(j != root && i != root){
					int u = comp[i];
					int v = comp[j];
					if(u != v){
						g[u].push_back(v);
					}
				}
			}
		}
		can = false;
		for(auto u : tree[root]){
			if(sz[u] >= num[0]){
				for(int i=0; i<n; i++)
					ans[i] = (comp[i] == u ? 1 : 2);
				can = true;
				break;
			}
		}
		if(!can){
			can = false;
			memset(mark, 0, sizeof mark);
			for(auto u : tree[root]){
				Rem = num[0];
				dfs_g(u);
				if(Rem <= 0){
					can = true;
					break;
				}
			}
			if(can){
				for(int i=0; i<n; i++){
					if(i != root && mark[comp[i]])
						ans[i] = 1;
					else
						ans[i] = 2;
				}
			}
			
		}
		make_ok(n, root);
	}/*
	cout << "CAN" << can << endl;
	for(int i=0; i<n; i++)
		cout << answer[i] << " ";
	cout << endl;*/
	pii per[3];
	per[0] = {a1, 1};
	per[1] = {b1, 2};
	per[2] = {c1, 3};
	sort(per, per + 3);
	vi res;
	res.resize(n);
	if(can && !dead){
		for(int i=0; i<n; i++)
			res[i] = per[answer[i] - 1].Y;
	}
	return res;
}
/*
int main(){
	int n, m;
	cin >> n >> m;
	int a1, b1, c1;
	cin >> a1 >> b1 >> c1;
	vi fr, to;
	for(int i=0; i<m; i++){
		int x, y;
		cin >> x >> y;
		fr.push_back(x);
		to.push_back(y);
	}
	vi res = find_split(n, a1, b1, c1, fr, to);
	for(auto t : res)
		cout << t << " ";
	cout << endl;
}*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 20216 KB ok, correct split
2 Correct 20 ms 20348 KB ok, correct split
3 Correct 20 ms 20216 KB ok, correct split
4 Correct 25 ms 20344 KB ok, correct split
5 Correct 24 ms 20344 KB ok, correct split
6 Correct 21 ms 20344 KB ok, correct split
7 Correct 409 ms 51392 KB ok, correct split
8 Correct 435 ms 48648 KB ok, correct split
9 Correct 376 ms 47932 KB ok, correct split
10 Correct 372 ms 51704 KB ok, correct split
11 Correct 388 ms 51964 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 20216 KB ok, correct split
2 Correct 20 ms 20216 KB ok, correct split
3 Correct 21 ms 20312 KB ok, correct split
4 Correct 503 ms 50204 KB ok, correct split
5 Correct 327 ms 42744 KB ok, correct split
6 Correct 376 ms 51556 KB ok, correct split
7 Correct 372 ms 48636 KB ok, correct split
8 Correct 480 ms 47736 KB ok, correct split
9 Correct 352 ms 42612 KB ok, correct split
10 Correct 291 ms 43508 KB ok, correct split
11 Correct 280 ms 43556 KB ok, correct split
12 Correct 302 ms 43504 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 20216 KB ok, correct split
2 Correct 328 ms 42720 KB ok, correct split
3 Correct 122 ms 29256 KB ok, correct split
4 Correct 20 ms 20344 KB ok, correct split
5 Correct 381 ms 45656 KB ok, correct split
6 Correct 369 ms 45344 KB ok, correct split
7 Correct 368 ms 45044 KB ok, correct split
8 Correct 372 ms 46708 KB ok, correct split
9 Correct 384 ms 44916 KB ok, correct split
10 Correct 95 ms 27640 KB ok, no valid answer
11 Correct 152 ms 31192 KB ok, no valid answer
12 Correct 318 ms 42484 KB ok, no valid answer
13 Correct 351 ms 42200 KB ok, no valid answer
14 Correct 286 ms 42608 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 20216 KB ok, correct split
2 Correct 20 ms 20344 KB ok, no valid answer
3 Correct 21 ms 20316 KB ok, correct split
4 Correct 21 ms 20316 KB ok, correct split
5 Correct 20 ms 20344 KB ok, correct split
6 Correct 20 ms 20344 KB ok, correct split
7 Correct 20 ms 20344 KB ok, correct split
8 Correct 21 ms 20344 KB ok, correct split
9 Correct 27 ms 20984 KB ok, correct split
10 Correct 26 ms 20984 KB ok, correct split
11 Correct 20 ms 20344 KB ok, correct split
12 Correct 26 ms 20984 KB ok, correct split
13 Correct 20 ms 20344 KB ok, correct split
14 Correct 20 ms 20344 KB ok, correct split
15 Correct 20 ms 20316 KB ok, correct split
16 Correct 21 ms 20344 KB ok, correct split
17 Correct 20 ms 20344 KB ok, correct split
18 Correct 21 ms 20344 KB ok, correct split
19 Correct 21 ms 20472 KB ok, correct split
20 Correct 22 ms 20600 KB ok, correct split
21 Correct 25 ms 20984 KB ok, correct split
22 Correct 25 ms 20984 KB ok, correct split
23 Correct 24 ms 20984 KB ok, correct split
24 Correct 25 ms 20988 KB ok, correct split
25 Correct 24 ms 20856 KB ok, correct split
26 Correct 26 ms 21112 KB ok, correct split
27 Correct 26 ms 21112 KB ok, correct split
28 Correct 26 ms 20984 KB ok, correct split
29 Correct 20 ms 20344 KB ok, correct split
30 Correct 26 ms 21112 KB ok, correct split
31 Correct 21 ms 20472 KB ok, correct split
32 Correct 20 ms 20344 KB ok, correct split
33 Correct 21 ms 20348 KB ok, correct split
34 Correct 25 ms 20984 KB ok, correct split
35 Correct 25 ms 20984 KB ok, correct split
36 Correct 24 ms 20856 KB ok, correct split
37 Correct 26 ms 20984 KB ok, correct split
38 Correct 26 ms 21112 KB ok, correct split
39 Correct 27 ms 21112 KB ok, correct split
40 Correct 26 ms 20984 KB ok, correct split
41 Correct 23 ms 20728 KB ok, correct split
42 Correct 23 ms 20600 KB ok, correct split
43 Correct 26 ms 21112 KB ok, correct split
44 Correct 26 ms 20984 KB ok, correct split
45 Correct 27 ms 20988 KB ok, correct split
46 Correct 25 ms 20984 KB ok, correct split
47 Correct 24 ms 20856 KB ok, no valid answer
48 Correct 24 ms 20856 KB ok, correct split
49 Correct 25 ms 20956 KB ok, correct split
50 Correct 21 ms 20344 KB ok, no valid answer
51 Correct 20 ms 20344 KB ok, no valid answer
52 Correct 27 ms 20856 KB ok, no valid answer
53 Correct 33 ms 20984 KB ok, no valid answer
54 Correct 23 ms 20856 KB ok, no valid answer
55 Correct 25 ms 20984 KB ok, no valid answer
56 Correct 25 ms 20984 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 20216 KB ok, correct split
2 Correct 20 ms 20348 KB ok, correct split
3 Correct 20 ms 20216 KB ok, correct split
4 Correct 25 ms 20344 KB ok, correct split
5 Correct 24 ms 20344 KB ok, correct split
6 Correct 21 ms 20344 KB ok, correct split
7 Correct 409 ms 51392 KB ok, correct split
8 Correct 435 ms 48648 KB ok, correct split
9 Correct 376 ms 47932 KB ok, correct split
10 Correct 372 ms 51704 KB ok, correct split
11 Correct 388 ms 51964 KB ok, correct split
12 Correct 19 ms 20216 KB ok, correct split
13 Correct 20 ms 20216 KB ok, correct split
14 Correct 21 ms 20312 KB ok, correct split
15 Correct 503 ms 50204 KB ok, correct split
16 Correct 327 ms 42744 KB ok, correct split
17 Correct 376 ms 51556 KB ok, correct split
18 Correct 372 ms 48636 KB ok, correct split
19 Correct 480 ms 47736 KB ok, correct split
20 Correct 352 ms 42612 KB ok, correct split
21 Correct 291 ms 43508 KB ok, correct split
22 Correct 280 ms 43556 KB ok, correct split
23 Correct 302 ms 43504 KB ok, correct split
24 Correct 20 ms 20216 KB ok, correct split
25 Correct 328 ms 42720 KB ok, correct split
26 Correct 122 ms 29256 KB ok, correct split
27 Correct 20 ms 20344 KB ok, correct split
28 Correct 381 ms 45656 KB ok, correct split
29 Correct 369 ms 45344 KB ok, correct split
30 Correct 368 ms 45044 KB ok, correct split
31 Correct 372 ms 46708 KB ok, correct split
32 Correct 384 ms 44916 KB ok, correct split
33 Correct 95 ms 27640 KB ok, no valid answer
34 Correct 152 ms 31192 KB ok, no valid answer
35 Correct 318 ms 42484 KB ok, no valid answer
36 Correct 351 ms 42200 KB ok, no valid answer
37 Correct 286 ms 42608 KB ok, no valid answer
38 Correct 21 ms 20216 KB ok, correct split
39 Correct 20 ms 20344 KB ok, no valid answer
40 Correct 21 ms 20316 KB ok, correct split
41 Correct 21 ms 20316 KB ok, correct split
42 Correct 20 ms 20344 KB ok, correct split
43 Correct 20 ms 20344 KB ok, correct split
44 Correct 20 ms 20344 KB ok, correct split
45 Correct 21 ms 20344 KB ok, correct split
46 Correct 27 ms 20984 KB ok, correct split
47 Correct 26 ms 20984 KB ok, correct split
48 Correct 20 ms 20344 KB ok, correct split
49 Correct 26 ms 20984 KB ok, correct split
50 Correct 20 ms 20344 KB ok, correct split
51 Correct 20 ms 20344 KB ok, correct split
52 Correct 20 ms 20316 KB ok, correct split
53 Correct 21 ms 20344 KB ok, correct split
54 Correct 20 ms 20344 KB ok, correct split
55 Correct 21 ms 20344 KB ok, correct split
56 Correct 21 ms 20472 KB ok, correct split
57 Correct 22 ms 20600 KB ok, correct split
58 Correct 25 ms 20984 KB ok, correct split
59 Correct 25 ms 20984 KB ok, correct split
60 Correct 24 ms 20984 KB ok, correct split
61 Correct 25 ms 20988 KB ok, correct split
62 Correct 24 ms 20856 KB ok, correct split
63 Correct 26 ms 21112 KB ok, correct split
64 Correct 26 ms 21112 KB ok, correct split
65 Correct 26 ms 20984 KB ok, correct split
66 Correct 20 ms 20344 KB ok, correct split
67 Correct 26 ms 21112 KB ok, correct split
68 Correct 21 ms 20472 KB ok, correct split
69 Correct 20 ms 20344 KB ok, correct split
70 Correct 21 ms 20348 KB ok, correct split
71 Correct 25 ms 20984 KB ok, correct split
72 Correct 25 ms 20984 KB ok, correct split
73 Correct 24 ms 20856 KB ok, correct split
74 Correct 26 ms 20984 KB ok, correct split
75 Correct 26 ms 21112 KB ok, correct split
76 Correct 27 ms 21112 KB ok, correct split
77 Correct 26 ms 20984 KB ok, correct split
78 Correct 23 ms 20728 KB ok, correct split
79 Correct 23 ms 20600 KB ok, correct split
80 Correct 26 ms 21112 KB ok, correct split
81 Correct 26 ms 20984 KB ok, correct split
82 Correct 27 ms 20988 KB ok, correct split
83 Correct 25 ms 20984 KB ok, correct split
84 Correct 24 ms 20856 KB ok, no valid answer
85 Correct 24 ms 20856 KB ok, correct split
86 Correct 25 ms 20956 KB ok, correct split
87 Correct 21 ms 20344 KB ok, no valid answer
88 Correct 20 ms 20344 KB ok, no valid answer
89 Correct 27 ms 20856 KB ok, no valid answer
90 Correct 33 ms 20984 KB ok, no valid answer
91 Correct 23 ms 20856 KB ok, no valid answer
92 Correct 25 ms 20984 KB ok, no valid answer
93 Correct 25 ms 20984 KB ok, no valid answer
94 Correct 431 ms 46836 KB ok, correct split
95 Correct 658 ms 54972 KB ok, correct split
96 Correct 645 ms 52372 KB ok, correct split
97 Correct 126 ms 29448 KB ok, correct split
98 Correct 129 ms 29404 KB ok, correct split
99 Correct 215 ms 32140 KB ok, correct split
100 Correct 531 ms 48248 KB ok, correct split
101 Correct 508 ms 46832 KB ok, correct split
102 Correct 518 ms 47104 KB ok, correct split
103 Correct 484 ms 46308 KB ok, correct split
104 Correct 556 ms 49252 KB ok, correct split
105 Correct 222 ms 34500 KB ok, correct split
106 Correct 486 ms 53304 KB ok, correct split
107 Correct 333 ms 42820 KB ok, correct split
108 Correct 336 ms 42768 KB ok, correct split
109 Correct 481 ms 47796 KB ok, correct split
110 Correct 587 ms 50564 KB ok, correct split
111 Correct 573 ms 50372 KB ok, correct split
112 Correct 563 ms 50788 KB ok, correct split
113 Correct 585 ms 50432 KB ok, correct split
114 Correct 54 ms 23672 KB ok, correct split
115 Correct 51 ms 23440 KB ok, correct split
116 Correct 545 ms 50072 KB ok, correct split
117 Correct 542 ms 49492 KB ok, correct split
118 Correct 409 ms 42740 KB ok, correct split
119 Correct 338 ms 42612 KB ok, correct split
120 Correct 370 ms 47476 KB ok, correct split
121 Correct 317 ms 42100 KB ok, no valid answer
122 Correct 351 ms 42196 KB ok, no valid answer
123 Correct 563 ms 47992 KB ok, no valid answer
124 Correct 550 ms 48108 KB ok, no valid answer
125 Correct 424 ms 44156 KB ok, no valid answer
126 Correct 253 ms 40432 KB ok, no valid answer
127 Correct 461 ms 45296 KB ok, no valid answer