Submission #1140289

#TimeUsernameProblemLanguageResultExecution timeMemory
1140289Francisco_MartinPrisoner Challenge (IOI22_prison)C++20
5 / 100
14 ms2120 KiB
#include "prison.h" #include <bits/stdc++.h> using namespace std; #define debug(v) cerr<<#v" = "<<(v)<<"\n" using ll=int; using ull=unsigned long long; using pll=pair<ll,ll>; using vll=vector<ll>; using vpll=vector<pll>; using vvll=vector<vll>; vector<vector<int>> devise_strategy(int N){ vvll ans(501,vll(N+1)); for(int i=0; i<=N; i++) ans[0][i]=i; for(int i=1; i<=500; i++){ ans[i][0]=1; 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...