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 <bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int N) {
vector<vector<int>> s(N+1, vector<int>(N+1));
s[0][0] = 0;
for(int i=1;i<=N;i++) s[i][0] = 1 , s[0][i] = i;
for(int i=1;i<=N;i++) {
for(int j=1;j<=N;j++) {
if (i<j) s[i][j] = -1;
if (i==j) s[i][j] = 0;
if (i>j) s[i][j] = -2;
}
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |