Submission #1236470

#TimeUsernameProblemLanguageResultExecution timeMemory
1236470CyberCowPrisoner Challenge (IOI22_prison)C++20
5 / 100
14 ms19012 KiB
#include "prison.h" using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> ans(N + 1, vector<int> (N + 1, 0)); ans[0][0] = 0; for (int i = 1; i <= N; i++) { ans[0][i] = i; } for (int i = 1; i <= N; i++) { ans[i][0] = 1; for (int j = 1; j <= N; j++) { if (i < j) { ans[i][j] = -1; } else if(i > j) { ans[i][j] = -2; } } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...