oj.uz

Submission #775070

# Submission time Handle Problem Language Result Execution time Memory
775070 2023-07-06T07:19:07 Z ono_de206 Split the Attractions (IOI19_split) C++14
100 / 100
 86 ms 19636 KB 
#include "split.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

const int mxn = 1e5 + 10;
int a, b, c, n, t, in[mxn], lo[mxn], par[mxn], sub[mxn];
vector<int> ans, g[mxn];
bool vis[mxn];
pair<int, int> M;

void dfs(int to, int fr) {
	in[to] = lo[to] = ++t;
	vis[to] = true;
	sub[to] = 1;
	par[to] = fr;
	for(int x : g[to]) {
		if(x == fr) continue;
		if(vis[x]) {
			lo[to] = min(lo[to], in[x]);
		} else {
			dfs(x, to);
			sub[to] += sub[x];
			lo[to] = min(lo[to], lo[x]);
		}
	}
	if(sub[to] >= a) {
		M = min(M, {sub[to], to});
	}
}

void dfs2(int to) {
	if(n - M.ff >= a) return;
	if(lo[to] < in[M.ss] && M.ss != to) {
		vis[to] = 1;
		M.ff -= sub[to];
		return;
	}
	for(int x : g[to]) {
		if(par[x] == to) {
			dfs2(x);
		}
	}
}

int cnt;
void dfs3(int to) {
	if(vis[to] || cnt == a) return;
	ans[to] = 1;
	cnt++;
	for(int x : g[to]) {
		if(par[x] == to) {
			dfs3(x);
		}
	}
}

