oj.uz

Submission #584951

# Submission time Handle Problem Language Result Execution time Memory
584951 2022-06-28T07:29:01 Z 8e7 Split the Attractions (IOI19_split) C++17
100 / 100
 125 ms 30120 KB 
//Challenge: Accepted
#include <bits/stdc++.h>
#include "split.h"
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
vector<int> adj[maxn], g[maxn]; //g is spanning tree
int C;
int low[maxn], ti[maxn], siz[maxn], pa[maxn];
void dfs(int n, int par) {
	pa[n] = par;
	ti[n] = low[n] = C;
	C++;
	siz[n] = 1;
	for (int v:adj[n]) {
		if (!ti[v]) {
			dfs(v, n);
			siz[n] += siz[v];
			low[n] = min(low[n], low[v]);

			g[v].push_back(n);
			g[n].push_back(v);
		} else {
			low[n] = min(low[n], ti[v]);
		}
	}
}
void getnode(int n, int par, vector<int> &vec, int s){
	vec.push_back(n);
	if (vec.size() >= s) return;
	for (int v:g[n]) {
		if (v != par) {
			getnode(v, n, vec, s);
			if (vec.size() >= s) return;
		}
	}
}

bool vis[maxn];
void getset(int n, vector<int> &vec, vector<int> &mark, int s) {
	vec.push_back(n);
	if (vec.size() >= s) return;
	vis[n] = 1;
	for (int v:adj[n]) {
		if (!vis[v] && mark[v]) {
			getset(v, vec, mark, s);
			if (vec.size() >= s) return;
		}
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> P, vector<int> Q) {
	C = 1;
	vector<int> ret(n, 0);
	int m = P.size();
	for (int i = 0;i < m;i++) {
		adj[P[i]].push_back(Q[i]);
		adj[Q[i]].push_back(P[i]);
	}
	dfs(0, 0);

	pii ord[3] = {{a, 1}, {b, 2}, {c, 3}};
	sort(ord, ord + 3);
	for (int i = 0;i < 3;i++) debug(ord[i].ff, ord[i].ss);
	int A = ord[0].ff, B = ord[1].ff;

	int p = 0;
	for (int i = 0;i < n;i++) {
		if (A <= siz[i] && siz[i] <= n - A) {
			for (int j = 0;j < n;j++) ret[j] = ord[2].ss;
			vector<int> va, vb;
			if (siz[i] * 2 <= n) {
				getnode(i, pa[i], va, A);	
				getnode(pa[i], i, vb, B);	
			} else {
				getnode(pa[i], i, va, A);	
				getnode(i, pa[i], vb, B);	
			}
			for (int j:va) ret[j] = ord[0].ss;	
			for (int j:vb) ret[j] = ord[1].ss;	
			return ret;
		}
		if (siz[i] > n - A) {
			bool good = 1;
			for (int v:g[i]) {
				if (v != pa[i] && siz[v] >= A) {
					good = 0;
					break;	
				}
			}
			if (good) p = i;
		}
	}
	if (p != 0) {
		int s = n - siz[p];	
		vector<int> vec;	
		getnode(pa[p], p, vec, s);	
		for (int v:g[p]) {
			if (vec.size() >= A) break;
			if (v != pa[p] && low[v] < ti[p]) {
				getnode(v, p, vec, vec.size() + siz[v]);
			}
		}
		vector<int> se(n, 0);
		for (int i:vec) se[i] = 1;	
		//pary(se.begin(), se.end());

		if (vec.size() < A) return ret;
		for (int j = 0;j < n;j++) ret[j] = ord[2].ss;
		vector<int> va, vb;
		if (vec.size() >= B) {
			getset(pa[p], vb, se, B);
			for (int i = 0;i < n;i++) se[i] ^= 1;
			getset(p, va, se, A);
		} else {
			getset(pa[p], va, se, A);
			for (int i = 0;i < n;i++) se[i] ^= 1;
			getset(p, vb, se, B);
		}

		pary(va.begin(), va.end());
		pary(vb.begin(), vb.end());
		for (int j:va) ret[j] = ord[0].ss;	
		for (int j:vb) ret[j] = ord[1].ss;	
	}
	return ret;
}
/*

7 7 
2 2 3
0 1
1 2
1 3
1 4
1 5 
1 6
0 2
*/

Compilation message

split.cpp: In function 'void getnode(int, int, std::vector<int>&, int)':
split.cpp:48:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |  if (vec.size() >= s) return;
      |      ~~~~~~~~~~~^~~~
split.cpp:52:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |    if (vec.size() >= s) return;
      |        ~~~~~~~~~~~^~~~
split.cpp: In function 'void getset(int, std::vector<int>&, std::vector<int>&, int)':
split.cpp:60:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |  if (vec.size() >= s) return;
      |      ~~~~~~~~~~~^~~~
split.cpp:65:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |    if (vec.size() >= s) return;
      |        ~~~~~~~~~~~^~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
split.cpp:81:28: note: in expansion of macro 'debug'
   81 |  for (int i = 0;i < 3;i++) debug(ord[i].ff, ord[i].ss);
      |                            ^~~~~
split.cpp:116:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  116 |    if (vec.size() >= A) break;
      |        ~~~~~~~~~~~^~~~
split.cpp:125:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  125 |   if (vec.size() < A) return ret;
      |       ~~~~~~~~~~~^~~
split.cpp:128:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  128 |   if (vec.size() >= B) {
      |       ~~~~~~~~~~~^~~~
split.cpp:15:19: warning: statement has no effect [-Wunused-value]
   15 | #define pary(...) 0
      |                   ^
split.cpp:138:3: note: in expansion of macro 'pary'
  138 |   pary(va.begin(), va.end());
      |   ^~~~
split.cpp:15:19: warning: statement has no effect [-Wunused-value]
   15 | #define pary(...) 0
      |                   ^
split.cpp:139:3: note: in expansion of macro 'pary'
  139 |   pary(vb.begin(), vb.end());
      |   ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 6 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 6 ms 9684 KB ok, correct split
7 Correct 93 ms 28916 KB ok, correct split
8 Correct 125 ms 25680 KB ok, correct split
9 Correct 82 ms 25232 KB ok, correct split
10 Correct 86 ms 28796 KB ok, correct split
11 Correct 117 ms 29400 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9636 KB ok, correct split
4 Correct 98 ms 24828 KB ok, correct split
5 Correct 97 ms 20076 KB ok, correct split
6 Correct 91 ms 28828 KB ok, correct split
7 Correct 79 ms 25916 KB ok, correct split
8 Correct 104 ms 21788 KB ok, correct split
9 Correct 103 ms 19932 KB ok, correct split
10 Correct 59 ms 20712 KB ok, correct split
11 Correct 58 ms 20736 KB ok, correct split
12 Correct 67 ms 20716 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 74 ms 20088 KB ok, correct split
3 Correct 35 ms 13680 KB ok, correct split
4 Correct 6 ms 9684 KB ok, correct split
5 Correct 87 ms 23108 KB ok, correct split
6 Correct 82 ms 22804 KB ok, correct split
7 Correct 92 ms 22592 KB ok, correct split
8 Correct 94 ms 24204 KB ok, correct split
9 Correct 85 ms 22344 KB ok, correct split
10 Correct 23 ms 13140 KB ok, no valid answer
11 Correct 43 ms 15388 KB ok, no valid answer
12 Correct 69 ms 21604 KB ok, no valid answer
13 Correct 89 ms 21348 KB ok, no valid answer
14 Correct 60 ms 21728 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9684 KB ok, correct split
2 Correct 6 ms 9684 KB ok, no valid answer
3 Correct 6 ms 9684 KB ok, correct split
4 Correct 5 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 6 ms 9684 KB ok, correct split
8 Correct 5 ms 9684 KB ok, correct split
9 Correct 7 ms 10068 KB ok, correct split
10 Correct 8 ms 10068 KB ok, correct split
11 Correct 5 ms 9660 KB ok, correct split
12 Correct 8 ms 9940 KB ok, correct split
13 Correct 7 ms 9684 KB ok, correct split
14 Correct 5 ms 9684 KB ok, correct split
15 Correct 5 ms 9684 KB ok, correct split
16 Correct 5 ms 9684 KB ok, correct split
17 Correct 7 ms 9684 KB ok, correct split
18 Correct 5 ms 9708 KB ok, correct split
19 Correct 6 ms 9684 KB ok, correct split
20 Correct 6 ms 9812 KB ok, correct split
21 Correct 7 ms 9940 KB ok, correct split
22 Correct 7 ms 9944 KB ok, correct split
23 Correct 6 ms 10068 KB ok, correct split
24 Correct 6 ms 9940 KB ok, correct split
25 Correct 6 ms 9940 KB ok, correct split
26 Correct 7 ms 9940 KB ok, correct split
27 Correct 10 ms 9940 KB ok, correct split
28 Correct 6 ms 9940 KB ok, correct split
29 Correct 6 ms 9684 KB ok, correct split
30 Correct 7 ms 9940 KB ok, correct split
31 Correct 8 ms 9684 KB ok, correct split
32 Correct 5 ms 9720 KB ok, correct split
33 Correct 6 ms 9684 KB ok, correct split
34 Correct 7 ms 9940 KB ok, correct split
35 Correct 7 ms 9940 KB ok, correct split
36 Correct 6 ms 9940 KB ok, correct split
37 Correct 7 ms 9940 KB ok, correct split
38 Correct 7 ms 10068 KB ok, correct split
39 Correct 7 ms 9980 KB ok, correct split
40 Correct 7 ms 9960 KB ok, correct split
41 Correct 6 ms 9812 KB ok, correct split
42 Correct 8 ms 9812 KB ok, correct split
43 Correct 7 ms 9940 KB ok, correct split
44 Correct 10 ms 9920 KB ok, correct split
45 Correct 10 ms 9940 KB ok, correct split
46 Correct 8 ms 10068 KB ok, correct split
47 Correct 6 ms 10068 KB ok, no valid answer
48 Correct 7 ms 9940 KB ok, correct split
49 Correct 6 ms 10100 KB ok, correct split
50 Correct 6 ms 9684 KB ok, no valid answer
51 Correct 5 ms 9676 KB ok, no valid answer
52 Correct 6 ms 9940 KB ok, no valid answer
53 Correct 8 ms 10068 KB ok, no valid answer
54 Correct 7 ms 9972 KB ok, no valid answer
55 Correct 7 ms 9940 KB ok, no valid answer
56 Correct 7 ms 9940 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 6 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 6 ms 9684 KB ok, correct split
7 Correct 93 ms 28916 KB ok, correct split
8 Correct 125 ms 25680 KB ok, correct split
9 Correct 82 ms 25232 KB ok, correct split
10 Correct 86 ms 28796 KB ok, correct split
11 Correct 117 ms 29400 KB ok, correct split
12 Correct 5 ms 9684 KB ok, correct split
13 Correct 5 ms 9684 KB ok, correct split
14 Correct 5 ms 9636 KB ok, correct split
15 Correct 98 ms 24828 KB ok, correct split
16 Correct 97 ms 20076 KB ok, correct split
17 Correct 91 ms 28828 KB ok, correct split
18 Correct 79 ms 25916 KB ok, correct split
19 Correct 104 ms 21788 KB ok, correct split
20 Correct 103 ms 19932 KB ok, correct split
21 Correct 59 ms 20712 KB ok, correct split
22 Correct 58 ms 20736 KB ok, correct split
23 Correct 67 ms 20716 KB ok, correct split
24 Correct 5 ms 9684 KB ok, correct split
25 Correct 74 ms 20088 KB ok, correct split
26 Correct 35 ms 13680 KB ok, correct split
27 Correct 6 ms 9684 KB ok, correct split
28 Correct 87 ms 23108 KB ok, correct split
29 Correct 82 ms 22804 KB ok, correct split
30 Correct 92 ms 22592 KB ok, correct split
31 Correct 94 ms 24204 KB ok, correct split
32 Correct 85 ms 22344 KB ok, correct split
33 Correct 23 ms 13140 KB ok, no valid answer
34 Correct 43 ms 15388 KB ok, no valid answer
35 Correct 69 ms 21604 KB ok, no valid answer
36 Correct 89 ms 21348 KB ok, no valid answer
37 Correct 60 ms 21728 KB ok, no valid answer
38 Correct 6 ms 9684 KB ok, correct split
39 Correct 6 ms 9684 KB ok, no valid answer
40 Correct 6 ms 9684 KB ok, correct split
41 Correct 5 ms 9684 KB ok, correct split
42 Correct 6 ms 9684 KB ok, correct split
43 Correct 5 ms 9684 KB ok, correct split
44 Correct 6 ms 9684 KB ok, correct split
45 Correct 5 ms 9684 KB ok, correct split
46 Correct 7 ms 10068 KB ok, correct split
47 Correct 8 ms 10068 KB ok, correct split
48 Correct 5 ms 9660 KB ok, correct split
49 Correct 8 ms 9940 KB ok, correct split
50 Correct 7 ms 9684 KB ok, correct split
51 Correct 5 ms 9684 KB ok, correct split
52 Correct 5 ms 9684 KB ok, correct split
53 Correct 5 ms 9684 KB ok, correct split
54 Correct 7 ms 9684 KB ok, correct split
55 Correct 5 ms 9708 KB ok, correct split
56 Correct 6 ms 9684 KB ok, correct split
57 Correct 6 ms 9812 KB ok, correct split
58 Correct 7 ms 9940 KB ok, correct split
59 Correct 7 ms 9944 KB ok, correct split
60 Correct 6 ms 10068 KB ok, correct split
61 Correct 6 ms 9940 KB ok, correct split
62 Correct 6 ms 9940 KB ok, correct split
63 Correct 7 ms 9940 KB ok, correct split
64 Correct 10 ms 9940 KB ok, correct split
65 Correct 6 ms 9940 KB ok, correct split
66 Correct 6 ms 9684 KB ok, correct split
67 Correct 7 ms 9940 KB ok, correct split
68 Correct 8 ms 9684 KB ok, correct split
69 Correct 5 ms 9720 KB ok, correct split
70 Correct 6 ms 9684 KB ok, correct split
71 Correct 7 ms 9940 KB ok, correct split
72 Correct 7 ms 9940 KB ok, correct split
73 Correct 6 ms 9940 KB ok, correct split
74 Correct 7 ms 9940 KB ok, correct split
75 Correct 7 ms 10068 KB ok, correct split
76 Correct 7 ms 9980 KB ok, correct split
77 Correct 7 ms 9960 KB ok, correct split
78 Correct 6 ms 9812 KB ok, correct split
79 Correct 8 ms 9812 KB ok, correct split
80 Correct 7 ms 9940 KB ok, correct split
81 Correct 10 ms 9920 KB ok, correct split
82 Correct 10 ms 9940 KB ok, correct split
83 Correct 8 ms 10068 KB ok, correct split
84 Correct 6 ms 10068 KB ok, no valid answer
85 Correct 7 ms 9940 KB ok, correct split
86 Correct 6 ms 10100 KB ok, correct split
87 Correct 6 ms 9684 KB ok, no valid answer
88 Correct 5 ms 9676 KB ok, no valid answer
89 Correct 6 ms 9940 KB ok, no valid answer
90 Correct 8 ms 10068 KB ok, no valid answer
91 Correct 7 ms 9972 KB ok, no valid answer
92 Correct 7 ms 9940 KB ok, no valid answer
93 Correct 7 ms 9940 KB ok, no valid answer
94 Correct 110 ms 24672 KB ok, correct split
95 Correct 124 ms 30120 KB ok, correct split
96 Correct 124 ms 28328 KB ok, correct split
97 Correct 29 ms 14292 KB ok, correct split
98 Correct 34 ms 14204 KB ok, correct split
99 Correct 41 ms 16732 KB ok, correct split
100 Correct 114 ms 24432 KB ok, correct split
101 Correct 104 ms 23428 KB ok, correct split
102 Correct 100 ms 23656 KB ok, correct split
103 Correct 86 ms 22976 KB ok, correct split
104 Correct 94 ms 24988 KB ok, correct split
105 Correct 47 ms 17268 KB ok, correct split
106 Correct 110 ms 25600 KB ok, correct split
107 Correct 93 ms 21916 KB ok, correct split
108 Correct 124 ms 21988 KB ok, correct split
109 Correct 124 ms 24940 KB ok, correct split
110 Correct 112 ms 24852 KB ok, correct split
111 Correct 120 ms 24928 KB ok, correct split
112 Correct 124 ms 25180 KB ok, correct split
113 Correct 103 ms 25220 KB ok, correct split
114 Correct 20 ms 11476 KB ok, correct split
115 Correct 18 ms 11252 KB ok, correct split
116 Correct 111 ms 24160 KB ok, correct split
117 Correct 113 ms 24168 KB ok, correct split
118 Correct 112 ms 21324 KB ok, correct split
119 Correct 78 ms 21112 KB ok, correct split
120 Correct 83 ms 26088 KB ok, correct split
121 Correct 87 ms 21196 KB ok, no valid answer
122 Correct 84 ms 21348 KB ok, no valid answer
123 Correct 109 ms 24960 KB ok, no valid answer
124 Correct 119 ms 24812 KB ok, no valid answer
125 Correct 103 ms 22596 KB ok, no valid answer
126 Correct 52 ms 20496 KB ok, no valid answer
127 Correct 82 ms 23080 KB ok, no valid answer