| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 785185 | ono_de206 | 죄수들의 도전 (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 <vector>
std::vector<std::vector<int>> devise_strategy(int n) {
vector<vector<int>> ret(n + 1, vector<int>(n + 1));
ret[0][0] = 0;
for(int i = 1; i <= n; i++) {
ret[0][i] = i;
}
for(int i = 1; i <= n; i++) {
ret[i][0] = 1;
for(int j = 1; j <= n; j++) {
if(i < j) ret[i][j] = -1;
else ret[i][j] = -2;
}
}
return ret;
}
