제출 #866526

#제출 시각아이디문제언어결과실행 시간메모리
866526vjudge1죄수들의 도전 (IOI22_prison)C++17
60 / 100
10 ms1116 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> s(26, vector<int>(N+1, 0));; s[0][0] = 0;// inspect A for (int i = 0, h=12; i <= 12; i++, h--){ for (int b = 0; b < 2; b++){ int val = (i<<1)+b;// the value of the hash // if odd I will inspect b // else I will inspect a s[val][0] = (i&1); for (int k = 1; k <= N; k++){ int o[2]; o[0] = ((k>>(h+1)) & 1); o[1] = ((k>>h) & 1); if (b != o[0]){ if (i&1){ if (b > o[0]) s[val][k] = -2; else s[val][k] = -1; } else { if (b > o[0]) s[val][k] = -1; else s[val][k] = -2; } } else { if (i==12){ if (o[1]==1) s[val][k] = -2; else s[val][k] = -1; } else s[val][k] = ((i+1)<<1)+o[1]; } } } } // i = 12 return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...