vector<int> find_split(int N, int A, int B, int C, vector<int> p, vector<int> q) {
	n = N;
	ans.resize(n);
	for(int i = 0; i < q.size(); i++) {
		g[p[i]].pb(q[i]);
		g[q[i]].pb(p[i]);
	}
	vector<pair<int, int>> pos{{A, 1}, {B, 2}, {C, 3}};
	sort(all(pos));
	a = pos[0].ff; b = pos[1].ff; c = pos[2].ff;
	M = {n + 1, -1};
	dfs(0, -1);
	for(int i = 0; i < n; i++) {
		vis[i] = 0;
	}
	dfs2(M.ss);
	if(n - M.ff < a) return vector<int>(n);
	bool did = (n - M.ff < b);
	if(did) swap(a, b);
	dfs3(M.ss);
	for(int i = 0; i < n; i++) {
		vis[i] = false;
	}
	for(int i = 0; i < n; i++) {
		if(vis[i] || ans[i]) continue;
		queue<int> q;
		q.push(i);
		vector<int> ver;
		while(q.size()) {
			int to = q.front(); q.pop();
			ver.pb(to);
			vis[to] = 1;
			for(int x : g[to]) {
				if(ans[x] || vis[x]) continue;
				vis[x] = 1;
				q.push(x);
			}
		}
		if(ver.size() >= b) {
			for(int i = 0; i < b; i++) {
				ans[ver[i]] = 2;
			}
			break;
		}
	}
	for(int i = 0; i < n; i++) {
		if(!ans[i]) ans[i] = 3;
		else if(did) ans[i] ^= 3;
		ans[i] = pos[ans[i] - 1].ss;
	}
	return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:76:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |  for(int i = 0; i < q.size(); i++) {
      |                 ~~^~~~~~~~~~
split.cpp:111:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  111 |   if(ver.size() >= b) {
      |      ~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2588 KB ok, correct split
3 Correct 2 ms 2644 KB ok, correct split
4 Correct 2 ms 2644 KB ok, correct split
5 Correct 1 ms 2644 KB ok, correct split
6 Correct 1 ms 2644 KB ok, correct split
7 Correct 50 ms 18536 KB ok, correct split
8 Correct 53 ms 16308 KB ok, correct split
9 Correct 44 ms 15672 KB ok, correct split
10 Correct 49 ms 18900 KB ok, correct split
11 Correct 47 ms 19000 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2644 KB ok, correct split
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 83 ms 16468 KB ok, correct split
5 Correct 43 ms 11280 KB ok, correct split
6 Correct 65 ms 19000 KB ok, correct split
7 Correct 49 ms 16164 KB ok, correct split
8 Correct 73 ms 14656 KB ok, correct split
9 Correct 51 ms 11188 KB ok, correct split
10 Correct 33 ms 11740 KB ok, correct split
11 Correct 33 ms 11736 KB ok, correct split
12 Correct 32 ms 12128 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB ok, correct split
2 Correct 40 ms 11156 KB ok, correct split
3 Correct 16 ms 6228 KB ok, correct split
4 Correct 1 ms 2644 KB ok, correct split
5 Correct 50 ms 13784 KB ok, correct split
6 Correct 42 ms 13540 KB ok, correct split
7 Correct 54 ms 13232 KB ok, correct split
8 Correct 64 ms 14692 KB ok, correct split
9 Correct 43 ms 13028 KB ok, correct split
10 Correct 14 ms 5360 KB ok, no valid answer
11 Correct 20 ms 6868 KB ok, no valid answer
12 Correct 34 ms 11224 KB ok, no valid answer
13 Correct 40 ms 11044 KB ok, no valid answer
14 Correct 31 ms 11248 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 1 ms 2644 KB ok, no valid answer
3 Correct 1 ms 2644 KB ok, correct split
4 Correct 1 ms 2676 KB ok, correct split
5 Correct 1 ms 2644 KB ok, correct split
6 Correct 1 ms 2660 KB ok, correct split
7 Correct 1 ms 2644 KB ok, correct split
8 Correct 2 ms 2644 KB ok, correct split
9 Correct 3 ms 3028 KB ok, correct split
10 Correct 3 ms 2900 KB ok, correct split
11 Correct 2 ms 2644 KB ok, correct split
12 Correct 3 ms 2876 KB ok, correct split
13 Correct 1 ms 2660 KB ok, correct split
14 Correct 1 ms 2660 KB ok, correct split
15 Correct 2 ms 2644 KB ok, correct split
16 Correct 2 ms 2660 KB ok, correct split
17 Correct 2 ms 2644 KB ok, correct split
18 Correct 2 ms 2644 KB ok, correct split
19 Correct 2 ms 2644 KB ok, correct split
20 Correct 2 ms 2772 KB ok, correct split
21 Correct 3 ms 2900 KB ok, correct split
22 Correct 3 ms 2900 KB ok, correct split
23 Correct 2 ms 2900 KB ok, correct split
24 Correct 4 ms 2932 KB ok, correct split
25 Correct 2 ms 2900 KB ok, correct split
26 Correct 4 ms 2868 KB ok, correct split
27 Correct 3 ms 2928 KB ok, correct split
28 Correct 3 ms 2928 KB ok, correct split
29 Correct 2 ms 2644 KB ok, correct split
30 Correct 4 ms 2900 KB ok, correct split
31 Correct 2 ms 2644 KB ok, correct split
32 Correct 1 ms 2644 KB ok, correct split
33 Correct 2 ms 2644 KB ok, correct split
34 Correct 2 ms 2804 KB ok, correct split
35 Correct 3 ms 2900 KB ok, correct split
36 Correct 3 ms 2772 KB ok, correct split
37 Correct 3 ms 2900 KB ok, correct split
38 Correct 3 ms 2928 KB ok, correct split
39 Correct 3 ms 2928 KB ok, correct split
40 Correct 3 ms 2900 KB ok, correct split
41 Correct 2 ms 2772 KB ok, correct split
42 Correct 3 ms 2772 KB ok, correct split
43 Correct 3 ms 2900 KB ok, correct split
44 Correct 3 ms 2856 KB ok, correct split
45 Correct 3 ms 2900 KB ok, correct split
46 Correct 2 ms 2900 KB ok, correct split
47 Correct 3 ms 2828 KB ok, no valid answer
48 Correct 3 ms 2900 KB ok, correct split
49 Correct 2 ms 2900 KB ok, correct split
50 Correct 1 ms 2644 KB ok, no valid answer
51 Correct 2 ms 2644 KB ok, no valid answer
52 Correct 2 ms 2772 KB ok, no valid answer
53 Correct 3 ms 2900 KB ok, no valid answer
54 Correct 2 ms 2772 KB ok, no valid answer
55 Correct 3 ms 2900 KB ok, no valid answer
56 Correct 2 ms 2784 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB ok, correct split
2 Correct 2 ms 2588 KB ok, correct split
3 Correct 2 ms 2644 KB ok, correct split
4 Correct 2 ms 2644 KB ok, correct split
5 Correct 1 ms 2644 KB ok, correct split
6 Correct 1 ms 2644 KB ok, correct split
7 Correct 50 ms 18536 KB ok, correct split
8 Correct 53 ms 16308 KB ok, correct split
9 Correct 44 ms 15672 KB ok, correct split
10 Correct 49 ms 18900 KB ok, correct split
11 Correct 47 ms 19000 KB ok, correct split
12 Correct 2 ms 2644 KB ok, correct split
13 Correct 2 ms 2644 KB ok, correct split
14 Correct 1 ms 2644 KB ok, correct split
15 Correct 83 ms 16468 KB ok, correct split
16 Correct 43 ms 11280 KB ok, correct split
17 Correct 65 ms 19000 KB ok, correct split
18 Correct 49 ms 16164 KB ok, correct split
19 Correct 73 ms 14656 KB ok, correct split
20 Correct 51 ms 11188 KB ok, correct split
21 Correct 33 ms 11740 KB ok, correct split
22 Correct 33 ms 11736 KB ok, correct split
23 Correct 32 ms 12128 KB ok, correct split
24 Correct 1 ms 2644 KB ok, correct split
25 Correct 40 ms 11156 KB ok, correct split
26 Correct 16 ms 6228 KB ok, correct split
27 Correct 1 ms 2644 KB ok, correct split
28 Correct 50 ms 13784 KB ok, correct split
29 Correct 42 ms 13540 KB ok, correct split
30 Correct 54 ms 13232 KB ok, correct split
31 Correct 64 ms 14692 KB ok, correct split
32 Correct 43 ms 13028 KB ok, correct split
33 Correct 14 ms 5360 KB ok, no valid answer
34 Correct 20 ms 6868 KB ok, no valid answer
35 Correct 34 ms 11224 KB ok, no valid answer
36 Correct 40 ms 11044 KB ok, no valid answer
37 Correct 31 ms 11248 KB ok, no valid answer
38 Correct 2 ms 2644 KB ok, correct split
39 Correct 1 ms 2644 KB ok, no valid answer
40 Correct 1 ms 2644 KB ok, correct split
41 Correct 1 ms 2676 KB ok, correct split
42 Correct 1 ms 2644 KB ok, correct split
43 Correct 1 ms 2660 KB ok, correct split
44 Correct 1 ms 2644 KB ok, correct split
45 Correct 2 ms 2644 KB ok, correct split
46 Correct 3 ms 3028 KB ok, correct split
47 Correct 3 ms 2900 KB ok, correct split
48 Correct 2 ms 2644 KB ok, correct split
49 Correct 3 ms 2876 KB ok, correct split
50 Correct 1 ms 2660 KB ok, correct split
51 Correct 1 ms 2660 KB ok, correct split
52 Correct 2 ms 2644 KB ok, correct split
53 Correct 2 ms 2660 KB ok, correct split
54 Correct 2 ms 2644 KB ok, correct split
55 Correct 2 ms 2644 KB ok, correct split
56 Correct 2 ms 2644 KB ok, correct split
57 Correct 2 ms 2772 KB ok, correct split
58 Correct 3 ms 2900 KB ok, correct split
59 Correct 3 ms 2900 KB ok, correct split
60 Correct 2 ms 2900 KB ok, correct split
61 Correct 4 ms 2932 KB ok, correct split
62 Correct 2 ms 2900 KB ok, correct split
63 Correct 4 ms 2868 KB ok, correct split
64 Correct 3 ms 2928 KB ok, correct split
65 Correct 3 ms 2928 KB ok, correct split
66 Correct 2 ms 2644 KB ok, correct split
67 Correct 4 ms 2900 KB ok, correct split
68 Correct 2 ms 2644 KB ok, correct split
69 Correct 1 ms 2644 KB ok, correct split
70 Correct 2 ms 2644 KB ok, correct split
71 Correct 2 ms 2804 KB ok, correct split
72 Correct 3 ms 2900 KB ok, correct split
73 Correct 3 ms 2772 KB ok, correct split
74 Correct 3 ms 2900 KB ok, correct split
75 Correct 3 ms 2928 KB ok, correct split
76 Correct 3 ms 2928 KB ok, correct split
77 Correct 3 ms 2900 KB ok, correct split
78 Correct 2 ms 2772 KB ok, correct split
79 Correct 3 ms 2772 KB ok, correct split
80 Correct 3 ms 2900 KB ok, correct split
81 Correct 3 ms 2856 KB ok, correct split
82 Correct 3 ms 2900 KB ok, correct split
83 Correct 2 ms 2900 KB ok, correct split
84 Correct 3 ms 2828 KB ok, no valid answer
85 Correct 3 ms 2900 KB ok, correct split
86 Correct 2 ms 2900 KB ok, correct split
87 Correct 1 ms 2644 KB ok, no valid answer
88 Correct 2 ms 2644 KB ok, no valid answer
89 Correct 2 ms 2772 KB ok, no valid answer
90 Correct 3 ms 2900 KB ok, no valid answer
91 Correct 2 ms 2772 KB ok, no valid answer
92 Correct 3 ms 2900 KB ok, no valid answer
93 Correct 2 ms 2784 KB ok, no valid answer
94 Correct 52 ms 14124 KB ok, correct split
95 Correct 86 ms 19636 KB ok, correct split
96 Correct 64 ms 17788 KB ok, correct split
97 Correct 18 ms 6228 KB ok, correct split
98 Correct 18 ms 6332 KB ok, correct split
99 Correct 30 ms 8808 KB ok, correct split
100 Correct 79 ms 15332 KB ok, correct split
101 Correct 65 ms 13964 KB ok, correct split
102 Correct 58 ms 13920 KB ok, correct split
103 Correct 53 ms 13736 KB ok, correct split
104 Correct 57 ms 14756 KB ok, correct split
105 Correct 25 ms 8020 KB ok, correct split
106 Correct 72 ms 14932 KB ok, correct split
107 Correct 41 ms 11300 KB ok, correct split
108 Correct 42 ms 11236 KB ok, correct split
109 Correct 67 ms 14580 KB ok, correct split
110 Correct 66 ms 14620 KB ok, correct split
111 Correct 67 ms 14704 KB ok, correct split
112 Correct 62 ms 15004 KB ok, correct split
113 Correct 68 ms 14960 KB ok, correct split
114 Correct 8 ms 4180 KB ok, correct split
115 Correct 7 ms 3924 KB ok, correct split
116 Correct 60 ms 14796 KB ok, correct split
117 Correct 59 ms 14688 KB ok, correct split
118 Correct 45 ms 11136 KB ok, correct split
119 Correct 41 ms 11232 KB ok, correct split
120 Correct 45 ms 15308 KB ok, correct split
121 Correct 41 ms 11044 KB ok, no valid answer
122 Correct 48 ms 10984 KB ok, no valid answer
123 Correct 70 ms 15092 KB ok, no valid answer
124 Correct 68 ms 14944 KB ok, no valid answer
125 Correct 43 ms 12080 KB ok, no valid answer
126 Correct 31 ms 10468 KB ok, no valid answer
127 Correct 46 ms 12644 KB ok, no valid answer