제출 #83303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83303		thiago4532	Pictionary (COCI18_pictionary)	C++17	28 / 140	1568 ms	2144 KiB

pictionary

#include <bits/stdc++.h>
#define div divisores

using namespace std;
const int maxn = 1010;
int pai[maxn], peso[maxn];

int n, m, q;

int gcd(int a, int b){
	return b ? gcd(b, a%b) : a;
}

void reset(){
	for(int i=1;i<=n;i++)
		pai[i] = i, peso[i] = 0;
}

int find(int u){
	return (pai[u] == u ? u : pai[u] = find(pai[u]));
}

inline void join(int a, int b){
	a = find(a);
	b = find(b);

	if(peso[a] == peso[b]) peso[b]++;
	else if(peso[a] > peso[b]) swap(a, b);

	pai[a] = b;
}

int main(){
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m >> q;

	for(int i=1;i<=q;i++){
		int a, b;
		cin >> a >> b;

		reset();

		int k;
		for(k=m;k>=1;k--){
			for(int i=2;i*k<=n;i++)
				if(find(k) != find(i*k)) join(k, i*k);

			if(find(a) == find(b))
				break;
		}
		cout << m - k + 1 << "\n";
	}
	return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14