# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
994945 |
2024-06-08T08:46:10 Z |
pera |
Library (JOI18_library) |
C++17 |
|
2 ms |
600 KB |
#include<bits/stdc++.h>
#include "library.h"
using namespace std;
void Solve(int N){
vector<int> v , left(N + 1) , f(N);
int L = -1;
for(int i = 1;i <= N;i ++){
f[i] = 1;
}
for(int x = 1;x <= N;x ++){
f[x] = 0;
if(Query(f) == 1){
L = x;
break;
}
f[x] = 1;
}
assert(L != -1);
left[L] = 1;
v.push_back(L);
for(int d = 1;d < N;d ++){
int x = v[d - 1] , sz = 0;
for(int bit = 11;bit >= 0;bit --){
int t = sz + (1 << bit);
if(t <= N - d){
int cnt = t;
vector<int> u(N);
for(int i = 1;i <= N;i ++){
if(!left[i] && cnt > 0){
--cnt;
u[i - 1] = 1;
}
}
int bef = Query(u);
u[x - 1] = 1;
int now = Query(u);
if(now != bef){
sz = t;
}
}
}
int cnt = sz + 1;
for(int i = 1;i <= N;i ++){
if(!left[i]){
--cnt;
}
if(cnt == 0){
cnt = i;
break;
}
}
v.push_back(cnt);
left[cnt] = 1;
}
Answer(v);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
600 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |