제출 #1236092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236092		PlayVoltz	Kutije (COCI21_kutije)	C++20	70 / 70	88 ms	1864 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

vector<int> dsu;

int fp(int a){
	if (dsu[a]==-1)return a;
	return dsu[a]=fp(dsu[a]);
}

void merge(int a, int b){
	a=fp(a), b=fp(b);
	if (a!=b)dsu[a]=b;
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, q, a, b;
	cin>>n>>m>>q;
	dsu.resize(n+1, -1);
	while (m--)for (int i=1; i<=n; ++i)cin>>a, merge(a, i);
	while (q--){
		cin>>a>>b;
		if (fp(a)==fp(b))cout<<"DA\n";
		else cout<<"NE\n";
	}
}

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