Submission #437478

# Submission time Handle Problem Language Result Execution time Memory
437478 2021-06-26T11:12:44 Z WnRS Keys (IOI21_keys) C++17
20 / 100
2500 ms 1048580 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();
    vector<pair<int,int>>adj[n];
    for(int i = 0 ; i < m ; i++) {
        adj[u[i]].push_back({v[i],i});
        adj[v[i]].push_back({u[i],i});
    }
    int mn=INT_MAX;
    vector<int>mini;
    vector<vector<bool>>vis(n,vector<bool>(n,false));
    for(int i = 0 ; i < n ; i++) {
        vector<bool>keys(n,false);
        queue<int>q;
        q.push(i);
        bool change=true;
        while(change) {
        vector<int>restore;
            change=false;
            int sz = q.size();
            while(sz--) {
                int node = q.front();
                q.pop();
                keys[r[node]]=true;
                restore.push_back(node);
                if(!vis[i][node]) {
                    for(int j = 0 ; j < n ; j++) {
                        if(vis[node][j]) {
                            if(!vis[i][j]) q.push(j);
                            vis[i][j]=true;
                            keys[r[j]]=true;
                        }
                    }
                    vis[i][node]=true;
                }
                for(auto z : adj[node]) {
                    if(keys[c[z.second]] && !vis[i][z.first]) {
                        change=true;
                        q.push(z.first);
                    }
                }
            }
         for(auto z : restore) q.push(z);
        }
    int curr=0;
    for(auto z : vis[i]) curr+=z;
     if(curr < mn) {
        mini.clear();
        mini.push_back(i);
        mn=curr;
     } else if(curr == mn) mini.push_back(i);
    }
    vector<int>ans(n,0);
    for(auto z : mini) ans[z]=1;
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 26 ms 312 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 4 ms 204 KB Output is correct
26 Correct 3 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 26 ms 312 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 4 ms 204 KB Output is correct
26 Correct 3 ms 204 KB Output is correct
27 Correct 152 ms 1220 KB Output is correct
28 Correct 164 ms 1100 KB Output is correct
29 Correct 226 ms 1100 KB Output is correct
30 Correct 28 ms 460 KB Output is correct
31 Correct 9 ms 460 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 10 ms 460 KB Output is correct
34 Execution timed out 2569 ms 548 KB Time limit exceeded
35 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Runtime error 1058 ms 1048580 KB Execution killed with signal 9
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 2 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 26 ms 312 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 4 ms 204 KB Output is correct
26 Correct 3 ms 204 KB Output is correct
27 Correct 152 ms 1220 KB Output is correct
28 Correct 164 ms 1100 KB Output is correct
29 Correct 226 ms 1100 KB Output is correct
30 Correct 28 ms 460 KB Output is correct
31 Correct 9 ms 460 KB Output is correct
32 Correct 3 ms 332 KB Output is correct
33 Correct 10 ms 460 KB Output is correct
34 Execution timed out 2569 ms 548 KB Time limit exceeded
35 Halted 0 ms 0 KB -