| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1236470 | CyberCow | Prisoner Challenge (IOI22_prison) | C++20 | 14 ms | 19012 KiB |
#include "prison.h"
using namespace std;
vector<vector<int>> devise_strategy(int N)
{
vector<vector<int>> ans(N + 1, vector<int> (N + 1, 0));
ans[0][0] = 0;
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 <= N; j++)
{
if (i < j)
{
ans[i][j] = -1;
}
else if(i > j)
{
ans[i][j] = -2;
}
}
}
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... | ||||
