Submission #720688

#	Time	Username	Problem	Language	Result	Execution time	Memory
720688		Yell0	Kutije (COCI21_kutije)	C++17	35 / 70	1012 ms	42012 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const int MN=1002;
int n,m,q;
vector<int> adj[MN];
bool vis[MN];
unordered_set<int> dest[MN];

void dfs(int u,int p) {
    vis[u]=1;
    dest[p].insert(u);
    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);
        }
    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].count(b)) cout<<"DA\n";
        else cout<<"NE\n";
    }
    return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 0 / 35