| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347912 | stellarisqsn | Cave (IOI13_cave) | C++20 | 802 ms | 516 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int S[N], S2[N], D[N];
int K = 31 - __builtin_clz(N);
fill(S2, S2 + N, -1);
for (int i = 0; i < N; i++){
int id = 0;
bool b = 1;
for (int j = 0; j < N; j++)
S[j] = (S2[j] == -1 ? !b : S2[j]);
if (tryCombination(S) != i)
b = !b;
for (int j = 0; j <= K; j++){
for (int k = 0; k < N; k++)
S[k] = (S2[k] == -1 ? ((k & (1 << j)) ? b : !b) : S2[k]);
if (tryCombination(S) != i)
id |= (1 << j);
}
S2[id] = b;
D[id] = i;
}
answer(S2, 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... | ||||
