제출 #831967

#제출 시각아이디문제언어결과실행 시간메모리
831967dxz05죄수들의 도전 (IOI22_prison)C++17
10 / 100
9 ms968 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; int get(int num, int pos, int base){ while (pos--) num /= base; return num % base; } vector<vector<int>> devise_strategy(int N) { const int X = 26; const int base = 2; vector<vector<int>> s(X + 1, vector<int>(N + 1, 0)); s[0][0] = 0; for (int i = 1; i <= N; i++){ s[0][i] = 25 + get(i, 12, base); } for (int i = 1; i <= X; i++){ int b = (i - 1) / 2; int r = (i - 1) % 2; int bag = b % 2; s[i][0] = bag; for (int j = 1; j <= N; j++){ int d = get(j, b, base); if (d < r){ s[i][j] = (bag == 0 ? -1 : -2); } else if (d > r){ s[i][j] = (bag == 0 ? -2 : -1); } else if (b > 0){ int pd = get(j, b - 1, base); s[i][j] = (b - 1) * 2 + 1 + pd; } } } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...