Submission #1078590

#TimeUsernameProblemLanguageResultExecution timeMemory
1078590ArthuroWichPrisoner Challenge (IOI22_prison)C++17
0 / 100
1 ms348 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int n) { vector<vector<int>> s(sqrt(n)+1, vector<int>(n+1, 0)); s[0][0] = 0; for (int i = 0; i <= n; i++) { s[0][i] = i; } for (int i = 1; i <= n; i++) { s[i][0] = 1; } for (int i = 1; i <= n; i++) { for (int j = 1; j <= sqrt(n); j++) { if (i*i <= j) { s[i][j] = -1; } else { s[i][j] = -2; } } } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...