oj.uz

답안 #823896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823896 2023-08-13T09:50:55 Z Blagoj Split the Attractions (IOI19_split) C++17
100 / 100
 96 ms 29968 KB 
#include <bits/stdc++.h>
#include "split.h"

using namespace std;

const int N = 1e5 + 5;

int tin[N], low[N], timer = 0, mark[N], sz[N], A, B, C, n;
bool special[N];

vector<int> g[N], children[N];

bool found = 0;

void color1(int cur, int type, int &Left) {
    if (Left == 0) mark[cur] = 3;
    else {
		mark[cur] = type;
    	Left--;
	}
	for (auto next : children[cur]) color1(next, type, Left);
}

void color2(int cur, int type, int &Left) {
	if (Left == 0) mark[cur] = 3;
    else {
		mark[cur] = type;
    	Left--;
	}
	for (auto next : g[cur]) if (mark[next] == 0) color2(next, type, Left);
}

void dfs(int cur) {
	tin[cur] = low[cur] = ++timer;
	sz[cur] = 1;
	for (auto next : g[cur]) {
		if (tin[next] == 0) {
			dfs(next);
			children[cur].push_back(next);
			sz[cur] += sz[next];
			low[cur] = min(low[cur], low[next]);
		}
		else low[cur] = min(low[cur], tin[next]);
	}
	if (found) return;
	if (sz[cur] >= A) {
		int sum = sz[cur];
		for (auto next : children[cur]) {
			if (low[next] < tin[cur] && sum - sz[next] >= A) {
				sum -= sz[next];
				special[next] = 1;
			}
		}
		if (sum >= A && n - sum >= B) {
			found = 1;
			mark[cur] = 1;
			int Left = A - 1;
			for (auto next : children[cur]) {
				if (!special[next]) color1(next, 1, Left);
			}
			color2(0, 2, B);
		}
		else if (sum >= B && n - sum >= A) {
			found = 1;
			mark[cur] = 2;
			int Left = B - 1;
			for (auto next : children[cur]) {
				if (!special[next]) color1(next, 2, Left);
			}
			color2(0, 1, A);
		}
	}
}

