답안 #788704

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788704	2023-07-20T13:52:00 Z	thimote75	열쇠 (IOI21_keys)	C++17	37 / 100	3000 ms	29648 KB

keys

#include <bits/stdc++.h>

using namespace std;

using idata = vector<int>;
using igrid = vector<idata>;
using t_road = pair<int, int>;
using t_roads = vector<t_road>;
using t_graph = vector<t_roads>;
using bdata = vector<bool>;

int N, M;

t_graph roads;
t_graph roads_by_key;

idata key_type;

int compute (int node) {
	bdata keys_found(N);
	bdata node_visit(N);

	queue<int> nodes;
	int size = 0;
	nodes.push(node); node_visit[node] = true;

	while (nodes.size() != 0) {
		size ++;
		int curr = nodes.front(); nodes.pop();

		for (const auto &road : roads[curr]) {
			int type = road.second; int next = road.first;
			if (!keys_found[type]) continue ;
			if (node_visit[next]) continue ;
			node_visit[next] = true;
			nodes.push(next);
		}

		if (keys_found[key_type[curr]]) continue ;
		keys_found[key_type[curr]] = true;

		for (const auto &road : roads_by_key[key_type[curr]]) {
			int a = road.first; int b = road.second;

			if (!(node_visit[a] ^ node_visit[b])) continue ;
			int next = node_visit[a] ? b : a;

			node_visit[next] = true;
			nodes.push(next);
		}
	}

	return size;
}

idata find_reachable(idata r, idata u, idata v, idata c) {
	N = r.size();
	M = u.size();

	key_type = r;
	roads.resize(N);
	roads_by_key.resize(N);

	for (int i = 0; i < M; i ++) {
		roads[u[i]].push_back({ v[i], c[i] });
		roads[v[i]].push_back({ u[i], c[i] });

		roads_by_key[c[i]].push_back({ u[i], v[i] });
	}

	idata ans(N);
	for (int i = 0; i < N; i ++) ans[i] = compute(i);

	int mn = 1e9;
	for (int u : ans) mn = min(mn, u);
	for (int i = 0; i < N; i ++)
		ans[i] = ans[i] == mn;

	return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	30 ms	596 KB	Output is correct
28	Correct	31 ms	628 KB	Output is correct
29	Correct	24 ms	596 KB	Output is correct
30	Correct	19 ms	452 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	12 ms	448 KB	Output is correct
35	Correct	17 ms	436 KB	Output is correct
36	Correct	72 ms	560 KB	Output is correct
37	Correct	48 ms	480 KB	Output is correct
38	Correct	95 ms	600 KB	Output is correct
39	Correct	101 ms	600 KB	Output is correct
40	Correct	6 ms	340 KB	Output is correct
41	Correct	35 ms	468 KB	Output is correct

Subtask #4
0 / 30.0

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

Subtask #5
0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	300 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	30 ms	596 KB	Output is correct
28	Correct	31 ms	628 KB	Output is correct
29	Correct	24 ms	596 KB	Output is correct
30	Correct	19 ms	452 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	12 ms	448 KB	Output is correct
35	Correct	17 ms	436 KB	Output is correct
36	Correct	72 ms	560 KB	Output is correct
37	Correct	48 ms	480 KB	Output is correct
38	Correct	95 ms	600 KB	Output is correct
39	Correct	101 ms	600 KB	Output is correct
40	Correct	6 ms	340 KB	Output is correct
41	Correct	35 ms	468 KB	Output is correct
42	Execution timed out	3060 ms	29648 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

답안 #788704

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