Submission #1338775

#TimeUsernameProblemLanguageResultExecution timeMemory
1338775PieArmyTower (BOI25_tow)C++20
0 / 100
56 ms3444 KiB
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
using namespace std;
#define mid ((left+right)>>1)

int n,k;
int loc[523],dizi[523];
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
bool test=false;

map<vector<int>,vector<pair<int,int>>>mp;

vector<pair<int,int>> sor(int a,int b,int c){
	if(test){
		a=loc[a];
		b=loc[b];
		c=loc[c];
	}
	vector<int>arr={a,b,c};
	sort(arr.begin(),arr.end());
	if(test){
		vector<pair<int,int>>res={{arr[0],arr[1]},{arr[1],arr[2]},{arr[0],arr[2]}};
		sort(res.begin(),res.end(),[&](const pair<int,int>&x,const pair<int,int>&y){
			return min(x.fr-x.sc+n,x.sc-x.fr)<min(y.fr-y.sc+n,y.sc-y.fr);
		});
		while(res.size()>1){
			pair<int,int>x=res[0];
			pair<int,int>y=res.back();
			if(min(x.fr-x.sc+n,x.sc-x.fr)<min(y.fr-y.sc+n,y.sc-y.fr)){
				res.pop_back();
				continue;
			}
			break;
		}
		for(auto&x:res){
			x.fr=dizi[x.fr];
			x.sc=dizi[x.sc];
			if(x.fr>x.sc)swap(x.fr,x.sc);
		}
		/*cerr<<dizi[a]<<"-"<<dizi[b]<<"-"<<dizi[c]<<": ";
		for(auto x:res){
			cerr<<x.fr<<"*"<<x.sc<<" ";
		}
		cerr<<endl;*/
		return res;
	}
	vector<pair<int,int>>&v=mp[arr];
	if(!v.size()){
		cout<<"? "<<a<<" "<<b<<" "<<c<<endl;
		int s;cin>>s;
		v.resize(s);
		for(int i=0;i<s;i++){
			int x,y;cin>>x>>y;
			v.pb({x,y});
		}
	}
	return v;
}

vector<int> f(vector<int>v){
	if(v.size()<=2)return v;
	vector<int>a,b;
	int x,y;
	x=v.back();v.pop_back();
	y=v.back();v.pop_back();
	if(x>y)swap(x,y);
	int p=0;
	for(int i=0;i<v.size();i++){
		int &z=v[i];
		vector<pair<int,int>>res=sor(x,y,z);
		int s=res.size();
		int c1=0,c2=0;
		bool c=false;
		for(int j=0;j<s;j++){
			int a,b;
			a=res[j].fr;b=res[j].sc;
			if(x==a||y==a)c1++;
			if(x==b||y==b)c2++;
			if((x==a&&y==b)||(x==b&&y==a))c=true;
		}
		if(c){
			a.clear();
			b.clear();
			if(c1==2){
				b.pb(x);
				swap(x,z);
			}
			else{
				a.pb(y);
				swap(y,z);
			}
			p=i;
			continue;
		}
		if(c1){
			a.pb(z);
		}
		else{
			b.pb(z);
		}
	}
	for(int i=0;i<p;i++){
		int &z=v[i];
		vector<pair<int,int>>res=sor(x,y,z);
		int s=res.size();
		int c1=0,c2=0;
		for(int j=0;j<s;j++){
			int a,b;
			a=res[j].fr;b=res[j].sc;
			if(x==a||y==a)c1++;
			if(x==b||y==b)c2++;
		}
		if(c1){
			a.pb(z);
		}
		else{
			b.pb(z);
		}
	}
	a.pb(x);
	b.pb(y);
	a=f(a);
	b=f(b);
	if(!a.size())return b;
	if(!b.size())return a;
	if(a.size()==1&&b.size()==1){
		a.pb(b[0]);
		return a;
	}
	if(b.size()<a.size())swap(a,b);
	if(a.size()==1){
		vector<pair<int,int>>res=sor(b[0],b.back(),a[0]);
		int s=res.size();
		int c=0;
		for(int i=0;i<s;i++){
			int x,y;
			x=res[i].fr;
			y=res[i].sc;
			if(x==b[0]&&y==a[0]){
				c=1;
				break;
			}
			if(x==a[0]&&y==b[0]){
				c=1;
				break;
			}
		}
		if(c==1){
			for(int x:b){
				a.pb(x);
			}
			return a;
		}
		else{
			b.pb(a[0]);
			return b;
		}
	}

	vector<pair<int,int>>res=sor(a[0],a.back(),b[0]);
	int s=res.size();
	int c=0;
	int o;
	for(int i=0;i<s;i++){
		int x,y;
		x=res[i].fr;y=res[i].sc;
		if(x==b[0]||y==b[0]){
			c=1;
			if(x==b[0])o=y;
			else o=x;
		}
	}
	if(c){
		if(o==a[0]){
			reverse(a.begin(),a.end());
		}
		for(int x:b){
			a.pb(x);
		}
		return a;
	}
	else{
		vector<pair<int,int>>res=sor(a[0],a.back(),b.back());
		int s=res.size();
		int o;
		for(int i=0;i<s;i++){
			int x,y;
			x=res[i].fr;y=res[i].sc;
			if(x==b.back()||y==b.back()){
				if(x==b.back())o=y;
				else o=x;
			}
		}
		reverse(b.begin(),b.end());
		if(o==a[0]){
			reverse(a.begin(),a.end());
		}
		for(int x:b){
			a.pb(x);
		}
		return a;
	}
}

void code(){
	if(n==0||test==false)cin>>n;
	{
		map<vector<int>,vector<pair<int,int>>>mp2;
		swap(mp,mp2);
	}
	if(test){
		for(int i=0;i<n;i++){
			loc[i]=i;
		}
		shuffle(loc,loc+n,rng);
		for(int i=0;i<n;i++){
			dizi[loc[i]]=i;
		}
	}
	vector<int>v;
	for(int i=0;i<n;i++){
		v.pb(i);
	}
	v=f(v);
	cout<<"! ";
	for(int x:v){
		cout<<x<<" ";
	}
	cout<<endl;
}

signed main(){
	ios_base::sync_with_stdio(23^23);cin.tie(0);
	int t;cin>>t>>k;
	while(t--){
		code();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...