Submission #509684

#TimeUsernameProblemLanguageResultExecution timeMemory
509684KoDKutije (COCI21_kutije)C++17
35 / 70
1098 ms2852 KiB
#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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...