#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
const ll mod=1e9+7;
const ll maxn=2e5+5;
const int INF=1e9;
#define ok ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define endl '\n'
int n, arr[maxn], ans[maxn], jwb, ans1[maxn], ans2[maxn];
bool udh;
int main() {
ok
cin >> n;
for(int i=1; i<=n; i++) cin >> arr[i];
if(n<=6) {
for(int i=0; i<n; i++) ans[i]=i+1;
do {
cout << "query";
for(int i=0; i<n; i++) cout << " " << ans[i];
cout << endl;
cout.flush();
cin >> jwb;
if(jwb==1) {
if(!udh) {
for(int i=0; i<n; i++) ans1[i]=ans[i];
udh=1;
}
for(int i=0; i<n; i++) ans2[i]=ans[i];
}
} while(next_permutation(ans, ans+n));
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;
cout.flush();
return 0;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
2 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
6 ms |
336 KB |
Output is correct |
6 |
Correct |
7 ms |
208 KB |
Output is correct |
7 |
Correct |
7 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Unexpected end of file - token expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Unexpected end of file - token expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
284 KB |
Unexpected end of file - token expected |
2 |
Halted |
0 ms |
0 KB |
- |