제출 #754208

#제출 시각아이디문제언어결과실행 시간메모리
754208nicksms동굴 (IOI13_cave)C++17
100 / 100
924 ms660 KiB
#include "cave.h" #include <bits/stdc++.h> int ans[5000], w[5000], q[5000]; void exploreCave(int N) { for (int i = 0; i < N; i++) { memset(q,0,5000*sizeof(int)); for (int j = 0; j < i; j++) q[ans[j]]=w[j]; w[i]=(tryCombination(q)==i); for (int b = 1; b < N; b<<=1) { memset(q,0,5000*sizeof(int)); for (int k = 0; k < N; k++) { q[k]=1 ^ w[i] ^ bool(k & b); } for (int j = 0; j < i; j++) q[ans[j]]=w[j]; if (tryCombination(q)!=i) ans[i] |= b; } } for (int i = 0; i < N; i++) q[ans[i]]=w[i]; for (int i = 0; i < N; i++) w[ans[i]]=i; answer(q,w); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...