Submission #862241

#TimeUsernameProblemLanguageResultExecution timeMemory
862241RifalZagonetka (COI18_zagonetka)C++14
9 / 100
37 ms444 KiB
#include <bits/stdc++.h> #include <fstream> ///#define endl '\n' #define mod 998244353 #define INF 900000000 //#define cin fin //#define cout fout //#define fi first //#define se second using namespace std; //ofstream fout("intel.out"); //ifstream fin("intel.in"); int main() { ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); int n; cin >> n; int arr[n], cur[n], ans1[n], ans2[n]; for(int i = 0; i < n; i++) { cin >> arr[i]; } for(int i = 0; i < n; i++) { cur[i] = i+1; } cout << "query "; for(int i = 0; i < n; i++) cout << cur[i] << " "; cout << endl; int x; cin >> x; if(x == 0) { while(next_permutation(cur,cur+n)) { cout << "query "; for(int i = 0; i < n; i++) cout << cur[i] << " "; cout << endl; cin >> x; if(x == 1) break; } } for(int i = 0; i < n; i++) ans1[i] = cur[i]; bool ok = false; while(next_permutation(cur,cur+n)) { cout << "query "; for(int i = 0; i < n; i++) cout << cur[i] << " "; cout << endl; cin >> x; if(x == 1) { ok = true; for(int i = 0; i < n; i++) ans2[i] = cur[i]; } } if(!ok) { for(int i = 0; i < n ; i++) ans2[i] = ans1[i]; } cout << "end" << endl; for(int i = 0; i < n; i++) cout << ans1[i] << " "; cout << endl; for(int i = 0; i < n; i++) cout << ans2[i] << " "; cout << endl; 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...