Submission #1321220

#TimeUsernameProblemLanguageResultExecution timeMemory
1321220f112Prisoner Challenge (IOI22_prison)C++20
0 / 100
0 ms332 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; vector< vector < int > > devise_strategy(int N) { vector < vector < int > > x(N + 1, vector < int > (N + 1)); for (int i = 0; i <= N; ++i){ for (int j = 1; j <= N; ++j){ if (i != j) x[i][j] = max(i, j); } } return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...