| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1348003 | argsx | 동굴 (IOI13_cave) | C++20 | 806 ms | 516 KiB |
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
int k=31-__builtin_clz(N);
int s[N],s2[N],d[N];
memset(s2,-1,sizeof s2);
for(int i=0;i<N;i++){
int id=0;
bool b=1;
for(int j=0;j<N;j++){
if(s2[j]!=-1)s[j]=s2[j];
else s[j]=!b;
}
if(tryCombination(s)!=i)b=!b;
for(int j=0;j<=k;j++){
for(int p=0;p<N;p++){
if(s2[p]!=-1)s[p]=s2[p];
else{
if(p&(1<<j))s[p]=b;
else s[p]=!b;
}
}
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... | ||||
