| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1216685 | nataliaa | 동굴 (IOI13_cave) | C++20 | 6 ms | 324 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int v[N];
int a[N] ={};
for(int i = 0; i < N; i++) v[i]= i;
for(int i = 0; i < N; i++) {
int k = tryCombination(a);
if(k>i) continue;
if(a[i]==1) a[i]=0;
else a[i]=1;
}
return answer( a,v);
}| # | 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... | ||||
