oj.uz

답안 #984313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984313 2024-05-16T13:08:44 Z michified Split the Attractions (IOI19_split) C++17
40 / 100
 137 ms 45400 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

struct node_t {
	int ord, low, ss, par;
	vector<int> adj;
	unordered_set<int> used;
};

vector<node_t> nodes;
vector<int> thing, ord2id, ans;
int lo, t = 0, n, remain;
bool good = true;
pair<int, int> found = {-1, -1};

void dfs(int cur, int par) {
	if (not good) return;
	node_t& u = nodes[cur];
	u.par = par;
	int mcss = 0;
	t++;
	u.ord = u.low = t;
	u.ss = 1;
	ord2id[t] = cur;
	for (int v : u.adj) {
		if (not nodes[v].ord) {
			dfs(v, cur);
			u.low = min(u.low, nodes[v].low);
			u.used.insert(v);
			nodes[v].used.insert(cur);
			u.ss += nodes[v].ss;
			mcss = max(mcss, nodes[v].ss);
		} else if (v != par) {
			u.low = min(u.low, nodes[v].ord);
		} 
	}
	if (found.first != -1) return;
	if (mcss < lo and u.ss >= lo) {
		if (par == -1) {
			good = false;
			return;
		}
		if (u.ss <= n - lo) {
			u.used.erase(par);
			nodes[par].used.erase(cur);
			found = make_pair(cur, par);
			return;
		}
		int curss = u.ss;
		for (int v : u.adj) {
			if (v == par) continue;
			if (nodes[v].low < u.low) {
				curss -= nodes[v].ss;
				u.used.erase(v);
				nodes[v].used.erase(cur);
				nodes[ord2id[nodes[v].low]].used.insert(v);
				nodes[v].used.insert(ord2id[nodes[v].low]);
				if (curss <= n - lo) { 
					found = make_pair(cur, par);
					return;
				}
			}
		}
		good = false;
	} 
}

bool construct(int cur, int group, int par) {
	if (remain == 0) return true;
	ans[cur] = group;
	remain--;
	bool res = false;
	for (int v : nodes[cur].used) {
		if (v == par) continue;
		res = res or construct(v, group, cur);
	}
	return res;
}

vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
	int i;
	n = N;
	nodes.resize(n);
	ord2id.resize(n + 1);
	lo = min(min(a, b), c);
	vector<pair<int, int>> thing = {{a, 1}, {b, 2}, {c, 3}};
	sort(thing.begin(), thing.end());
	for (i = 0; i < q.size(); i++) {
		nodes[p[i]].adj.push_back(q[i]);
		nodes[q[i]].adj.push_back(p[i]);
	}
	dfs(0, -1);
	ans.resize(n);
	if (not good) return ans;
	remain = thing[1].first;
	bool ok = construct(found.first, thing[1].second, found.second);
	if (not ok) {
		remain = thing[1].first;
		construct(found.first, 0, found.second);
		remain = thing[0].first;
		construct(found.first, thing[0].second, found.second);
		remain = thing[1].first;
		construct(found.second, thing[1].second, found.first);
	} else {
		remain = thing[0].first;
		construct(found.second, thing[0].second, found.first);
	}
	for (i = 0; i < n; i++) {
		if (ans[i] == 0) ans[i] = thing[2].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:89:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |  for (i = 0; i < q.size(); i++) {
      |              ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 112 ms 44740 KB ok, correct split
8 Correct 106 ms 41144 KB ok, correct split
9 Correct 118 ms 40016 KB ok, correct split
10 Correct 102 ms 45400 KB ok, correct split
11 Correct 113 ms 45384 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 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 125 ms 39576 KB ok, correct split
5 Correct 88 ms 32852 KB ok, correct split
6 Correct 110 ms 45392 KB ok, correct split
7 Correct 99 ms 40868 KB ok, correct split
8 Correct 137 ms 34888 KB ok, correct split
9 Correct 92 ms 32848 KB ok, correct split
10 Correct 90 ms 34648 KB ok, correct split
11 Correct 84 ms 34424 KB ok, correct split
12 Correct 93 ms 34528 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB ok, correct split
2 Correct 104 ms 32936 KB ok, correct split
3 Correct 25 ms 13404 KB ok, correct split
4 Correct 1 ms 348 KB ok, correct split
5 Correct 113 ms 36972 KB ok, correct split
6 Correct 117 ms 36540 KB ok, correct split
7 Correct 115 ms 36180 KB ok, correct split
8 Correct 102 ms 38404 KB ok, correct split
9 Correct 92 ms 35964 KB ok, correct split
10 Correct 22 ms 11096 KB ok, no valid answer
11 Correct 32 ms 16732 KB ok, no valid answer
12 Correct 83 ms 33760 KB ok, no valid answer
13 Correct 122 ms 32960 KB ok, no valid answer
14 Correct 96 ms 34528 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 348 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 1116 KB ok, correct split
10 Correct 2 ms 1116 KB ok, correct split
11 Correct 0 ms 348 KB ok, correct split
12 Correct 3 ms 1116 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 0 ms 348 KB ok, correct split
16 Correct 0 ms 348 KB ok, correct split
17 Correct 0 ms 348 KB ok, correct split
18 Correct 0 ms 348 KB ok, correct split
19 Correct 1 ms 856 KB ok, correct split
20 Correct 1 ms 604 KB ok, correct split
21 Correct 3 ms 1176 KB ok, correct split
22 Correct 2 ms 1116 KB ok, correct split
23 Correct 2 ms 1372 KB ok, correct split
24 Correct 2 ms 1372 KB ok, correct split
25 Correct 2 ms 1116 KB ok, correct split
26 Incorrect 2 ms 1116 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB ok, correct split
2 Correct 0 ms 348 KB ok, correct split
3 Correct 0 ms 348 KB ok, correct split
4 Correct 0 ms 348 KB ok, correct split
5 Correct 0 ms 348 KB ok, correct split
6 Correct 0 ms 348 KB ok, correct split
7 Correct 112 ms 44740 KB ok, correct split
8 Correct 106 ms 41144 KB ok, correct split
9 Correct 118 ms 40016 KB ok, correct split
10 Correct 102 ms 45400 KB ok, correct split
11 Correct 113 ms 45384 KB ok, correct split
12 Correct 0 ms 344 KB ok, correct split
13 Correct 0 ms 348 KB ok, correct split
14 Correct 0 ms 348 KB ok, correct split
15 Correct 125 ms 39576 KB ok, correct split
16 Correct 88 ms 32852 KB ok, correct split
17 Correct 110 ms 45392 KB ok, correct split
18 Correct 99 ms 40868 KB ok, correct split
19 Correct 137 ms 34888 KB ok, correct split
20 Correct 92 ms 32848 KB ok, correct split
21 Correct 90 ms 34648 KB ok, correct split
22 Correct 84 ms 34424 KB ok, correct split
23 Correct 93 ms 34528 KB ok, correct split
24 Correct 0 ms 344 KB ok, correct split
25 Correct 104 ms 32936 KB ok, correct split
26 Correct 25 ms 13404 KB ok, correct split
27 Correct 1 ms 348 KB ok, correct split
28 Correct 113 ms 36972 KB ok, correct split
29 Correct 117 ms 36540 KB ok, correct split
30 Correct 115 ms 36180 KB ok, correct split
31 Correct 102 ms 38404 KB ok, correct split
32 Correct 92 ms 35964 KB ok, correct split
33 Correct 22 ms 11096 KB ok, no valid answer
34 Correct 32 ms 16732 KB ok, no valid answer
35 Correct 83 ms 33760 KB ok, no valid answer
36 Correct 122 ms 32960 KB ok, no valid answer
37 Correct 96 ms 34528 KB ok, no valid answer
38 Correct 0 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 348 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 1116 KB ok, correct split
47 Correct 2 ms 1116 KB ok, correct split
48 Correct 0 ms 348 KB ok, correct split
49 Correct 3 ms 1116 KB ok, correct split
50 Correct 0 ms 348 KB ok, correct split
51 Correct 0 ms 348 KB ok, correct split
52 Correct 0 ms 348 KB ok, correct split
53 Correct 0 ms 348 KB ok, correct split
54 Correct 0 ms 348 KB ok, correct split
55 Correct 0 ms 348 KB ok, correct split
56 Correct 1 ms 856 KB ok, correct split
57 Correct 1 ms 604 KB ok, correct split
58 Correct 3 ms 1176 KB ok, correct split
59 Correct 2 ms 1116 KB ok, correct split
60 Correct 2 ms 1372 KB ok, correct split
61 Correct 2 ms 1372 KB ok, correct split
62 Correct 2 ms 1116 KB ok, correct split
63 Incorrect 2 ms 1116 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -