oj.uz

Submission #509684

# Submission time Handle Problem Language Result Execution time Memory
509684 2022-01-14T08:11:29 Z KoD Kutije (COCI21_kutije) C++17
35 / 70
 1000 ms 2852 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, M, Q;
    std::cin >> N >> M >> Q;
    vector edge(N, vector<char>(N));
    for (int i = 0; i < M; ++i) {
        for (int j = 0; j < N; ++j) {
            int p;
            std::cin >> p;
            edge[p - 1][j] = true;
        }
    }
    for (int k = 0; k < N; ++k) {
        for (int i = 0; i < N; ++i) {
            if (edge[i][k]) {
                for (int j = 0; j < N; ++j) {
                    if (edge[k][j]) {
                        edge[i][j] = true;
                    }
                }
            }
        }
    }
    while (Q--) {
        int a, b;
        std::cin >> a >> b;
        std::cout << (edge[a - 1][b - 1] ? "DA" : "NE") << '\n';
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 2852 KB Output is correct
2 Correct 81 ms 2372 KB Output is correct
3 Correct 73 ms 2360 KB Output is correct
4 Correct 98 ms 2692 KB Output is correct
5 Correct 91 ms 2796 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 4 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 4 ms 204 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 4 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 5 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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 2852 KB Output is correct
2 Correct 81 ms 2372 KB Output is correct
3 Correct 73 ms 2360 KB Output is correct
4 Correct 98 ms 2692 KB Output is correct
5 Correct 91 ms 2796 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 324 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 5 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 1 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 4 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 5 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 354 ms 2708 KB Output is correct
27 Correct 171 ms 2764 KB Output is correct
28 Execution timed out 1098 ms 1100 KB Time limit exceeded
29 Halted 0 ms 0 KB -