답안 #1102523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102523 2024-10-18T08:26:45 Z EkinOnal Kutije (COCI21_kutije) C++14
70 / 70
98 ms 1876 KB
#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;

const int N = 1000+5;

struct DSU {
	int e[N]; 
	DSU(){for(int i = 1; i < N-2; i++) e[i]=-1;}

	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x;  return 1;
	}
};

DSU t;
int n,m,a,b;
int q;
int32_t main(){
	ios_base::sync_with_stdio(0); cin.tie(0);		
	cin>>n>>m>>q;

//	t.init(n+2);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			cin>>a; 
			t.unite(j,a);
		}
	}
	while(q--){
		cin>>a>>b;
		if(t.sameSet(a,b)) cout<<"DA\n";
		else cout<<"NE\n";
	}
 		
	return 0;	 			
}
# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 1864 KB Output is correct
2 Correct 42 ms 1608 KB Output is correct
3 Correct 41 ms 1616 KB Output is correct
4 Correct 47 ms 1864 KB Output is correct
5 Correct 52 ms 1872 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 508 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 508 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 1864 KB Output is correct
2 Correct 42 ms 1608 KB Output is correct
3 Correct 41 ms 1616 KB Output is correct
4 Correct 47 ms 1864 KB Output is correct
5 Correct 52 ms 1872 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 90 ms 1864 KB Output is correct
27 Correct 94 ms 1864 KB Output is correct
28 Correct 73 ms 1608 KB Output is correct
29 Correct 89 ms 1864 KB Output is correct
30 Correct 86 ms 1616 KB Output is correct
31 Correct 75 ms 1608 KB Output is correct
32 Correct 87 ms 1868 KB Output is correct
33 Correct 98 ms 1864 KB Output is correct
34 Correct 94 ms 1864 KB Output is correct
35 Correct 93 ms 1876 KB Output is correct