# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537307 | smth | Cave (IOI13_cave) | C++14 | 2 ms | 724 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<vector>
#include<iostream>
#include "cave.h"
using namespace std;
int s[6000], doors[6000];
void exploreCave(int N) {
vector<long long>v(N);
long long i,j;
for(i=0;i<N;i++){s[i]=doors[i]=0; v[i]=i;}
bool sit;
for(i=0;i<N;i++)
{
for(j=0;j<v.size();j++)s[v[j]]=0;
if(tryCombination(s)==i)sit=0;
else sit=1;
long long le=0, ri=v.size()-1, mid;
while(le<=ri)
{
mid=(le+ri)/2;
for(int k=0;k<v.size();k++)
{
if(k<mid)s[v[k]]=sit;
else s[v[i]]=!sit;
}
if(tryCombination(s)==i)ri=mid-1;
else le=mid+1;
}
s[v[le]]=!sit;
doors[v[le]]=i;
v.erase(v.begin()+le);
}
answer(s,doors);
}
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... |