# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1057177 | MrPavlito | 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 "cave.h"
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
//#define endl "\n"
#define pii pair<int,int>
using namespace std;
const int MAXN = 5e3+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;
void exploreCave(int N) {
int n = N;
int trenutnacomb[n];
int solved[n];
int rez[n];
for(int i=0; i<n; i++)solved[i] = 0;
for(int i=0; i<n; i++)rez = 0;
for(int i=0; i<n; i++)
{
for(int j=0; j<n; j++)trenutnacomb[j] = rez[j];
int t = tryCombination(trenutnacomb);
int l = 0;
int r = n-1;
while(l<r)
{
int mid = l+r >> 1;
for(int j=l; j<= mid; j++)if(!solved[j])trenutnacomb[j] = (trenutnacomb[j]^1);
int p = tryCombination(trenutnacomb);
bool pomoc;
if(p == i && t == i)pomoc = true;
else if(p != i && t != i)pomoc = true;
else if(p != i && t == i)pomoc = false;
else pomoc = false;
if(pomoc)l = mid+1;
else r = mid;
t = p;
}
solved[l] = i+1;
rez[l] = trenutnacomb[l];
if(t == i)rez[l] = (trenutnacomb[l]^1);
}
for(int i=0; i<n; i++)solved[i]--;
answer(rez, solved);
}