# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
817028 |
2023-08-09T08:41:50 Z |
aVe |
Keys (IOI21_keys) |
C++17 |
|
3000 ms |
451328 KB |
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
int n, m;
vector<pii> G[100100];
vi find_reachable(vi r, vi u, vi v, vi c) {
n = (int)r.size();
m = (int)c.size();
vi reach(n, 0);
for(int i = 0; i < (int)u.size(); i++){
G[u[i]].pb(mp(v[i], c[i]));
G[v[i]].pb(mp(u[i], c[i]));
}
for(int room = 0; room < n; room++){
queue<pair<int, vector<bool>>> q;
vector<bool> ini(n, false);
bool vis[n];
memset(vis, false, sizeof vis);
vis[room] = true;
ini[r[room]] = true;
q.push(mp(room, ini));
while(!q.empty()){
int at = q.front().first;
vector<bool> ava = q.front().second;
if(!ava[r[at]]) ava[r[at]] = true;
q.pop();
for(auto next : G[at]){
if(ava[next.second] && !vis[next.first]){
vis[next.first] = true;
q.push(mp(next.first, ava));
}
}
}
int cnt = 0;
for(int i = 0; i < n; i++){
if(vis[i]) cnt++;
}
reach[room] = cnt;
}
int sm = *min_element(reach.begin(), reach.end());
vi ans(n, 0);
for(int i = 0; i < n; i++){
if(reach[i] == sm)
ans[i] = 1;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2572 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
4 ms |
2644 KB |
Output is correct |
9 |
Correct |
6 ms |
2660 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2572 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
4 ms |
2644 KB |
Output is correct |
9 |
Correct |
6 ms |
2660 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2680 KB |
Output is correct |
13 |
Correct |
1 ms |
2644 KB |
Output is correct |
14 |
Correct |
1 ms |
2644 KB |
Output is correct |
15 |
Correct |
3 ms |
2644 KB |
Output is correct |
16 |
Correct |
1 ms |
2644 KB |
Output is correct |
17 |
Incorrect |
2 ms |
2640 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2572 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
4 ms |
2644 KB |
Output is correct |
9 |
Correct |
6 ms |
2660 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2680 KB |
Output is correct |
13 |
Correct |
1 ms |
2644 KB |
Output is correct |
14 |
Correct |
1 ms |
2644 KB |
Output is correct |
15 |
Correct |
3 ms |
2644 KB |
Output is correct |
16 |
Correct |
1 ms |
2644 KB |
Output is correct |
17 |
Incorrect |
2 ms |
2640 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2572 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
4 ms |
2644 KB |
Output is correct |
9 |
Correct |
6 ms |
2660 KB |
Output is correct |
10 |
Execution timed out |
3072 ms |
451328 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
3 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2572 KB |
Output is correct |
6 |
Correct |
2 ms |
2644 KB |
Output is correct |
7 |
Correct |
2 ms |
2644 KB |
Output is correct |
8 |
Correct |
4 ms |
2644 KB |
Output is correct |
9 |
Correct |
6 ms |
2660 KB |
Output is correct |
10 |
Correct |
2 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
2 ms |
2680 KB |
Output is correct |
13 |
Correct |
1 ms |
2644 KB |
Output is correct |
14 |
Correct |
1 ms |
2644 KB |
Output is correct |
15 |
Correct |
3 ms |
2644 KB |
Output is correct |
16 |
Correct |
1 ms |
2644 KB |
Output is correct |
17 |
Incorrect |
2 ms |
2640 KB |
Output isn't correct |
18 |
Halted |
0 ms |
0 KB |
- |