# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827678 | VMaksimoski008 | Prisoner Challenge (IOI22_prison) | C++17 | 0 ms | 0 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) {
vector<vector<int> > ans(n+1, vector<int> ans(n+1));
for(int i=1; i<=n; i++) {
ans[0][i] = 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;
}