Submission #967285

#TimeUsernameProblemLanguageResultExecution timeMemory
967285mdobricZagonetka (COI18_zagonetka)C++11
9 / 100
3 ms596 KiB
#include <bits/stdc++.h> using namespace std; int n, p[105]; int a[10]; vector <int> ans1, ans2; int main (void){ cin >> n; for (int i = 0; i < n; i++){ cin >> p[i]; a[i] = i + 1; } if (n <= 6){ do{ cout << "query "; for (int i = 0; i < n; i++){ cout << a[i] << " "; } cout << endl; cout.flush(); int ans; cin >> ans; if (ans == 1){ if (ans1.size() == 0){ for (int i = 0; i < n; i++){ ans1.push_back(a[i]); } } ans2.clear(); for (int i = 0; i < n; i++){ ans2.push_back(a[i]); } } }while(next_permutation(a, a + n)); cout << "end" << endl; for (int i = 0; i < n; i++){ cout << ans1[i] << " "; } cout << endl; cout.flush(); for (int i = 0; i < n; i++){ cout << ans2[i] << " "; } cout << endl; cout.flush(); } 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...