#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
int main(){
ll n;
cin >> n;
ll c;
cout<< n << " ";
FOR(i,1,n+1) cout << i << " " ;
cout << endl;
cin >> c;
vector<vector<ll>> tings(c);
set<ll> sussy;
ll prev = c;
FORNEG(i,n-1,0){
ll sus = 0;
cout << i << " ";
FOR(j,1,i+1){
cout << j << " ";
}
cout << endl;
cin >> sus;
if (sus != prev){
sussy.insert(i);
tings[c-prev].push_back(i);
prev = sus;
}
}
FOR(i,0,c){
FOR(j,1,n+1){
if (!sussy.count(j)){
cout << 2 << " " << tings[i][0] << " " << j << endl;
ll realsus;
cin >> realsus;
if (realsus==1){
tings[i].push_back(j);
sussy.insert(j);
}
}
}
}
vector<ll> ans(n);
FOR(i,0,c){
for (auto&j : tings[i]){
ans[j-1] = i+1;
}
}
cout << 0 << " ";
for (auto&i : ans){
cout << i << " ";
}
cout << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
9 ms |
336 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
300 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
300 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
6 ms |
428 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
424 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |