Submission #1237326

#TimeUsernameProblemLanguageResultExecution timeMemory
1237326d4nnaeeKutije (COCI21_kutije)C++20
15 / 70
451 ms1752 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1005; int p[MAXN]; int cycle_id[MAXN]; bool visited[MAXN]; int main() { int n, m, q; cin >>n>>m>>q; for (int i = 1; i <= n; ++i) { cin >> p[i]; } int id = 0; for (int i = 1; i <= n; ++i) { if (!visited[i]) { ++id; int cur = i; while (!visited[cur]) { visited[cur] = true; cycle_id[cur] = id; cur = p[cur]; } } } while (q--) { int a, b; cin >> a >> b; if (cycle_id[a] == cycle_id[b]) cout << "DA"<<"\n"; else cout << "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...