oj.uz

답안 #831396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831396 2023-08-20T08:10:26 Z Minindu206 열쇠 (IOI21_keys) C++17
37 / 100
 3000 ms 24224 KB 
#include "keys.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c)
{
	int n = r.size(), m = u.size(), ans = INT_MAX;
	vector<pair<int, int>> adj[n];
	vector<int> p(n), nrooms(n, 0);
	for (int i = 0; i < m; i++)
	{
		adj[u[i]].push_back({v[i], c[i]});
		adj[v[i]].push_back({u[i], c[i]});
	}
	for (int i = 0; i < n; i++)
	{
		vector<int> key(n, 0), vis(n, 0);
		vector<int> lst[n];
		queue<int> q;

		q.push(i);
		key[r[i]] = 1;
		vis[i] = 1;
		while (!q.empty())
		{
			int node = q.front();
			q.pop();
			vector<int> nkeys;

			for (auto pi : adj[node])
			{
				if (!vis[pi.first])
				{
					if (key[pi.second])
					{
						vis[pi.first] = 1;
						q.push(pi.first);
						if (key[r[pi.first]] == 0)
						{
							key[r[pi.first]] = 1;
							nkeys.push_back(r[pi.first]);
						}
					}
					else
						lst[pi.second].push_back(pi.first);
				}
			}
			for (auto k : nkeys)
			{
				for (auto nd : lst[k])
				{
					if (!vis[nd])
					{
						q.push(nd);
						key[r[nd]] = 1;
						vis[nd] = 1;
					}
				}
				lst[k].clear();
			}
		}
		for (int j = 0; j < n; j++)
			nrooms[i] += vis[j];
		ans = min(ans, nrooms[i]);
	}
	for (int i = 0; i < n; i++)
		p[i] = (nrooms[i] == ans);
	return p;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 53 ms 596 KB Output is correct
28 Correct 51 ms 592 KB Output is correct
29 Correct 51 ms 596 KB Output is correct
30 Correct 48 ms 424 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 3 ms 308 KB Output is correct
34 Correct 23 ms 340 KB Output is correct
35 Correct 34 ms 400 KB Output is correct
36 Correct 121 ms 536 KB Output is correct
37 Correct 97 ms 532 KB Output is correct
38 Correct 147 ms 468 KB Output is correct
39 Correct 132 ms 468 KB Output is correct
40 Correct 6 ms 452 KB Output is correct
41 Correct 27 ms 468 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Execution timed out 3059 ms 24224 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 53 ms 596 KB Output is correct
28 Correct 51 ms 592 KB Output is correct
29 Correct 51 ms 596 KB Output is correct
30 Correct 48 ms 424 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 3 ms 308 KB Output is correct
34 Correct 23 ms 340 KB Output is correct
35 Correct 34 ms 400 KB Output is correct
36 Correct 121 ms 536 KB Output is correct
37 Correct 97 ms 532 KB Output is correct
38 Correct 147 ms 468 KB Output is correct
39 Correct 132 ms 468 KB Output is correct
40 Correct 6 ms 452 KB Output is correct
41 Correct 27 ms 468 KB Output is correct
42 Execution timed out 3059 ms 24224 KB Time limit exceeded
43 Halted 0 ms 0 KB -