# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107221 | SecretAgent007 | Cave (IOI13_cave) | C++17 | 454 ms | 612 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>
using namespace std;
#include "cave.h"
const int INF = INT_MAX;
///////////////////////////////////////////////////
vector< int > input;
vector< int > openWith;
int n;
vector< int > known;
void flip(int a, int b, int v[]){
for(int i = a; i <= b; i++){
if(known[i] != -1) v[i] = known[i];
else if(v[i] == 0) v[i] = 1;
else v[i] = 0;
}
}
int interrupt;
bool type;
void query(int l, int r, int door, bool greater, int v[]){
if(l == r){
interrupt = l;
# | 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... |