답안 #862585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862585 2023-10-18T14:28:10 Z Mizo_Compiler Kutije (COCI21_kutije) C++14
70 / 70
119 ms 5972 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 1005;
int p[N], sz[N];

int findp(int u) {
	return p[u] = (p[u] == u ? u : findp(p[u]));
}

void merge(int u, int v) {
	u = findp(u), v = findp(v);
	if (u == v)return;
	if (sz[u] < sz[v])swap(u, v);
	sz[u] += sz[v];
	p[v] = u;
}

int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 1; i <= n; i++) {
		p[i] = i;
		sz[i] = 1;
	}
	while (m--) {
		for (int i = 1; i <= n; i++) {
			int x;
			cin >> x;
			merge(i, x);	
		}
	}
	while (q--) {
		int a, b;
		cin >> a >> b;
		cout << (findp(a) == findp(b) ? "DA\n" : "NE\n");
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 3924 KB Output is correct
2 Correct 49 ms 3376 KB Output is correct
3 Correct 46 ms 3408 KB Output is correct
4 Correct 56 ms 3920 KB Output is correct
5 Correct 61 ms 3800 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 476 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 352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 476 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 352 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 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 348 KB Output is correct
16 Correct 1 ms 488 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 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 3924 KB Output is correct
2 Correct 49 ms 3376 KB Output is correct
3 Correct 46 ms 3408 KB Output is correct
4 Correct 56 ms 3920 KB Output is correct
5 Correct 61 ms 3800 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 468 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 352 KB Output is correct
12 Correct 1 ms 476 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 352 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 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 348 KB Output is correct
21 Correct 1 ms 488 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 104 ms 5972 KB Output is correct
27 Correct 108 ms 5904 KB Output is correct
28 Correct 87 ms 4944 KB Output is correct
29 Correct 105 ms 5688 KB Output is correct
30 Correct 98 ms 5160 KB Output is correct
31 Correct 91 ms 5240 KB Output is correct
32 Correct 111 ms 5796 KB Output is correct
33 Correct 112 ms 5928 KB Output is correct
34 Correct 106 ms 5820 KB Output is correct
35 Correct 119 ms 5972 KB Output is correct