# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93069 | Bodo171 | Cave (IOI13_cave) | C++14 | 1100 ms | 660 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 <vector>
#include <iostream>
using namespace std;
vector<int> useless;
const int nmax=5005;
int ask[nmax],ans[nmax],perm[nmax];
int n,x,poz;
void incearca(int cate,int p)
{
int ret=0;
for(int pu=12;pu>=0;pu--)
if((ret+(1<<pu))<useless.size())
{
for(int j=0;j<n;j++)
ask[j]=ans[j];
for(int j=0;j<useless.size();j++)
ask[useless[j]]=(1^p);
for(int j=0;j<ret+(1<<pu);j++)
ask[useless[j]]^=1;
x=tryCombination(ask);
if(x!=-1&&x<=cate) ret+=(1<<pu);
}
poz=useless[ret];
swap(useless[ret],useless.back());
useless.pop_back();
perm[poz]=cate;ans[poz]=p;
}
void exploreCave(int N) {
/* ... */
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... |