oj.uz

답안 #1076003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076003 2024-08-26T10:23:06 Z NeroZein Simurgh (IOI17_simurgh) C++17
30 / 100
 3000 ms 3028 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_roads(int n, vector<int> eu, vector<int> ev) {
	
	int cc;
	vector<int> p(n), sz(n);
	
	function<int(int)> get = [&](int v) {
		return p[v] = (p[v] == v ? v : get(p[v]));
	};
	
	auto unite = [&](int u, int v) {
		u = get(u); v = get(v);
		if (u == v) {
			return false;
		}
		if (sz[u] > sz[v]) {
			swap(u, v);
		}
		--cc;
		p[u] = v;
		sz[v] += sz[u];
		return true;
	};
	
	auto init_dsu = [&]() {
		cc = n;
		iota(p.begin(), p.end(), 0);
		fill(sz.begin(), sz.end(), 1);
	};
	
	auto simulate = [&](vector<int> edges) {
		assert((int) edges.size() == n - 1); 
		init_dsu();
		for (int i = 0; i < n - 1; ++i) {
			unite(eu[edges[i]], ev[edges[i]]);
		}
	};
	
	int m = (int) eu.size();
	init_dsu();
	vector<int> in_tree, out_tree;
	for (int i = 0; i < m; ++i) {
		if (unite(eu[i], ev[i])) {
			in_tree.push_back(i);
		} else {
			out_tree.push_back(i);
		}
	}
	
	int x = count_common_roads(in_tree);
	vector<int> state(m, -1);
	for (int i : out_tree) {
		vector<int> unknown;
		state[i] = 0;
		assert((int) in_tree.size() == n - 1); 
		for (int j = 0; j < n - 1; ++j) {
			int label = in_tree[j];
			vector<int> tmp = in_tree;
			tmp.erase(tmp.begin() + j);
			tmp.push_back(i);
			simulate(tmp); 
			if (cc != 1) {
				continue; 
			}
			int y = count_common_roads(tmp);
			if (state[label] == -1) {
				if (y > x) {
					state[label] = 0;
					state[i] = 1;
					in_tree = tmp;
					x = y;
					break;
				} else if (y == x) {
					unknown.push_back(label);
				} else {//y < x
					state[label] = 1;
					state[i] = 0;//doesn't matter
					break; 
				}
			} else {
				if (state[label] == 1) {
					continue;
				}
				assert(state[label] == 0);
				if (y > x) {
					x = y; 
					state[i] = 1;
					in_tree = tmp;
				} else {
					assert(y == x);
					state[i] = 0;//doesn't matter
				}
				break;
			}
		}
		for (int j : unknown) {
			state[j] = state[i];
		}
	}
	return in_tree;
}
//~ int common = count_common_roads(r);

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 436 KB correct
8 Correct 1 ms 348 KB correct
9 Correct 0 ms 432 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 436 KB correct
8 Correct 1 ms 348 KB correct
9 Correct 0 ms 432 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 24 ms 344 KB correct
15 Correct 25 ms 344 KB correct
16 Correct 23 ms 348 KB correct
17 Correct 13 ms 348 KB correct
18 Correct 7 ms 432 KB correct
19 Correct 12 ms 348 KB correct
20 Correct 16 ms 348 KB correct
21 Correct 16 ms 464 KB correct
22 Correct 31 ms 344 KB correct
23 Correct 27 ms 348 KB correct
24 Correct 26 ms 348 KB correct
25 Correct 2 ms 604 KB correct
26 Correct 26 ms 452 KB correct
27 Correct 27 ms 348 KB correct
28 Correct 9 ms 448 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 27 ms 436 KB correct
31 Correct 27 ms 348 KB correct
32 Correct 28 ms 432 KB correct
33 Correct 26 ms 344 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 436 KB correct
8 Correct 1 ms 348 KB correct
9 Correct 0 ms 432 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 24 ms 344 KB correct
15 Correct 25 ms 344 KB correct
16 Correct 23 ms 348 KB correct
17 Correct 13 ms 348 KB correct
18 Correct 7 ms 432 KB correct
19 Correct 12 ms 348 KB correct
20 Correct 16 ms 348 KB correct
21 Correct 16 ms 464 KB correct
22 Correct 31 ms 344 KB correct
23 Correct 27 ms 348 KB correct
24 Correct 26 ms 348 KB correct
25 Correct 2 ms 604 KB correct
26 Correct 26 ms 452 KB correct
27 Correct 27 ms 348 KB correct
28 Correct 9 ms 448 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 27 ms 436 KB correct
31 Correct 27 ms 348 KB correct
32 Correct 28 ms 432 KB correct
33 Correct 26 ms 344 KB correct
34 Execution timed out 3059 ms 1116 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB correct
2 Correct 1 ms 348 KB correct
3 Execution timed out 3061 ms 3028 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 348 KB correct
7 Correct 0 ms 436 KB correct
8 Correct 1 ms 348 KB correct
9 Correct 0 ms 432 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 0 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 24 ms 344 KB correct
15 Correct 25 ms 344 KB correct
16 Correct 23 ms 348 KB correct
17 Correct 13 ms 348 KB correct
18 Correct 7 ms 432 KB correct
19 Correct 12 ms 348 KB correct
20 Correct 16 ms 348 KB correct
21 Correct 16 ms 464 KB correct
22 Correct 31 ms 344 KB correct
23 Correct 27 ms 348 KB correct
24 Correct 26 ms 348 KB correct
25 Correct 2 ms 604 KB correct
26 Correct 26 ms 452 KB correct
27 Correct 27 ms 348 KB correct
28 Correct 9 ms 448 KB correct
29 Correct 3 ms 348 KB correct
30 Correct 27 ms 436 KB correct
31 Correct 27 ms 348 KB correct
32 Correct 28 ms 432 KB correct
33 Correct 26 ms 344 KB correct
34 Execution timed out 3059 ms 1116 KB Time limit exceeded
35 Halted 0 ms 0 KB -