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 <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<int>> devise_strategy(int N){
int X = 32;
vector<vector<int>> ans(X, vector<int>(N+1, 0));
vector<int> pw(10, 1);
for(int i = 1; i < 10; i++) pw[i] = pw[i-1]*3;
for(int i = 0; i < X; i++){
int x = i/8;
if(x == 0) ans[i][0] = 0;
else ans[i][0] = 1;
for(int j = 1; j <= N; j++){
int pos = 7-(i%8);
int b = (j%pw[pos+1])/pw[pos];
if(x == 0) ans[i][j] = (7-pos)+(b+1)*8;
else if(b > x-1) ans[i][j] = -1;
else if(b < x-1) ans[i][j] = -2;
else ans[i][j] = 7-pos+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... |