# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305863 | juggernaut | 동굴 (IOI13_cave) | C++14 | 572 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"cave.h"
#include<bits/stdc++.h>
using namespace std;
int pos[5000],n,tmp[5000];
bool check(int val,int l,int r){
for(int i=0;i<n;i++)tmp[i]=(pos[i]||(l<=i&&i<=r))?1:0;
int ret=tryCombination(tmp);
if(ret==-1)ret=n;
return ret>val;
}
void exploreCave(int N){
int i=0,l,r,m;
n=N;
for(;i<n;i++){
l=0,r=n-1;
while(l<r){
int m=(l+r)>>1;
if(check(i,l,m))r=m;
else l=m+1;
}
pos[l]=i;
}
memset(tmp,0,sizeof(tmp));
answer(tmp,pos);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |