# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167929 | keta_tsimakuridze | 동굴 (IOI13_cave) | C++14 | 1410 ms | 644 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<bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N){
int C[50006],Cdef[50006],fix[50006],opens,Not,l,r,tr,ans2[500006];
for(int k=0;k<N;k++)
fix[k]=0;
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
if(fix[i]==1)
C[i]=Cdef[i];
else
C[i]=1;
}
int tr=tryCombination(C);
if(tr>k || tr==-1) {
opens=1;
}
else opens=0;
if(opens==0) Not=1;
else Not=0;
l=0;
r=N-1;
while(l<=r)
{
if(l==r){
fix[l]=1;
Cdef[l]=opens;
ans2[l]=k;
break;
}
int mid=(l+r)/2;
for(int i=l;i<=mid;i++)
if(fix[i]==0) C[i]=opens;
else C[i]=Cdef[i];
for(int i=mid+1;i<=r;i++)
if(fix[i]==0) C[i]=Not;
else C[i]=Cdef[i];
for(int i=0;i<N;i++)
if(fix[i]==1)
C[i]=Cdef[i];
int tr=tryCombination(C);
if(tr>k || tr==-1) r=mid;
else l=mid+1;
}
}
answer(Cdef,ans2);
}
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... |