Submission #1140340

#TimeUsernameProblemLanguageResultExecution timeMemory
1140340JuanchokiPrisoner Challenge (IOI22_prison)C++20
0 / 100
1 ms1348 KiB
#include "prison.h" #include <vector> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> resp(501, vector<int> (501)) ; for (int i = 0; i < 501; i++) { resp[0][i] = i; } for (int j = 1; j < 501; j++) { resp[j][0]=1; for (int k = 1; k < 501; k++) { if (k<j) { resp[j][k]=-1; } else resp[j][k]=-2; } } return resp; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...