oj.uz

Submission #979407

# Submission time Handle Problem Language Result Execution time Memory
979407 2024-05-10T21:07:28 Z alontanay Keys (IOI21_keys) C++17
37 / 100
 3000 ms 36424 KB 
#include "keys.h"
#include <bits/stdc++.h>
#define f first
#define s second

using namespace std;
using pi = pair<int,int>;

const int MAX_N = 3e5;
vector<pi> nei[MAX_N];
vector<pi> need_key[MAX_N];
int state[MAX_N];
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
    int n = r.size(), m = u.size();
    for(int i = 0;i < m; i ++) {
        int a = u[i], b = v[i], t = c[i];
        nei[a].push_back({b,t});
        nei[b].push_back({a,t});
    }
    vector<int> res;
    int opt_score = n;
    for(int i = 0; i < n; i ++) {
        vector<bool> vis(n);
        vis[i] = true;
        stack<int> dfs;
        vector<vector<int>> waiting(n);
        vector<int> keys(n);
        dfs.push(i);
        int cnt = 0;
        while(!dfs.empty()) {
            int cur = dfs.top();
            cnt++;
            dfs.pop();
            keys[r[cur]] = true;
            for(int w : waiting[r[cur]]) {
                if(!vis[w]) {
                    vis[w] = true;
                    dfs.push(w);
                }
            }
            waiting[r[cur]].clear();
            for(pi edge : nei[cur]) {
                if(keys[edge.s]) {
                    if(!vis[edge.f]) {
                        vis[edge.f] = true;
                        dfs.push(edge.f);
                    }
                } else {
                    waiting[edge.s].push_back(edge.f);
                }
            }
        }
        if(cnt < opt_score) {
            res.clear();
            opt_score = cnt;
        }
        if(cnt == opt_score) {
            res.push_back(i);
        }
    }
    vector<int> ans(n);
    for(int r : res) {
        ans[r] = 1;
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15604 KB Output is correct
2 Correct 5 ms 15452 KB Output is correct
3 Correct 4 ms 15452 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 3 ms 15292 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15504 KB Output is correct
9 Correct 4 ms 15452 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15604 KB Output is correct
2 Correct 5 ms 15452 KB Output is correct
3 Correct 4 ms 15452 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 3 ms 15292 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15504 KB Output is correct
9 Correct 4 ms 15452 KB Output is correct
10 Correct 4 ms 15452 KB Output is correct
11 Correct 4 ms 15544 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 4 ms 15452 KB Output is correct
15 Correct 5 ms 15448 KB Output is correct
16 Correct 3 ms 15452 KB Output is correct
17 Correct 3 ms 15452 KB Output is correct
18 Correct 4 ms 15452 KB Output is correct
19 Correct 3 ms 15452 KB Output is correct
20 Correct 4 ms 15484 KB Output is correct
21 Correct 4 ms 15452 KB Output is correct
22 Correct 4 ms 15516 KB Output is correct
23 Correct 4 ms 15448 KB Output is correct
24 Correct 5 ms 15448 KB Output is correct
25 Correct 4 ms 15452 KB Output is correct
26 Correct 4 ms 15452 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15604 KB Output is correct
2 Correct 5 ms 15452 KB Output is correct
3 Correct 4 ms 15452 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 3 ms 15292 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15504 KB Output is correct
9 Correct 4 ms 15452 KB Output is correct
10 Correct 4 ms 15452 KB Output is correct
11 Correct 4 ms 15544 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 4 ms 15452 KB Output is correct
15 Correct 5 ms 15448 KB Output is correct
16 Correct 3 ms 15452 KB Output is correct
17 Correct 3 ms 15452 KB Output is correct
18 Correct 4 ms 15452 KB Output is correct
19 Correct 3 ms 15452 KB Output is correct
20 Correct 4 ms 15484 KB Output is correct
21 Correct 4 ms 15452 KB Output is correct
22 Correct 4 ms 15516 KB Output is correct
23 Correct 4 ms 15448 KB Output is correct
24 Correct 5 ms 15448 KB Output is correct
25 Correct 4 ms 15452 KB Output is correct
26 Correct 4 ms 15452 KB Output is correct
27 Correct 53 ms 15704 KB Output is correct
28 Correct 52 ms 15752 KB Output is correct
29 Correct 52 ms 15708 KB Output is correct
30 Correct 45 ms 15632 KB Output is correct
31 Correct 5 ms 15452 KB Output is correct
32 Correct 4 ms 15448 KB Output is correct
33 Correct 5 ms 15452 KB Output is correct
34 Correct 15 ms 15612 KB Output is correct
35 Correct 21 ms 15452 KB Output is correct
36 Correct 42 ms 15704 KB Output is correct
37 Correct 41 ms 15704 KB Output is correct
38 Correct 63 ms 15696 KB Output is correct
39 Correct 66 ms 15704 KB Output is correct
40 Correct 8 ms 15452 KB Output is correct
41 Correct 29 ms 15552 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15604 KB Output is correct
2 Correct 5 ms 15452 KB Output is correct
3 Correct 4 ms 15452 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 3 ms 15292 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15504 KB Output is correct
9 Correct 4 ms 15452 KB Output is correct
10 Execution timed out 3068 ms 36424 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 15604 KB Output is correct
2 Correct 5 ms 15452 KB Output is correct
3 Correct 4 ms 15452 KB Output is correct
4 Correct 5 ms 15452 KB Output is correct
5 Correct 4 ms 15452 KB Output is correct
6 Correct 3 ms 15292 KB Output is correct
7 Correct 4 ms 15452 KB Output is correct
8 Correct 3 ms 15504 KB Output is correct
9 Correct 4 ms 15452 KB Output is correct
10 Correct 4 ms 15452 KB Output is correct
11 Correct 4 ms 15544 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 4 ms 15452 KB Output is correct
14 Correct 4 ms 15452 KB Output is correct
15 Correct 5 ms 15448 KB Output is correct
16 Correct 3 ms 15452 KB Output is correct
17 Correct 3 ms 15452 KB Output is correct
18 Correct 4 ms 15452 KB Output is correct
19 Correct 3 ms 15452 KB Output is correct
20 Correct 4 ms 15484 KB Output is correct
21 Correct 4 ms 15452 KB Output is correct
22 Correct 4 ms 15516 KB Output is correct
23 Correct 4 ms 15448 KB Output is correct
24 Correct 5 ms 15448 KB Output is correct
25 Correct 4 ms 15452 KB Output is correct
26 Correct 4 ms 15452 KB Output is correct
27 Correct 53 ms 15704 KB Output is correct
28 Correct 52 ms 15752 KB Output is correct
29 Correct 52 ms 15708 KB Output is correct
30 Correct 45 ms 15632 KB Output is correct
31 Correct 5 ms 15452 KB Output is correct
32 Correct 4 ms 15448 KB Output is correct
33 Correct 5 ms 15452 KB Output is correct
34 Correct 15 ms 15612 KB Output is correct
35 Correct 21 ms 15452 KB Output is correct
36 Correct 42 ms 15704 KB Output is correct
37 Correct 41 ms 15704 KB Output is correct
38 Correct 63 ms 15696 KB Output is correct
39 Correct 66 ms 15704 KB Output is correct
40 Correct 8 ms 15452 KB Output is correct
41 Correct 29 ms 15552 KB Output is correct
42 Execution timed out 3068 ms 36424 KB Time limit exceeded
43 Halted 0 ms 0 KB -