This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prison.h"
#include <vector>
std::vector<std::vector<int>> devise_strategy(int N) {
return {std::vector<int>(N + 1, 0)};
std::vector<std::vector<int>> V(N+1);
for(auto &w : V) w.resize(N+1);
for(int i=1; i<=N; i++)V[i][0] = 1;
for(int j=1; j<=N; j++) V[0][j] = j;
for(int i=1; i<=N; i++){
for(int j=1; j<=N; j++){
if(j>i)V[i][j] = -1;
if(i>j)V[i][j] = -2;
}
}
return V;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |