| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1218718 | laurra | 동굴 (IOI13_cave) | C++20 | 10 ms | 512 KiB |
#include <iostream>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int i,S[N],D[N];
for(i=0;i<N;i++)
{
D[i]=S[i]=0;
}
for(i=0;i<N;i++)
{
S[i]=1;
D[i]=tryCombination(S);
S[i]=0;
}
answer(S,D);
}
| # | 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... | ||||
