Submission #625592

#TimeUsernameProblemLanguageResultExecution timeMemory
625592gromperenPrisoner Challenge (IOI22_prison)C++17
0 / 100
0 ms212 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> s(N+1, vector<int>(N+1)); s[0][0] = 0; for (int i = 0; i <= N; ++i) { s[0][i] = i; } for (int i = 1; i <= N; ++i) { for (int j = 1; j <= N; ++j) { if (i < j) { s[i][j] = -1; } else { s[i][j] = -2; } } } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...