Submission #385285

#	Time	Username	Problem	Language	Result	Execution time	Memory
385285		monus1042	Carnival (CEOI14_carnival)	C++17	20 / 100	153 ms	512 KiB

carnival

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

const int NAX = 200;
int p[NAX];

int Find(int u){
	if (p[u]==-1) return u;
	return p[u]=Find(p[u]);
}

int main(){
	int n; cin>>n;
	memset(p, -1, sizeof p);
	for (int i=1; i<n; i++){
		for (int j=i+1; j<=n; j++){
			cout<<2<<' '<<i<<' '<<j<<endl;
			int ans; cin>>ans;
			int x=Find(i), y=Find(j);
			if (x!=y && ans==1) p[i]=y;
		}
	}
	cout<<0<<' ';
	vector<int> color(NAX);
	int curr=0;
	for (int i=1; i<=n; i++){
		if (p[i]==-1) color[i]=++curr;
	}
	for (int i=1; i<=n; i++){
		int par=Find(i);
		color[i]=color[par];
	}
	for (int i=1; i<=n; i++) cout<<color[i]<<' ';
	cout<<endl;

	return 0;
}

• Subtask 1: 4 / 20
• Subtask 2: 4 / 20
• Subtask 3: 4 / 20
• Subtask 4: 4 / 20
• Subtask 5: 4 / 20