Submission #1181223

#TimeUsernameProblemLanguageResultExecution timeMemory
1181223madamadam3Prisoner Challenge (IOI22_prison)C++20
0 / 100
0 ms324 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...