# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146433 | achibasadzishvili | Cave (IOI13_cave) | C++14 | 557 ms | 644 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"
#define ll int
#define f first
#define s second
#define pb push_back
using namespace std;
ll dor[50005],fix[40005],kon[40005],ans[40005];
ll ind,that,h,f,n;
int v[5000];
//tryCombination
void go(ll x,ll y){
if(x == y){
ans[ind] = x;
return;
}
for(int i=x; i <= (x + y) / 2; i++)
if(fix[i] != 1)
v[i] ^= 1;
// cout << ind << " " << x << " " << y << endl;
int h = tryCombination(v);
// cout << "Got " << h << endl;
for(int i=x; i <= (x + y) / 2; i++)
if(fix[i] != 1)
v[i] ^= 1;
if(h == -1){
h = 5000;
}
for(int i=1; i<=n; i++){
# | 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... |