Submission #626703

#TimeUsernameProblemLanguageResultExecution timeMemory
626703kkkkkkkkPrisoner Challenge (IOI22_prison)C++17
5 / 100
27 ms3048 KiB
#include <bits/stdc++.h> using namespace std; vector<vector<int> > res(501); vector<vector<int> > devise_strategy(int n) { for (int i=0;i<=500;i++) for (int j=0;j<=n;j++) { if (i==0&&j==0) res[i].push_back(0); else if (i==0) res[i].push_back(j); else if (j==0) res[i].push_back(1); else if (j>i) res[i].push_back(-1); else res[i].push_back(-2); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...