| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1231996 | clemmy14 | 동굴 (IOI13_cave) | C++20 | 7 ms | 516 KiB |
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int N) {
int comb[N], con[N];
for(int i=0; i<N; i++) {
comb[i]=0;
}
for(int i=0; i<N; i++) {
comb[i]=1;
int firstC=tryCombination(comb);
con[i]=firstC;
comb[i]=0;
}
answer(comb, con);
}
| # | 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... | ||||
