#include "prison.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef pair<ll,ll> pii;
typedef pair<ll,pii> ipii;
const int MAXN = 3e5+100;
const ll INF = 2e18+10;
int n;
vector<vector<int>> ANS;
std::vector<std::vector<int>> devise_strategy(int N) {
n = N;
vector<int> vec;
for(int i=0; i<=n; i++) vec.pb(i); // buka A, tulis i
ANS.pb(vec);
for(int j=1; j<=n; j++){ // kalo di board = j
vector<int> tem; tem.pb(1); // open b
for(int i=1; i<=j; i++) tem.pb(-2); // b lebih kecil
for(int i=j+1; i<=n; i++) tem.pb(-1);
ANS.pb(tem);
}
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... |