답안 #1053060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053060	2024-08-11T08:19:54 Z	MercubytheFirst	열쇠 (IOI21_keys)	C++17	37 / 100	3000 ms	31856 KB

keys

#include "keys.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
 
vector<signed> find_reachable(vector<signed> r, vector<signed> u, vector<signed> v, vector<signed> c) {
	int n = r.size();
	int m = u.size();
	vector<vector<pii> > g(n);
	for(int i = 0; i < m; ++i) {
		g[u[i]].push_back({v[i], c[i]});
		g[v[i]].push_back({u[i], c[i]});
	}
	vector<bool> vis, got_key;
	vector<vector<int> > waiting;
	auto reach_dfs = [&](auto&& dfs, int node) -> void
	{
		assert(node < (int)vis.size() and node >= 0);
		if (vis[node]) {
			return;
		}
		vis[node] = true;
		// cout << "hi " << node << ' ' << r[node] << endl;
		assert(0 <= r[node] and r[node] < (int)got_key.size());
		got_key[r[node]] = true;
		while(!waiting[r[node]].empty()) {
			if(!vis[ waiting[r[node]].back() ]) {
				int to = waiting[r[node]].back();
				assert(0 <= to and to < n);
				waiting[r[node]].pop_back();
				dfs(dfs, to);
			}
			else {
				waiting[r[node]].pop_back();
			}
		}
		for(auto [to, key] : g[node]) {
			if(vis[to]) {
				continue;
			}
			else if(!got_key[key]) {
				assert(to < n);
				waiting[key].push_back(to);
			}
			else {
				dfs(dfs, to);
			}
 
		}
	};
	vector<int> ans(n);
	for(int i = 0; i < n; ++i) {
		vis.assign(n, false);
		got_key.assign(n, false);
		waiting.assign(n, vector<int>());
		reach_dfs(reach_dfs, i);
		ans[i] = count(vis.begin(), vis.end(), true);
		// cout << i << " : ";
		// for(int j = 0; j < n; ++j)
		// 	cout << vis[j] << ' ';
		// cout << " : ";
		// for(int j = 0; j < m; ++j) {
		// 	cout << got_key[j] << ' ';
		// }
		// cout << endl;
	}
	int mn = *min_element(ans.begin(), ans.end());
	for(int& x : ans)
		x = (x == mn);
	return ans;
}
/*
7 10
0 1 1 2 2 1 2
0 1 0
0 2 0
1 2 1
1 3 0
2 3 0
3 4 1
3 5 2
4 5 0
4 6 2
5 6 1
 
 
*/

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	31 ms	604 KB	Output is correct
28	Correct	30 ms	604 KB	Output is correct
29	Correct	32 ms	600 KB	Output is correct
30	Correct	10 ms	448 KB	Output is correct
31	Correct	4 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	12 ms	628 KB	Output is correct
35	Correct	10 ms	348 KB	Output is correct
36	Correct	49 ms	760 KB	Output is correct
37	Correct	37 ms	604 KB	Output is correct
38	Correct	57 ms	604 KB	Output is correct
39	Correct	55 ms	604 KB	Output is correct
40	Correct	6 ms	348 KB	Output is correct
41	Correct	22 ms	604 KB	Output is correct

Subtask #4
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Execution timed out	3053 ms	31856 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #5
0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	456 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	436 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	436 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	31 ms	604 KB	Output is correct
28	Correct	30 ms	604 KB	Output is correct
29	Correct	32 ms	600 KB	Output is correct
30	Correct	10 ms	448 KB	Output is correct
31	Correct	4 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	12 ms	628 KB	Output is correct
35	Correct	10 ms	348 KB	Output is correct
36	Correct	49 ms	760 KB	Output is correct
37	Correct	37 ms	604 KB	Output is correct
38	Correct	57 ms	604 KB	Output is correct
39	Correct	55 ms	604 KB	Output is correct
40	Correct	6 ms	348 KB	Output is correct
41	Correct	22 ms	604 KB	Output is correct
42	Execution timed out	3053 ms	31856 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

답안 #1053060

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 11.0 / 11.0

Subtask #3 17.0 / 17.0

Subtask #4 0 / 30.0

Subtask #5 0 / 33.0

Subtask #1
9.0 / 9.0

Subtask #2
11.0 / 11.0

Subtask #3
17.0 / 17.0

Subtask #4
0 / 30.0

Subtask #5
0 / 33.0