Submission #858668

#TimeUsernameProblemLanguageResultExecution timeMemory
858668MasterDobby죄수들의 도전 (IOI22_prison)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include "prison.h" #define all(a) a.begin(),a.end() #define pii pair<int,int> using namespace std; using ll = long long; vector<vector<int>> devise_strategy(int N){ vector<vector<int>> ans(505,vector<int>(N+5)); ans[0][0]=0; for(int i=1;i<=N;i++) ans[i][0]=1; for(int i=1;i<=N;i++) ans[0][i]=i; for(int i=1;i<=500;i++){ for(int j=1;j<=N;j++){ if(i>=j) ans[i][j]=-2; else ans[i][j]=-1; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...