# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95327 | someone_aa | Cave (IOI13_cave) | C++17 | 1254 ms | 864 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 N = 5100;
bool found[N];
int connection[N];
bool foundswitch[N];
int final_combination[N];
int n;
int empty_x;
void solve(int i, bool state, int l=0, int r=n-1) {
if(l == r) {
// base case
connection[l] = i;
foundswitch[i] = true;
found[l] = true;
final_combination[l] = state;
//cout<<"Finishing door "<<i<<" with switch "<<l<<"\n";
}
else {
int combination[n];
for(int j=0;j<n;j++) {
if(found[j]) combination[j] = final_combination[j];
else combination[j] = false;
}
// fill up to mid with state
# | 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... |