# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858649 | Naxocist | Prisoner Challenge (IOI22_prison) | C++17 | 1 ms | 1624 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 <bits/stdc++.h>;
using namespace std;
vector<vector<int>> devise_strategy(int N) {
int x = 500;
vector<vector<int>> res(x+1, vector<int>(x+1, 0));
for(int j=1; j<=x; ++j) res[0][j] = j;
for(int i=1; i<=x; ++i) {
for(int j=1; j<=x; ++j) {
res[i][j] = (i > j ? -1 : -2);
}
}
return res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |