oj.uz

답안 #932612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932612 2024-02-23T23:20:49 Z Programmer123 열쇠 (IOI21_keys) C++17
37 / 100
 3000 ms 28516 KB 
#include <bits/stdc++.h>

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
    std::vector<int> ans(r.size(), 1);
    int N = r.size();
    int M = u.size();
    std::vector<std::pair<int, int>> edges[N];//{dest, type}
    for (int i = 0; i < M; ++i) {
        edges[u[i]].emplace_back(v[i], c[i]);
        edges[v[i]].emplace_back(u[i], c[i]);
    }
    int num[N];
    for (int i = 0; i < N; ++i) {
        bool seen[N];
        for (int j = 0; j < N; ++j) {
            seen[j] = false;
        }
        seen[i] = true;
        std::set<int> found;
        std::vector<int> next[N];
        std::queue<int> bfs;
        bfs.push(i);
        while (!bfs.empty()) {
            auto n = bfs.front();
            bfs.pop();
            if (!found.count(r[n])) {
                found.insert(r[n]);
                for (auto a: next[r[n]]) {
                    if (!seen[a]) {
                        seen[a] = true;
                        bfs.push(a);
                    }
                }
            }
            for (auto [x, t]: edges[n]) {
                if (seen[x]) continue;
                if (found.count(t)) {
                    seen[x] = true;
                    bfs.push(x);
                } else {
                    next[t].push_back(x);
                }
            }
        }
        num[i] = 0;
        for (int j = 0; j < N; ++j) {
            num[i] += seen[j];
        }
    }
    int min = INT_MAX;
    for (int i = 0; i < N; ++i) {
        min = std::min(min, num[i]);
    }
    for (int i = 0; i < N; ++i) {
        ans[i] = num[i] == min;
    }
    return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 3 ms 432 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 7 ms 344 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 3 ms 432 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 226 ms 604 KB Output is correct
28 Correct 230 ms 820 KB Output is correct
29 Correct 227 ms 816 KB Output is correct
30 Correct 104 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 552 KB Output is correct
34 Correct 70 ms 344 KB Output is correct
35 Correct 116 ms 568 KB Output is correct
36 Correct 521 ms 724 KB Output is correct
37 Correct 538 ms 604 KB Output is correct
38 Correct 749 ms 600 KB Output is correct
39 Correct 741 ms 852 KB Output is correct
40 Correct 13 ms 348 KB Output is correct
41 Correct 66 ms 604 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Execution timed out 3052 ms 28516 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 3 ms 432 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 4 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 226 ms 604 KB Output is correct
28 Correct 230 ms 820 KB Output is correct
29 Correct 227 ms 816 KB Output is correct
30 Correct 104 ms 348 KB Output is correct
31 Correct 3 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 2 ms 552 KB Output is correct
34 Correct 70 ms 344 KB Output is correct
35 Correct 116 ms 568 KB Output is correct
36 Correct 521 ms 724 KB Output is correct
37 Correct 538 ms 604 KB Output is correct
38 Correct 749 ms 600 KB Output is correct
39 Correct 741 ms 852 KB Output is correct
40 Correct 13 ms 348 KB Output is correct
41 Correct 66 ms 604 KB Output is correct
42 Execution timed out 3052 ms 28516 KB Time limit exceeded
43 Halted 0 ms 0 KB -