Submission #785139

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