# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73219 | TuGSGeReL | Cave (IOI13_cave) | C++14 | 1437 ms | 640 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>
#define ll int
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
ll i,j,ans[5001],pos[5001],ask[5001],k,l,r,lol,lel;
deque<ll>v;
bool boo[5001];
void exploreCave(int n){
for(i=0;i<n;i++){
v.clear();
for(j=0;j<n;j++){
if(!boo[j])ask[j]=0,v.pub(j);
else ask[j]=ans[j];
}
k=tryCombination(ask);
if(k==-1 || k>i) lel=0;
else lel=1;
l=0,r=v.size()-1;
lol=v.size()-1;
while(l<=r){
ll mid=(l+r)/2;
for(j=0;j<v.size();j++){
if(j<=mid){
ask[v[j]]=lel;
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... |