# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136617 | shafinalam | Cave (IOI13_cave) | C++14 | 312 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)
{
int D[n];
int S[n];
int lock[n];
for(int i = 0; i < n; i++)
{
D[i] = 0;
S[i] = 0;
lock[i] = 0;
}
if(n==1)
{
if(tryCombination(S)==-1) answer(S, D);
S[0] = 1;
answer(S, D);
}
for(int i = 0; i < n; i++)
{
int lo = 0, hi = n-1;
int last = -1, cur = -1, first = 0;
while(lo<hi)
{
# | 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... |