Submission #838468

#TimeUsernameProblemLanguageResultExecution timeMemory
83846812345678죄수들의 도전 (IOI22_prison)C++17
5 / 100
19 ms2012 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; std::vector<std::vector<int>> devise_strategy(int N) { vector<vector<int>> ans(501, vector<int> (N+1)); ans[0][0]=0; for (int i=1; i<=N; i++) ans[0][i]=i; for (int i=1; i<=500; i++) ans[i][0]=1; for (int i=1; i<=500; i++) { for (int j=1; j<=N; j++) { if (j>i) ans[i][j]=-1; else ans[i][j]=-2; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...