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>> arr(n+1 , vector<int> (n+1 , 0));
arr[0][0] = 0;
for(int i=1 ; i<=n ; i++){
arr[0][i] = i;
}
for(int i=1 ; i<=n ; i++){
arr[i][0] = 1;
for(int j=1 ; j<=n ; j++){
arr[i][j] = -1 - (j < i);
}
}
return arr;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |