# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055560 | MrPavlito | Cave (IOI13_cave) | C++17 | 169 ms | 344 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];
for(int i=0; i<n; i++)trenutnacomb[i] = 0, solved[i] = 0;
for(int i=0; i<n; i++)
{
int t = tryCombination(trenutnacomb);
int l = 0;
int r = n-1;
while(l<r)
{
int mid = l+r >> 1;
int pre[n];
for(int i=0; i<n; i++)pre[i] = trenutnacomb[i];
for(int i=l; i<= mid; i++)if(!solved[i])trenutnacomb[i] ^= 1;
int p = tryCombination(trenutnacomb);
bool pomoc;
if(p == i && t == i)pomoc = true;
else if(p != i && t == i)pomoc = false;
else if(p == i && t !=i) pomoc = false;
else pomoc = true;
if(!pomoc)r = mid;
else l = mid+1;
for(int i=0; i<n; i++)trenutnacomb[i] = pre[i];
t = p;
}
solved[l] = i;
if(t == i)trenutnacomb[l] ^= 1;
}
answer(trenutnacomb, solved);
}
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... |