# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670649 | pzorro | 동굴 (IOI13_cave) | C++14 | 2 ms | 468 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 <iostream>
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
const int MAXN = 110;
int s[MAXN];
int d[MAXN];
void exploreCave(int n){
for(int i = 0; i < n; i++){
s[i] = 0;
//d[i] = i;
}
int res;
for(int i = 0; i < n; i++){
s[i]++;
int res = tryCombination(s);
if(res == i){
d[i] = res;
}
d[i] = res;
s[i]--;
}
answer(s, d);
}
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... |