제출 #817021

#제출 시각아이디문제언어결과실행 시간메모리
817021rainboyAncient Machine 2 (JOI23_ancient2)C++17
10 / 100
95 ms808 KiB
/* upsolved with help from GusterGoose27 */ #include "ancient2.h" #include <vector> using namespace std; typedef vector<int> vi; const int N = 1000; string Solve(int n) { string cc(N, 0); for (int i = 0; i < N; i++) { int m = i + 3; vi aa(m), bb(m); for (int s = 0; s < i; s++) aa[s] = bb[s] = s + 1; aa[i] = i + 1, bb[i] = i + 2; aa[i + 1] = bb[i + 1] = i + 1; aa[i + 2] = bb[i + 2] = i + 2; cc[i] = Query(m, aa, bb) == i + 1 ? '0' : '1'; } return cc; }
#Verdict Execution timeMemoryGrader output
Fetching results...