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 <bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int N) {
vector a(25, vector<int>(N + 1));
for (int i = 13; i <= 24; i++) {
a[i][0] = 1;
}
for (int j = 1; j <= N; j++) {
for (int i = 0; i <= 12; i++) {
int t = 12 - (i + 1) / 2 * 2;
if (i % 2 != (j >> (t + 1) & 1)) {
a[i][j] = -2 - i % 2;
} else {
a[i][j] = 26 - t - (j >> t & 1);
if (t == 0) {
a[i][j] = -1 - a[i][j];
}
}
}
for (int i = 13; i <= 24; i++) {
int t = 11 - (i - 13) / 2 * 2;
if (i % 2 != (j >> (t + 1) & 1)) {
a[i][j] = -1 - i % 2;
} else {
a[i][j] = 13 - t - (j >> t & 1);
}
}
}
return a;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |