Submission #83308

#	Time	Username	Problem	Language	Result	Execution time	Memory
83308		thiago4532	Pictionary (COCI18_pictionary)	C++17	56 / 140	1573 ms	10052 KiB

pictionary

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

using namespace std;
const int maxn = 1e5 + 10;
int pai[maxn], peso[maxn], ans[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;
}
pair<int, int> qq[maxn];
bool marcado[maxn];

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;
		qq[i] = pair<int, int>{a, b};
	}


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

		for(int l=1;l<=q;l++){
			if(marcado[l]) continue;
			if(find(qq[l].first) == find(qq[l].second)) ans[l] = m - k + 1, marcado[l] = true;
		}
	}	
	for(int i=1;i<=q;i++) cout << ans[i] << "\n";
	return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 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