제출 #1345352

#제출 시각아이디문제언어결과실행 시간메모리
1345352ThylOneTower (BOI25_tow)C++17
0 / 100
0 ms452 KiB
//####################
//Tower
//####################
#include<bits/stdc++.h> 


#define pb push_back
#define eb emplace_back
#define rall(x) x.rbegin(), x.rend()
#define all(x) x.begin(), x.end()
 
using namespace std;
vector<pair<int,int>> query(int x, int y , int z){
	cout.flush();
	cout <<"? "<<x<<' '<<y<<' ' <<z<<endl;
	int r;cin>>r;
	vector<pair<int,int>> re;
	for(int i = 0 ; i < r ; i++){
		int a,b;cin>>a>>b;
		re.emplace_back(a,b);
	}
	cout.flush();
	
	return re;
}
void answer(vector<int> ans){
	cout.flush();
	cout <<"! ";
	for(int u:ans)cout <<u<<" ";
	cout << endl;
	cout.flush();
}

void solve(){
	int n;cin>>n;

	if(n==3){
		answer({0,1,2});
	}else{
		pair<int,int> farr = {0,1};
		vector<int> ans = {};

		for(int i = 0; i < n ; i++){
			ans.emplace_back(i);
		}
		

		
		answer(ans);
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T, K;cin>>T>>K;
	for(int i  = 0 ; i < T ; i++){
		solve();
	}
	return 0;
};
#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...