# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
962644 |
2024-04-14T05:41:57 Z |
hirayuu_oj |
Cave (IOI13_cave) |
C++17 |
|
452 ms |
544 KB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll INF=1LL<<60;
void exploreCave(int N) {
int s[N];
rep(i,N){
s[i]=-1;
}
int ques[N];
int d[N];
rep(i,N){
int door,right;
rep(j,N){
if(s[j]==-1)ques[j]=0;
else ques[j]=s[j];
}
door=tryCombination(ques);
if(door==i)right=1;
else right=0;
int ok=0,ng=N-i;
while(ng-ok>1){
int mid=(ok+ng)/2;
int cnt=0;
rep(j,N){
if(s[j]==-1){
if(mid<=cnt && cnt<ng){
ques[j]=right;
}
else{
ques[j]=1^right;
}
cnt++;
}
else{
ques[j]=s[j];
}
}
door=tryCombination(ques);
if(door==i){
ng=mid;
}
else{
ok=mid;
}
}
int cnt=0;
rep(j,N){
if(s[j]==-1){
if(cnt==ok)s[j]=right;
d[j]=i;
cnt++;
}
}
}
for(int i:s)cout<<i<<"\n";
answer(s,d);
/* ... */
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
306 ms |
544 KB |
Hacked |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
452 ms |
348 KB |
Hacked |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Hacked |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Hacked |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
306 ms |
544 KB |
Hacked |
2 |
Halted |
0 ms |
0 KB |
- |