제출 #1338813

#제출 시각아이디문제언어결과실행 시간메모리
1338813PieArmyTower (BOI25_tow)C++20
0 / 100
30 ms1108 KiB
#include<bits/stdc++.h>
#define pb push_back
#define fr first
#define sc second
using namespace std;

int n,k;
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());

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

vector<pair<int,int>> sor(int a,int b,int c){
	vector<int>arr={a,b,c};
	sort(arr.begin(),arr.end());
	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;
}

void f(vector<int>&v){
	if(v.size()<=2)return;
	vector<int>a,b;
	int x,y;
	x=v.back();v.pop_back();
	y=v.back();v.pop_back();
	int suf=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||x==b)c1++;
			if(y==a||y==b)c2++;
			if((x==a&&y==b)||(x==b&&y==a))c=true;
		}
		if(c){
			vector<int>a2,b2;
			swap(a,a2);
			swap(b,b2);
			if(c1==2){
				b.pb(x);
				swap(x,z);
			}
			else{
				a.pb(y);
				swap(y,z);
			}
			suf=i;
			continue;
		}
		if(c1){
			a.pb(z);
		}
		else{
			b.pb(z);
		}
	}
	for(int i=0;i<suf;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||x==b)c1++;
			if(y==a||y==b)c2++;
		}
		if(c1){
			a.pb(z);
		}
		else{
			b.pb(z);
		}
	}
	a.pb(x);
	b.pb(y);
	f(a);
	f(b);

	if(!a.size()){
		swap(b,v);
		return;
	}
	if(!b.size()){
		swap(a,v);
		return;
	}
	if(a.size()==1&&b.size()==1){
		a.pb(b[0]);
		swap(a,v);
		return;
	}
	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);
			}
			swap(a,v);
			return;
		}
		else{
			b.pb(a[0]);
			swap(b,v);
			return;
		}
	}

	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);
		}
		swap(a,v);
		return;
	}
	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);
		}
		swap(a,v);
		return;
	}
}

void code(){
	{
		map<vector<int>,vector<pair<int,int>>>mp2;
		swap(mp,mp2);
	}
	cin>>n;
	vector<int>v;
	for(int i=0;i<n;i++){
		v.pb(i);
	}
	shuffle(v.begin(),v.end(),rng);
	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;
	for(int i=0;i<t;i++){
		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...