Submission #1215728

#TimeUsernameProblemLanguageResultExecution timeMemory
1215728banganPrisoner Challenge (IOI22_prison)C++20
5 / 100
14 ms19012 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; std::vector<std::vector<int>> devise_strategy(int N) { vector s(N+1, vector<int>(N+1)); s[0][0]=0; for (int x=1; x<=N; x++) s[0][x]=x; for (int i=1; i<=N; i++) { s[i][0]=1; for (int x=1; x<i; x++) s[i][x] = -2; for (int x=i; x<=N; x++) s[i][x] = -1; } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...