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;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
int n;
vector<vector<int>> devise_strategy(int N) {
int X = 500;
vector<vector<int>> ans;
n = N;
for(int i=0; i<=X; i++){
ans.pb({});
for(int j=0; j<=N; j++){
ans[i].pb(0);
}
}
ans[0][0] = 0;
for(int i=1; i<=n; i++){
ans[0][i] = i;
}
for(int i=1; i<=X; i++){
ans[i][0] = 1;
for(int j=1; j<=n; j++){
if(i > j) ans[i][j] = -1;
else ans[i][j] = -2;
}
}
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... |