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>> v(32, vector<int>(n+1));
for (int i=8; i<32; ++i) v[i][0]=1;
int mm=2187;
for (int r=0; r<8; ++r){
for (int i=3*r+8; i<3*r+11; ++i){
for (int j=1; j<=n; ++j){
int s=(i%3-2+3)%3;
int t=(j/mm)%3;
if (s<t) v[i][j]=-1;
if (s>t) v[i][j]=-2;
if (s==t) v[i][j]=r+1;
}
}
for (int j=1; j<=n; ++j){
v[r][j]=r*3+(j/mm)%3+8;
}
mm/=3;
}
return v;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |