Submission #1320617

#TimeUsernameProblemLanguageResultExecution timeMemory
1320617mansurPrisoner Challenge (IOI22_prison)C++20
5 / 100
13 ms19216 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> ans(N + 1, vector<int> (N + 1)); 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 (j < i) ans[i][j] = -2; else ans[i][j] = -1; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...