제출 #1346489

#제출 시각아이디문제언어결과실행 시간메모리
1346489msb.83Kutije (COCI21_kutije)C++20
0 / 70
32 ms1780 KiB
//Rahman ve Rahim olan Allah'ın adıyla
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mid ((st+end)/2)
#define fi first
#define se second
const int INF=1e15+5;
const int E16=1e6;
const int ONE=1;
const int TWO=2;
const int ZERO=0;
const int MOD=1e9+7;//(x+MOD)%MOD
//el.erase(unique(el.begin(),el.end()),el.end());
vector<int>par;
int ff(int i){
    if(i==par[i]){return i;}
    else{return par[i]=ff(par[i]);}
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,m,qry,a;cin>>n>>m>>qry;par.resize(n);
    for(int i=0;i<n;i++){par[i]=i;}
    while(m--){
        for(int i=0;i<n;i++){
            cin>>a;a--;if(a==i) continue;
            int roa=ff(a),rob=ff(i);
            if(roa!=rob){
                par[roa]=rob;
            }
        }
    }int b;
    while(qry--){
        cin>>a>>b;
        if(ff(a)==ff(b)) cout<<"NE\n";
        else cout<<"DA\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...