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