# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705610 | Username4132 | Kutije (COCI21_kutije) | C++14 | 229 ms | 13920 KiB |
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<iostream>
#include<vector>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back
const int MAXN=1010;
int n, m, q, com[MAXN], stat;
vector<int> g[MAXN];
void dfs(int v){
com[v]=stat;
for(auto to:g[v]) if(!com[to]) dfs(to);
}
int main(){
scanf("%d %d %d", &n, &m, &q);
forn(f, m) forn(i, n){
int a; scanf("%d", &a);
g[a-1].PB(i);
}
forn(i, n) if(!com[i]) ++stat, dfs(i);
forn(i, q){
int a, b; scanf("%d %d", &a, &b);
printf("%s", com[a-1]==com[b-1]? "DA\n" : "NE\n");
}
}
Compilation message (stderr)
# | 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... |