제출 #386830

#제출 시각아이디문제언어결과실행 시간메모리
386830kshitij_sodaniZagonetka (COI18_zagonetka)C++14
9 / 100
8 ms384 KiB
//#pragma GCC optimize("Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; typedef long long llo; #define mp make_pair #define pb push_back #define a first #define b second //#define endl '\n' int n; int it[101]; bool check(vector<int> aa){ cout<<"query "; for(auto j:aa){ cout<<j<<" "; } cout<<endl; int x; cin>>x; return x; } void answer(vector<int> aa,vector<int> bb){ cout<<"end"<<endl; for(auto j:aa){ cout<<j<<" "; } cout<<endl; for(auto j:bb){ cout<<j<<" "; } cout<<endl; return; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin>>n; for(int i=0;i<n;i++){ cin>>it[i]; } if(n<=6){ vector<int> ss; for(int i=1;i<=n;i++){ ss.pb(i); } vector<int> ans; vector<int> ans2; while(true){ if(check(ss)){ if(ans.size()==0){ ans=ss; } ans2=ss; } if(next_permutation(ss.begin(),ss.end())){ continue; } else{ break; } } answer(ans,ans2); return 0; } 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...