oj.uz

Submission #986613

# Submission time Handle Problem Language Result Execution time Memory
986613 2024-05-20T21:15:02 Z mariaclara Split the Attractions (IOI19_split) C++17
40 / 100
 60 ms 15920 KB 
#include "split.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int A, B, no = -1, pai;
vector<int> sub, vis;
vector<vector<int>> edges;

void dfs(int x, int anc) {
	sub[x] = 1;
	vis[x] = 1;

	for(int viz : edges[x])
		if(!vis[viz]) dfs(viz, x), sub[x] += sub[viz];

	if((sub[x] >= A and sz(sub)-sub[x] >= B)
	or (sub[x] >= B and sz(sub)-sub[x] >= A)) no = x, pai = anc;
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	edges.resize(n);

	for(int i = 0; i < sz(p); i++)
		edges[p[i]].pb(q[i]), edges[q[i]].pb(p[i]);

	if(a == 1) {
		queue<int> fila;
		vector<int> ans(n);
		fila.push(0);

		int cnt = 0;
		while(!fila.empty()) {
			int x = fila.front();
			fila.pop();

			if(ans[x]) continue;
			ans[x] = 2;
			cnt++;
			if(cnt == b) break;

			for(int viz : edges[x])
				if(!ans[viz]) fila.push(viz);
		}

		for(int i = 0; i < n; i++)
			if(a and ans[i] == 0) ans[i] = 1, a = 0;
			else if(ans[i] == 0) ans[i] = 3;
		
		return ans;
	}
	else{
		sub.resize(n);
		vis.resize(n);
		
		A = min({a,b,c});
		B = min({max(a,b), max(b,c), max(c,a)});
		dfs(0, 0);

		vector<int> ans(n);
		if(no == -1) return ans;
		int type = 1;
		if(n - sub[no] < B) type = 2;

		for(int i = 0; i < sz(edges[no]); i++) {
			if(edges[no][i] == pai) {
				edges[no].erase(edges[no].begin()+i);
				break;
			}
		}

		queue<int> fila;
		fila.push(no);
		int cnt = 0;
		while(!fila.empty()) {
			int x = fila.front();
			fila.pop();

			if(ans[x]) continue;
			ans[x] = type;
			cnt++;
			if(type == 1 and cnt == A) break;
			if(type == 2 and cnt == B) break;

			for(int viz : edges[x])
				if(!ans[viz]) fila.push(viz);
		}
		
		while(!fila.empty()) fila.pop();
		fila.push(pai);
		cnt = 0;

		while(!fila.empty()) {
			int x = fila.front();
			fila.pop();

			if(ans[x]) continue;
			ans[x] = 3-type;
			cnt++;
			if(type == 1 and cnt == B) break;
			if(type == 2 and cnt == A) break;

			for(int viz : edges[x])
				if(!ans[viz]) fila.push(viz);
		}

		for(int i = 0; i < n; i++) {
			if(ans[i] == 1) {
				if(a > A and b == A) ans[i] = 2;
				else if(a > A) ans[i] = 3;
			}
			else if(ans[i] == 2) {
				if(a > A and a == B) ans[i] = 1;
				else if(b > B or (b == A and a > A)) ans[i] = 3;
			}
			else {
				if(a > B) ans[i] = 1;
				else if(b > B or (b > c and b >= a)) ans[i] = 2;
				else ans[i] = 3;
			}
		}

		return ans;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 1 ms 344 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 57 ms 15620 KB ok, correct split
8 Correct 36 ms 8912 KB ok, correct split
9 Correct 46 ms 13216 KB ok, correct split
10 Correct 33 ms 9048 KB ok, correct split
11 Correct 47 ms 15920 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB ok, correct split
2 Correct 1 ms 348 KB ok, correct split
3 Correct 0 ms 436 KB ok, correct split
4 Correct 48 ms 10576 KB ok, correct split
5 Correct 36 ms 8996 KB ok, correct split
6 Correct 33 ms 8796 KB ok, correct split
7 Correct 35 ms 8784 KB ok, correct split
8 Correct 60 ms 12524 KB ok, correct split
9 Correct 35 ms 8016 KB ok, correct split
10 Correct 33 ms 9428 KB ok, correct split
11 Correct 36 ms 9408 KB ok, correct split
12 Correct 33 ms 9680 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok, correct split
2 Correct 40 ms 9756 KB ok, correct split
3 Correct 15 ms 4188 KB ok, correct split
4 Correct 1 ms 344 KB ok, correct split
5 Correct 42 ms 11856 KB ok, correct split
6 Correct 42 ms 11608 KB ok, correct split
7 Correct 43 ms 11332 KB ok, correct split
8 Correct 44 ms 12380 KB ok, correct split
9 Correct 41 ms 11356 KB ok, correct split
10 Correct 12 ms 3416 KB ok, no valid answer
11 Correct 18 ms 4956 KB ok, no valid answer
12 Correct 34 ms 9880 KB ok, no valid answer
13 Correct 49 ms 9820 KB ok, no valid answer
14 Correct 31 ms 10032 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB ok, correct split
2 Correct 1 ms 348 KB ok, no valid answer
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 344 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 0 ms 348 KB ok, correct split
8 Correct 0 ms 348 KB ok, correct split
9 Correct 2 ms 604 KB ok, correct split
10 Correct 3 ms 604 KB ok, correct split
11 Correct 1 ms 348 KB ok, correct split
12 Incorrect 2 ms 604 KB invalid split: #1=800, #2=1601, #3=0
13 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 1 ms 344 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 57 ms 15620 KB ok, correct split
8 Correct 36 ms 8912 KB ok, correct split
9 Correct 46 ms 13216 KB ok, correct split
10 Correct 33 ms 9048 KB ok, correct split
11 Correct 47 ms 15920 KB ok, correct split
12 Correct 1 ms 348 KB ok, correct split
13 Correct 1 ms 348 KB ok, correct split
14 Correct 0 ms 436 KB ok, correct split
15 Correct 48 ms 10576 KB ok, correct split
16 Correct 36 ms 8996 KB ok, correct split
17 Correct 33 ms 8796 KB ok, correct split
18 Correct 35 ms 8784 KB ok, correct split
19 Correct 60 ms 12524 KB ok, correct split
20 Correct 35 ms 8016 KB ok, correct split
21 Correct 33 ms 9428 KB ok, correct split
22 Correct 36 ms 9408 KB ok, correct split
23 Correct 33 ms 9680 KB ok, correct split
24 Correct 0 ms 348 KB ok, correct split
25 Correct 40 ms 9756 KB ok, correct split
26 Correct 15 ms 4188 KB ok, correct split
27 Correct 1 ms 344 KB ok, correct split
28 Correct 42 ms 11856 KB ok, correct split
29 Correct 42 ms 11608 KB ok, correct split
30 Correct 43 ms 11332 KB ok, correct split
31 Correct 44 ms 12380 KB ok, correct split
32 Correct 41 ms 11356 KB ok, correct split
33 Correct 12 ms 3416 KB ok, no valid answer
34 Correct 18 ms 4956 KB ok, no valid answer
35 Correct 34 ms 9880 KB ok, no valid answer
36 Correct 49 ms 9820 KB ok, no valid answer
37 Correct 31 ms 10032 KB ok, no valid answer
38 Correct 1 ms 344 KB ok, correct split
39 Correct 1 ms 348 KB ok, no valid answer
40 Correct 0 ms 348 KB ok, correct split
41 Correct 0 ms 344 KB ok, correct split
42 Correct 0 ms 348 KB ok, correct split
43 Correct 0 ms 348 KB ok, correct split
44 Correct 0 ms 348 KB ok, correct split
45 Correct 0 ms 348 KB ok, correct split
46 Correct 2 ms 604 KB ok, correct split
47 Correct 3 ms 604 KB ok, correct split
48 Correct 1 ms 348 KB ok, correct split
49 Incorrect 2 ms 604 KB invalid split: #1=800, #2=1601, #3=0
50 Halted 0 ms 0 KB -