| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 727041 | batmendbar | Prisoner Challenge (IOI22_prison) | C++17 | 28 ms | 19124 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>
using namespace std;
vector<vector<int>> devise_strategy(int N) {
vector<vector<int> > ans (N+1, vector<int> (N+1));
for (int i = 1; i <= N; i++) {
ans[0][i] = i;
}
for (int i = 1; i <= N; i++) {
ans[i][0] = 1;
for (int j = 1; j <= i; j++) {
ans[i][j] = -2;
}
for (int j = i + 1; j <= N; j++) {
ans[i][j] = -1;
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
