# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
507606 | t0nhou | Kutije (COCI21_kutije) | C++17 | 1012 ms | 52548 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>
#define endl '\n'
using namespace std;
vector<int> viz[1005];
int vis[1005];
void dfs(int x){
vis[x] = 1;
for(int i = 0; i < viz[x].size(); i++){
int v = viz[x][i];
if(!vis[v]) dfs(v);
}
}
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].push_back(a);
}
}
set<int> s[1005];
for(int i = 1; i <= n; i++){
dfs(i);
for(int j = 1; j <= n; j++){
if(vis[j]) s[i].insert(j);
vis[j] = 0;
}
}
while(q--){
int a, b; cin >> a >> b;
if(s[a].find(b) != s[a].end()) cout << "DA" << endl;
else cout << "NE" << endl;
}
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... |