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"
#define ll long long int
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
void exploreCave(int n)
{
int pom[n],perm[n],arr[n];
for (int i=0;i<n;i++)arr[i]=-1,perm[i]=-1;
vi pos;
int x=0;
for (int door=0;door<n;door++)
{
pos.clear();
for (int i=0;i<n;i++)pom[i]=arr[i];
for (int i=0;i<n;i++) if (arr[i]==-1)pos.pb(i);
int bit=1;
for (int i=0;i<n;i++) if (pom[i]==-1)pom[i]=1;
int y=tryCombination(pom);
if (y==-1)y=n;
if (y<=x)bit^=1;
int ile=sz(pos);
int ip=-1,ik=sz(pos)-1;
while (ip+1<ik)
{
int mid=(ip+ik)>>1;
for (int i=0;i<n;i++)pom[i]=arr[i];
for (int i=0;i<=mid;i++) if (pom[pos[i]]==-1)pom[pos[i]]=bit;
for (int i=0;i<n;i++) if (pom[i]==-1)pom[i]=(bit^1);
y=tryCombination(pom);
if (y==-1)y=n;
if (y>x)ik=mid;
else ip=mid;
}
ip=pos[ip+1];
perm[ip]=door,arr[ip]=bit;
x++;
}
answer(arr,perm);
}
Compilation message (stderr)
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:33:8: warning: unused variable 'ile' [-Wunused-variable]
int ile=sz(pos);
^~~
# | 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... |