# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947739 | biank | Prisoner Challenge (IOI22_prison) | C++17 | 9 ms | 1372 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 <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
using ii = pair<int, int>;
using vi = vector<int>;
const int X = 20;
const int MAX_N = 5588;
const vi c = {3, 3, 3, 3, 3, 2, 2, 1, 1};
vector<vi> s(X + 1);
int n;
map<ii, int> M;
int m(int h, int k) {
ii state = {h, k};
if (!M.count(state)) {
M[state] = sz(M);
}
return M[state];
}
void put(int i, int j, int v) {
if (j <= n) s[i][j] = v;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |