| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1218715 | laurra | 동굴 (IOI13_cave) | C++20 | 13 ms | 512 KiB |
#include <iostream>
#include "cave.h"
using namespace std;
void exploreCave(int N)
{
int i,S[N],D[N],rasp;
for(i=0;i<N;i++)
{
D[i]=i;
S[i]=0;
}
for(i=0;i<N;i++)
{
rasp=tryCombination(S);
if(rasp==-1)
answer(S,D);
if(rasp==i)
{
S[i]=1;
rasp=tryCombination(S);
if(rasp==-1)
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... | ||||