vector<int> find_split(int _n, int a, int b, int c, vector<int> p, vector<int> q) {
	n = _n;
	vector<pair<int, int>> srt = {{-1, 0}, {a, 1}, {b, 2}, {c, 3}};
	sort(srt.begin(), srt.end());
	A = srt[1].first;
	B = srt[2].first;
	C = srt[3].first;
	for (int i = 0; i < p.size(); i++) {
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	dfs(0);
	vector<int> ans(n);
	for (int i = 0; i < n; i++) ans[i] = srt[mark[i]].second;
	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:82:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |  for (int i = 0; i < p.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 2 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 2 ms 4948 KB ok, correct split
6 Correct 3 ms 4948 KB ok, correct split
7 Correct 64 ms 24820 KB ok, correct split
8 Correct 66 ms 22120 KB ok, correct split
9 Correct 66 ms 22544 KB ok, correct split
10 Correct 66 ms 29960 KB ok, correct split
11 Correct 73 ms 25292 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 2 ms 5004 KB ok, correct split
4 Correct 77 ms 20812 KB ok, correct split
5 Correct 51 ms 14480 KB ok, correct split
6 Correct 66 ms 29968 KB ok, correct split
7 Correct 78 ms 24820 KB ok, correct split
8 Correct 82 ms 18200 KB ok, correct split
9 Correct 57 ms 15948 KB ok, correct split
10 Correct 35 ms 13328 KB ok, correct split
11 Correct 36 ms 13320 KB ok, correct split
12 Correct 36 ms 13640 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB ok, correct split
2 Correct 52 ms 14496 KB ok, correct split
3 Correct 21 ms 8728 KB ok, correct split
4 Correct 3 ms 4948 KB ok, correct split
5 Correct 68 ms 19056 KB ok, correct split
6 Correct 65 ms 18732 KB ok, correct split
7 Correct 60 ms 18460 KB ok, correct split
8 Correct 63 ms 20088 KB ok, correct split
9 Correct 58 ms 18232 KB ok, correct split
10 Correct 16 ms 7956 KB ok, no valid answer
11 Correct 23 ms 9552 KB ok, no valid answer
12 Correct 44 ms 13520 KB ok, no valid answer
13 Correct 49 ms 13952 KB ok, no valid answer
14 Correct 35 ms 13256 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4960 KB ok, correct split
2 Correct 2 ms 4992 KB ok, no valid answer
3 Correct 2 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 2 ms 5008 KB ok, correct split
6 Correct 2 ms 5000 KB ok, correct split
7 Correct 2 ms 4948 KB ok, correct split
8 Correct 2 ms 4948 KB ok, correct split
9 Correct 4 ms 5332 KB ok, correct split
10 Correct 4 ms 5332 KB ok, correct split
11 Correct 3 ms 5056 KB ok, correct split
12 Correct 4 ms 5332 KB ok, correct split
13 Correct 3 ms 5076 KB ok, correct split
14 Correct 2 ms 4948 KB ok, correct split
15 Correct 2 ms 4948 KB ok, correct split
16 Correct 2 ms 4948 KB ok, correct split
17 Correct 3 ms 4952 KB ok, correct split
18 Correct 3 ms 4948 KB ok, correct split
19 Correct 3 ms 4948 KB ok, correct split
20 Correct 3 ms 5076 KB ok, correct split
21 Correct 3 ms 5332 KB ok, correct split
22 Correct 3 ms 5332 KB ok, correct split
23 Correct 3 ms 5332 KB ok, correct split
24 Correct 3 ms 5332 KB ok, correct split
25 Correct 3 ms 5332 KB ok, correct split
26 Correct 3 ms 5272 KB ok, correct split
27 Correct 3 ms 5280 KB ok, correct split
28 Correct 3 ms 5204 KB ok, correct split
29 Correct 2 ms 4948 KB ok, correct split
30 Correct 3 ms 5276 KB ok, correct split
31 Correct 3 ms 5076 KB ok, correct split
32 Correct 3 ms 5008 KB ok, correct split
33 Correct 2 ms 4948 KB ok, correct split
34 Correct 3 ms 5204 KB ok, correct split
35 Correct 4 ms 5268 KB ok, correct split
36 Correct 3 ms 5204 KB ok, correct split
37 Correct 4 ms 5276 KB ok, correct split
38 Correct 4 ms 5400 KB ok, correct split
39 Correct 4 ms 5244 KB ok, correct split
40 Correct 4 ms 5332 KB ok, correct split
41 Correct 3 ms 5152 KB ok, correct split
42 Correct 3 ms 5172 KB ok, correct split
43 Correct 4 ms 5332 KB ok, correct split
44 Correct 4 ms 5280 KB ok, correct split
45 Correct 4 ms 5268 KB ok, correct split
46 Correct 3 ms 5332 KB ok, correct split
47 Correct 3 ms 5332 KB ok, no valid answer
48 Correct 3 ms 5280 KB ok, correct split
49 Correct 3 ms 5332 KB ok, correct split
50 Correct 3 ms 4960 KB ok, no valid answer
51 Correct 2 ms 5004 KB ok, no valid answer
52 Correct 4 ms 5144 KB ok, no valid answer
53 Correct 4 ms 5332 KB ok, no valid answer
54 Correct 3 ms 5204 KB ok, no valid answer
55 Correct 3 ms 5196 KB ok, no valid answer
56 Correct 3 ms 5168 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5004 KB ok, correct split
2 Correct 2 ms 4948 KB ok, correct split
3 Correct 2 ms 4948 KB ok, correct split
4 Correct 2 ms 4948 KB ok, correct split
5 Correct 2 ms 4948 KB ok, correct split
6 Correct 3 ms 4948 KB ok, correct split
7 Correct 64 ms 24820 KB ok, correct split
8 Correct 66 ms 22120 KB ok, correct split
9 Correct 66 ms 22544 KB ok, correct split
10 Correct 66 ms 29960 KB ok, correct split
11 Correct 73 ms 25292 KB ok, correct split
12 Correct 2 ms 4948 KB ok, correct split
13 Correct 2 ms 4948 KB ok, correct split
14 Correct 2 ms 5004 KB ok, correct split
15 Correct 77 ms 20812 KB ok, correct split
16 Correct 51 ms 14480 KB ok, correct split
17 Correct 66 ms 29968 KB ok, correct split
18 Correct 78 ms 24820 KB ok, correct split
19 Correct 82 ms 18200 KB ok, correct split
20 Correct 57 ms 15948 KB ok, correct split
21 Correct 35 ms 13328 KB ok, correct split
22 Correct 36 ms 13320 KB ok, correct split
23 Correct 36 ms 13640 KB ok, correct split
24 Correct 2 ms 4948 KB ok, correct split
25 Correct 52 ms 14496 KB ok, correct split
26 Correct 21 ms 8728 KB ok, correct split
27 Correct 3 ms 4948 KB ok, correct split
28 Correct 68 ms 19056 KB ok, correct split
29 Correct 65 ms 18732 KB ok, correct split
30 Correct 60 ms 18460 KB ok, correct split
31 Correct 63 ms 20088 KB ok, correct split
32 Correct 58 ms 18232 KB ok, correct split
33 Correct 16 ms 7956 KB ok, no valid answer
34 Correct 23 ms 9552 KB ok, no valid answer
35 Correct 44 ms 13520 KB ok, no valid answer
36 Correct 49 ms 13952 KB ok, no valid answer
37 Correct 35 ms 13256 KB ok, no valid answer
38 Correct 2 ms 4960 KB ok, correct split
39 Correct 2 ms 4992 KB ok, no valid answer
40 Correct 2 ms 4948 KB ok, correct split
41 Correct 2 ms 4948 KB ok, correct split
42 Correct 2 ms 5008 KB ok, correct split
43 Correct 2 ms 5000 KB ok, correct split
44 Correct 2 ms 4948 KB ok, correct split
45 Correct 2 ms 4948 KB ok, correct split
46 Correct 4 ms 5332 KB ok, correct split
47 Correct 4 ms 5332 KB ok, correct split
48 Correct 3 ms 5056 KB ok, correct split
49 Correct 4 ms 5332 KB ok, correct split
50 Correct 3 ms 5076 KB ok, correct split
51 Correct 2 ms 4948 KB ok, correct split
52 Correct 2 ms 4948 KB ok, correct split
53 Correct 2 ms 4948 KB ok, correct split
54 Correct 3 ms 4952 KB ok, correct split
55 Correct 3 ms 4948 KB ok, correct split
56 Correct 3 ms 4948 KB ok, correct split
57 Correct 3 ms 5076 KB ok, correct split
58 Correct 3 ms 5332 KB ok, correct split
59 Correct 3 ms 5332 KB ok, correct split
60 Correct 3 ms 5332 KB ok, correct split
61 Correct 3 ms 5332 KB ok, correct split
62 Correct 3 ms 5332 KB ok, correct split
63 Correct 3 ms 5272 KB ok, correct split
64 Correct 3 ms 5280 KB ok, correct split
65 Correct 3 ms 5204 KB ok, correct split
66 Correct 2 ms 4948 KB ok, correct split
67 Correct 3 ms 5276 KB ok, correct split
68 Correct 3 ms 5076 KB ok, correct split
69 Correct 3 ms 5008 KB ok, correct split
70 Correct 2 ms 4948 KB ok, correct split
71 Correct 3 ms 5204 KB ok, correct split
72 Correct 4 ms 5268 KB ok, correct split
73 Correct 3 ms 5204 KB ok, correct split
74 Correct 4 ms 5276 KB ok, correct split
75 Correct 4 ms 5400 KB ok, correct split
76 Correct 4 ms 5244 KB ok, correct split
77 Correct 4 ms 5332 KB ok, correct split
78 Correct 3 ms 5152 KB ok, correct split
79 Correct 3 ms 5172 KB ok, correct split
80 Correct 4 ms 5332 KB ok, correct split
81 Correct 4 ms 5280 KB ok, correct split
82 Correct 4 ms 5268 KB ok, correct split
83 Correct 3 ms 5332 KB ok, correct split
84 Correct 3 ms 5332 KB ok, no valid answer
85 Correct 3 ms 5280 KB ok, correct split
86 Correct 3 ms 5332 KB ok, correct split
87 Correct 3 ms 4960 KB ok, no valid answer
88 Correct 2 ms 5004 KB ok, no valid answer
89 Correct 4 ms 5144 KB ok, no valid answer
90 Correct 4 ms 5332 KB ok, no valid answer
91 Correct 3 ms 5204 KB ok, no valid answer
92 Correct 3 ms 5196 KB ok, no valid answer
93 Correct 3 ms 5168 KB ok, no valid answer
94 Correct 65 ms 19244 KB ok, correct split
95 Correct 87 ms 25680 KB ok, correct split
96 Correct 92 ms 23700 KB ok, correct split
97 Correct 25 ms 8740 KB ok, correct split
98 Correct 26 ms 9060 KB ok, correct split
99 Correct 33 ms 11732 KB ok, correct split
100 Correct 96 ms 18848 KB ok, correct split
101 Correct 81 ms 17616 KB ok, correct split
102 Correct 65 ms 16964 KB ok, correct split
103 Correct 81 ms 16596 KB ok, correct split
104 Correct 57 ms 16880 KB ok, correct split
105 Correct 32 ms 10904 KB ok, correct split
106 Correct 57 ms 16840 KB ok, correct split
107 Correct 51 ms 14616 KB ok, correct split
108 Correct 50 ms 14608 KB ok, correct split
109 Correct 79 ms 18256 KB ok, correct split
110 Correct 85 ms 19080 KB ok, correct split
111 Correct 78 ms 19140 KB ok, correct split
112 Correct 70 ms 17824 KB ok, correct split
113 Correct 71 ms 17732 KB ok, correct split
114 Correct 9 ms 6816 KB ok, correct split
115 Correct 9 ms 6484 KB ok, correct split
116 Correct 84 ms 19016 KB ok, correct split
117 Correct 79 ms 19052 KB ok, correct split
118 Correct 63 ms 16020 KB ok, correct split
119 Correct 56 ms 16020 KB ok, correct split
120 Correct 58 ms 20812 KB ok, correct split
121 Correct 48 ms 14204 KB ok, no valid answer
122 Correct 49 ms 13976 KB ok, no valid answer
123 Correct 80 ms 18832 KB ok, no valid answer
124 Correct 78 ms 18580 KB ok, no valid answer
125 Correct 52 ms 14832 KB ok, no valid answer
126 Correct 33 ms 12496 KB ok, no valid answer
127 Correct 56 ms 15928 KB ok, no valid answer