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