# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49258 | doowey | Cave (IOI13_cave) | C++14 | 1673 ms | 580 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"
using namespace std;
const int MAXN = 5000;
int switch_[MAXN];
int on_off[MAXN];
int nn;
void fill(int until, int bit){
for(int i = 0;i < nn;i ++ ){
if(switch_[i] == -1){
on_off[i] = (i < until ? bit : 1 - bit);
}
}
}
void open_door(int u){
fill(nn, 1);
int tt = tryCombination(on_off);
int byt = 0;
if(tt == -1 or tt > u)
byt = 1;
int lf = 0,rf = nn + 1;
int md;
while(rf-lf>1){
md = (lf + rf) / 2;
fill(md, byt);
tt = tryCombination(on_off);
# | 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... |