# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944595 | irmuun | Cave (IOI13_cave) | C++17 | 0 ms | 0 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;
#define ll long long
#define pb push_bacK
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
void exploreCave(int n){
int s[n],d[n];
vector<bool>used(n,0);
for(int i=0;i<n;i++){
vector<int>v;
for(int j=0;j<n;j++){
if(!used[j]){
v.pb(j);
}
}
int sz,v.size(),l=1,r=v.size();
int last=0;
for(int j=i;j<n;j++){
s[j]=0;
}
int x=tryCombination(s);
int q=1,p=0;
if(x==-1||x>i){
swap(q,p);
}
while(l<r){
int mid=(l+r)/2;
for(int j=0;j<sz;j++){
if(j<mid){
s[v[j]]=q;
}
else{
s[v[j]]=p;
}
}
int x=tryCombination(s);
if(x==-1||x>i){
r=mid;
}
else{
l=mid+1;
}
}
d[v[l-1]]=i;
s[i-1]=q;
}
answer(s,d);
}