# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720690 | Yell0 | Kutije (COCI21_kutije) | C++17 | 804 ms | 14796 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 <bits/stdc++.h>
using namespace std;
const int MN=1002;
int n,m,q;
vector<int> adj[MN];
bool vis[MN];
bool dest[MN][MN];
void dfs(int u,int p) {
vis[u]=1;
dest[p][u]=1;
for(int v:adj[u])
if(!vis[v])
dfs(v,p);
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
cin>>n>>m>>q;
for(int i=1;i<=m;i++)
for(int u=1,v;u<=n;u++) {
cin>>v;
adj[v].push_back(u);
}
memset(dest,0,sizeof(dest));
for(int i=1;i<=n;i++) {
memset(vis,0,sizeof(vis));
dfs(i,i);
}
int a,b;
while(q--) {
cin>>a>>b;
if(dest[a][b]) cout<<"DA\n";
else cout<<"NE\n";
}
return 0;
}
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... |