| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1181223 | madamadam3 | Prisoner Challenge (IOI22_prison) | C++20 | 0 ms | 324 KiB |
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
vvi devise_strategy(int N) {
int X = N;
vvi s(X+1, vi(N+1, 0));
for (int x = 0; x <= X; x++) {
s[x][0] = 0;
for (int i = 1; i <= N; i++) {
s[x][i] = x == 0 ? i : -2;
}
if (x != 0) s[x][x] = -1;
}
return s;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
