제출 #1018690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1018690		vjudge1	Pictionary (COCI18_pictionary)	C++17	0 / 140	419 ms	38724 KiB

pictionary

#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=1e5+5;
int const mod=1e9+7;

set<int> com[N];
int rep[N];
set<int> qr[N];
map<pair<int,int>,int> mp;
vector<pair<int,int>> queries;
int main(){
	int n,m,q;
	cin>>n>>m>>q;
	for (int i = 0; i < q; ++i)
	{
		int a,b;
		cin>>a>>b;
		qr[a].insert(b);
		qr[b].insert(a);
		queries.push_back({a,b});
	}
	for(int i=1;i<=n;i++){
		rep[i]=i;
		com[i].insert(i);
	}
	for(int i=m;i>=1;i--){
		for(int j=2*i;j<=n;j+=i){
			if(rep[i]==rep[j])
				continue;
			int u=rep[i],v=rep[j];
			if(com[u].size()<com[v].size())
				swap(u,v);
			for(int c:com[v]){
				// rep[c]=u;
				// com[u].insert(i);
				for(auto q:qr[c]){
					if(mp.find({c,q})==mp.end() && com[u].find(q)!=com[u].end()){
						mp[{c,q}]=i;
						mp[{q,c}]=i;
					}
				}
			}
			for(int c:com[v]){
				com[u].insert(c);
				rep[c]=u;
			}
			com[v].clear();
		}
	}
	for(auto p:queries){
		cout<<mp[p]<<endl;
	}
	return 0;
}

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