# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032853 | 42kangaroo | Prisoner Challenge (IOI22_prison) | C++17 | 3 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prison.h"
#include <vector>
std::vector<std::vector<int>> devise_strategy(int N) {
using namespace std;
vector<vector<int>> strat(20, vector<int>(N + 1, 0));
vector<int> p3(9);
p3[0] = 1;
p3[1] = 4;
p3[2] = 8;
for (int i = 3; i < 8; ++i) {
p3[i] = p3[i - 1]*3;
}
strat[0][0] = 1;
for (int i = 1; i <= N; ++i) {
strat[0][i] = (i / p3[7]) + 1;
}
for (int i = 0; i < 4; ++i) {
strat[1 + 3 * i][0] = strat[2 + 3 * i][0] = strat[3 + 3 * i][0] = i % 2;
for (int j = 1; j <= N; ++j) {
if ((j/p3[7 - i]) % 3 == 0) {
strat[2 + 3*i][j] = strat[3 + 3*i][j] = -1 - i % 2;
strat[1 + 3 * i][j] = 4 + 3*i + (j/p3[6 - i]) % 3;
} else if ((j/p3[7 - i]) % 3 == 1){
strat[3 + 3*i][j] = -1 - i % 2;
strat[1 + 3*i][j] = -2 + i%2;
strat[2 + 3 * i][j] = 4 + 3*i + (j/p3[6 - i]) % 3;
} else {
strat[2 + 3*i][j] = strat[1 + 3*i][j] = -2 + i % 2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |