#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy (int n) { vector<int> pw(8); pw[0] = 1; for (int i = 1; i < 8; i++) pw[i] = pw[i - 1] * 3; vector<vector<int>> ans(22, vector<int>(n + 1)); ans[0][0] = 0; int k = 6; for (int i = 1; i <= n; i++) { if ((i / pw[k]) % 3 == 0) { ans[0][i] = (7 - k); } else if ((i / pw[k]) % 3 == 1) { ans[0][i] = (7 - k) + 7; } else { ans[0][i] = (7 - k) + 14; } } // for (int j = 1; j <= n; j++) { // cout << j << " : "; // for (int b = 6; b >= 0; b--) cout << ((j / pw[b]) % 3); // cout << endl; // } for (int i = 1, b = 6; i <= 7; i++, b--) { if (b % 2 == 0) { ans[i][0] = 1; } else { ans[i][0] = 0; } for (int j = 1; j <= n; j++) { if ((j / pw[b]) % 3 == 0) { if (b) { if ((j / pw[b - 1]) % 3 == 0) { ans[i][j] = i + 1; } else if ((j / pw[b - 1]) % 3 == 1) { ans[i][j] = i + 1 + 7; } else { ans[i][j] = i + 1 + 14; } } else { ans[i][j] = -1; } } else if ((j / pw[b]) % 3 == 1) { ans[i][j] = (b % 2 == 0 ? -1 : -2); } else { ans[i][j] = (b % 2 == 0 ? -1 : -2); } } } for (int i = 8, b = 6; i <= 14; i++, b--) { if (b % 2 == 0) { ans[i][0] = 1; } else { ans[i][0] = 0; } for (int j = 1; j <= n; j++) { if ((j / pw[b]) % 3 == 0) { ans[i][j] = (b % 2 == 0 ? -2 : -1); } else if ((j / pw[b]) % 3 == 1) { if (b) { if ((j / pw[b - 1]) % 3 == 0) { ans[i][j] = i + 1 - 7; } else if ((j / pw[b - 1]) % 3 == 1) { ans[i][j] = i + 1 + 7 - 7; } else { ans[i][j] = i + 1 + 14 - 7; } } else ans[i][j] = -1; } else { ans[i][j] = (b % 2 == 0 ? -1 : -2); } } } for (int i = 15, b = 6; i <= 21; i++, b--) { if (b % 2 == 0) { ans[i][0] = 1; } else { ans[i][0] = 0; } for (int j = 1; j <= n; j++) { if ((j / pw[b]) % 3 == 0) { ans[i][j] = (b % 2 == 0 ? -2 : -1); } else if ((j / pw[b]) % 3 == 1) { ans[i][j] = (b % 2 == 0 ? -2 : -1); } else { if (b) { if ((j / pw[b - 1]) % 3 == 0) { ans[i][j] = i + 1 - 14; } else if ((j / pw[b - 1]) % 3 == 1) { ans[i][j] = i + 1 + 7 - 14; } else { ans[i][j] = i + 1 + 14 - 14; } } else { ans[i][j] = -1; } } } } return ans; }