This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
set<int> viz[1005];
int vis[1005], c[1005];
void dfs(int x, int y){
vis[x] = 1; c[x] = y;
for(auto v : viz[x]) if(!vis[v]) dfs(v, y);
}
int main(){
ios::sync_with_stdio(false); cin.tie(NULL);
int n, m, q; cin >> n >> m >> q;
for(int i = 0; i < m; i++){
for(int j = 1; j <= n; j++){
int a; cin >> a;
viz[j].insert(a);
}
}
for(int i = 1; i <= n; i++) if(!vis[i]) dfs(i, i);
while(q--){
int a, b; cin >> a >> b;
if(c[a] == c[b]) cout << "DA" << endl;
else cout << "NE" << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |