Submission #1321236

#TimeUsernameProblemLanguageResultExecution timeMemory
1321236alinurPrisoner 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> > ans(N - 1, vector<int>(N + 1)); ans[0][0] = 0, ans[0][1] = -1, ans[0][N] = -2; for (int j = 2; j < N; j++) ans[0][j] = j - 1; for (int i = 1; i < N - 1; i++) { ans[i][0] = 1; for (int j = 1; j <= i; j++) ans[i][j] = -1; ans[i][i + 1] = 0; for (int j = i + 2; j < N + 1; 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...