#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];
}
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) {
for(int i = 0; i < n; i++) ans2[i] = cur[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] << ' ';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Integer 0 violates the range [1, 3] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
31 ms |
424 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
26 ms |
428 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
39 ms |
444 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |