Submission #827679

#TimeUsernameProblemLanguageResultExecution timeMemory
827679VMaksimoski008Prisoner Challenge (IOI22_prison)C++17
5 / 100
23 ms19136 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)); for(int i=1; i<=n; 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<=n; 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...