| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1287948 | eri16 | 동굴 (IOI13_cave) | C++20 | 9 ms | 348 KiB |
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
void exploreCave(int n){
int d[n],v[n];
for (int i=0; i<n; i++){
v[i]=0;
}
int ans;
for (int i=0; i<n; i++){
v[i]=1;
ans=tryCombination(v);
v[i]=0;
d[i]=ans;
}
answer(v,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... | ||||
