답안 #862650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862650 2023-10-18T17:24:17 Z Ahmed_Solyman Kutije (COCI21_kutije) C++14
70 / 70
140 ms 9556 KB
/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
struct DSU{
	vector<int>P,sz;
	void init(int n){
		P.resize(n+5);
		sz.assign(n+5,1);
		for(int i=0;i<n+5;i++)P[i]=i;
	}
	int find(int node){
		if(P[node]==node)return node;
		return P[node]=find(P[node]);
	}
	bool unite(int a,int b){
		int p1=find(a);
		int p2=find(b);
		if(p1==p2){
			return 0;
		}
		if(sz[p1]>sz[p2]){
			swap(p1,p2);
		}
		P[p1]=p2;
		sz[p2]+=sz[p1];
		return 1;
	}
}d;
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #ifndef ONLINE_JUDGE
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    #endif
    fast
    int n,m,q;cin>>n>>m>>q;
    d.init(n+5);
    for(int i=0;i<m;i++){
    	for(int j=1;j<=n;j++){
    		int x;cin>>x;
    		d.unite(x,j);
    	}
    }
    while(q--){
    	int x,y;cin>>x>>y;
    	cout<<(d.find(x)==d.find(y)?"DA":"NE")<<endl;
    }
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 3900 KB Output is correct
2 Correct 71 ms 3488 KB Output is correct
3 Correct 60 ms 3400 KB Output is correct
4 Correct 73 ms 3852 KB Output is correct
5 Correct 74 ms 3928 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 472 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 472 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 476 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 3900 KB Output is correct
2 Correct 71 ms 3488 KB Output is correct
3 Correct 60 ms 3400 KB Output is correct
4 Correct 73 ms 3852 KB Output is correct
5 Correct 74 ms 3928 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 472 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 1 ms 476 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 356 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 140 ms 9396 KB Output is correct
27 Correct 124 ms 9320 KB Output is correct
28 Correct 135 ms 7736 KB Output is correct
29 Correct 126 ms 9300 KB Output is correct
30 Correct 121 ms 8000 KB Output is correct
31 Correct 102 ms 8028 KB Output is correct
32 Correct 129 ms 9528 KB Output is correct
33 Correct 131 ms 9356 KB Output is correct
34 Correct 124 ms 9384 KB Output is correct
35 Correct 136 ms 9556 KB Output is correct