# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
724515 | TheSahib | Kutije (COCI21_kutije) | C++17 | 1082 ms | 18884 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>
#pragma GCC optimize("O3")
#define ll long long
#define oo 1e9 + 9
#define pii pair<ll, ll>
using namespace std;
const int MAX = 1001;
int n, m, q;
int adj[MAX][MAX];
vector<int> g[MAX];
int dist[MAX][MAX];
bool visited[MAX];
void dfs(int node, int p){
visited[node] = 1;
dist[p][node] = 1;
for (int& to:g[node])
{
if(!visited[to]){
dfs(to, p);
}
}
}
int main(){
cin >> n >> m >> q;
for (int i = 0; i < m; i++)
{
for (int j = 1; j <= n; j++)
{
int a; scanf("%d", &a);
if(j == a) continue;
adj[j][a] = 1;
}
}
for (int i = 1; i < MAX; i++)
{
for (int j = 1; j < MAX; j++)
{
if(adj[i][j]) g[i].push_back(j);
}
}
for (int i = 1; i <= n; i++)
{
memset(visited, 0, sizeof(visited));
dfs(i, i);
}
while(q--){
int a, b; scanf("%d%d", &a, &b);
if(dist[a][b]){
cout << "DA\n";
}
else{
cout << "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... |