제출 #876545

#제출 시각아이디문제언어결과실행 시간메모리
876545Youssif_ElkadiKutije (COCI21_kutije)C++17
70 / 70
893 ms14200 KiB
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e3 + 5, mod = 998244353;
vector<int> adj[N];
bool vis[N][N];
void dfs(int u, int src)
{
    vis[src][u] = 1;
    for (auto v : adj[u])
        if (!vis[src][v])
            dfs(v, src);
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 0; i < m; i++)
    {
        for (int i = 1; i <= n; i++)
        {
            int x;
            cin >> x;
            adj[i].push_back(x);
        }
    }
    for (int i = 1; i <= n; i++)
        dfs(i, i);
    while (q--)
    {
        int u, v;
        cin >> u >> v;
        if (vis[u][v])
            cout << "DA\n";
        else
            cout << "NE\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...