| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 693035 |
2023-02-02T09:33:57 Z |
zeroesandones |
Keys (IOI21_keys) |
C++17 |
|
3000 ms |
8524 KB |
#include <bits/stdc++.h>
#include "keys.h"
using namespace std;
using ll = long long;
using vi = vector<ll>;
#define pb emplace_back
const int mxN = 2005;
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
int n = r.size();
int m = u.size();
int p[n] = {};
vector<bool> vis(n), key(n);
for(int x = 0; x < n; ++x) {
vis.assign(n, false);
key.assign(n, false);
vis[x] = true;
key[r[x]] = true;
while(true) {
bool relax = false;
for(int i = 0; i < m; ++i) {
if(key[c[i]]) {
if(vis[u[i]] && !vis[v[i]]) {
vis[v[i]] = true;
key[r[v[i]]] = true;
relax = true;
} else if(vis[v[i]] && !vis[u[i]]) {
vis[u[i]] = true;
key[r[u[i]]] = true;
relax = true;
}
}
}
if(!relax) break;
}
for(int i = 0; i < n; ++i) {
p[x] += (vis[i]);
}
}
ll mn = *min_element(p, p + n);
vector<int> ans(n, 1);
for(int i = 0; i < n; ++i) {
ans[i] = (p[i] == mn);
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
2 ms |
212 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
2 ms |
212 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| 10 |
Correct |
4 ms |
212 KB |
Output is correct |
| 11 |
Correct |
4 ms |
212 KB |
Output is correct |
| 12 |
Correct |
4 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 |
3 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 |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
256 KB |
Output is correct |
| 23 |
Correct |
4 ms |
212 KB |
Output is correct |
| 24 |
Correct |
8 ms |
212 KB |
Output is correct |
| 25 |
Correct |
10 ms |
300 KB |
Output is correct |
| 26 |
Correct |
16 ms |
304 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
2 ms |
212 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| 10 |
Correct |
4 ms |
212 KB |
Output is correct |
| 11 |
Correct |
4 ms |
212 KB |
Output is correct |
| 12 |
Correct |
4 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 |
3 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 |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
256 KB |
Output is correct |
| 23 |
Correct |
4 ms |
212 KB |
Output is correct |
| 24 |
Correct |
8 ms |
212 KB |
Output is correct |
| 25 |
Correct |
10 ms |
300 KB |
Output is correct |
| 26 |
Correct |
16 ms |
304 KB |
Output is correct |
| 27 |
Correct |
2504 ms |
348 KB |
Output is correct |
| 28 |
Correct |
2481 ms |
344 KB |
Output is correct |
| 29 |
Correct |
2409 ms |
344 KB |
Output is correct |
| 30 |
Correct |
92 ms |
336 KB |
Output is correct |
| 31 |
Correct |
2 ms |
212 KB |
Output is correct |
| 32 |
Correct |
2 ms |
212 KB |
Output is correct |
| 33 |
Correct |
4 ms |
212 KB |
Output is correct |
| 34 |
Correct |
15 ms |
212 KB |
Output is correct |
| 35 |
Correct |
339 ms |
332 KB |
Output is correct |
| 36 |
Correct |
2622 ms |
340 KB |
Output is correct |
| 37 |
Execution timed out |
3075 ms |
340 KB |
Time limit exceeded |
| 38 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
2 ms |
212 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| 10 |
Execution timed out |
3055 ms |
8524 KB |
Time limit exceeded |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 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 |
2 ms |
212 KB |
Output is correct |
| 9 |
Correct |
2 ms |
212 KB |
Output is correct |
| 10 |
Correct |
4 ms |
212 KB |
Output is correct |
| 11 |
Correct |
4 ms |
212 KB |
Output is correct |
| 12 |
Correct |
4 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 |
3 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 |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
256 KB |
Output is correct |
| 23 |
Correct |
4 ms |
212 KB |
Output is correct |
| 24 |
Correct |
8 ms |
212 KB |
Output is correct |
| 25 |
Correct |
10 ms |
300 KB |
Output is correct |
| 26 |
Correct |
16 ms |
304 KB |
Output is correct |
| 27 |
Correct |
2504 ms |
348 KB |
Output is correct |
| 28 |
Correct |
2481 ms |
344 KB |
Output is correct |
| 29 |
Correct |
2409 ms |
344 KB |
Output is correct |
| 30 |
Correct |
92 ms |
336 KB |
Output is correct |
| 31 |
Correct |
2 ms |
212 KB |
Output is correct |
| 32 |
Correct |
2 ms |
212 KB |
Output is correct |
| 33 |
Correct |
4 ms |
212 KB |
Output is correct |
| 34 |
Correct |
15 ms |
212 KB |
Output is correct |
| 35 |
Correct |
339 ms |
332 KB |
Output is correct |
| 36 |
Correct |
2622 ms |
340 KB |
Output is correct |
| 37 |
Execution timed out |
3075 ms |
340 KB |
Time limit exceeded |
| 38 |
Halted |
0 ms |
0 KB |
- |
