Submission #1201333

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