# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59390 | spencercompton | Cave (IOI13_cave) | C++17 | 771 ms | 640 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>
using namespace std;
void exploreCave(int N) {
/* ... */
//tryCombination(int s);
//answer(int s, int d)
vector<int> rem;
int n = N;
int s[n];
int d[n];
for(int i = 0; i<n; i++){
s[i] = 0;
d[i] = -1;
rem.push_back(i);
}
for(int i = 0; i<n; i++){
int open = tryCombination(s);
if(open==-1 || open>i){
for(int j = 0; j<rem.size(); j++){
s[rem[j]] = 1-s[rem[j]];
}
}
//right now it is closed
int low = 0;
int high = rem.size()-1;
while(low<high){
int mid = (low+high)/2;
int t[n];
for(int j = 0; j<n; j++){
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... |