| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1320844 | d_k | 죄수들의 도전 (IOI22_prison) | C++20 | 0 ms | 0 KiB |
#include "prison.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int n) {
vector<vector<int>> ans(n + 1, vector<int>(n + 1, 0));
int x = n;
ans[0][0] = 0;
for(int i = 0; i <= n; i++){
if(i == 1) ans[0][j] = -1;
else if(i == N) ans[0][j] = -2;
else ans[0][j] = j;
}
for(int i = 1; i <= x; i++){
for(int i = 1; j <= n; j++){
ans[i][0] = 1;
if(j < i) ans[i][j] = -2;
else if(j > i) ans[i][j] = -1;
else ans[i][j] = 0;
}
}
return ans;
}
