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(44, vector<int>(n+1));
for (int i=0; i<44; ++i) v[i][0]=1;
v[0][0]=v[1][0]=v[2][0]=v[3][0]=0;
int mm=1000;
for (int r=0; r<4; ++r){
for (int i=10*r+4; i<10*(r+1)+4; ++i){
for (int j=1; j<=n; ++j){
int t=j/mm%10;
if ((i-4)%10<t) v[i][j]=-1;
if ((i-4)%10>t) v[i][j]=-2;
if ((i-4)%10==t) v[i][j]=r+1;
}
}
for (int j=1; j<=n; ++j){
v[r][j]=10*r+(j/mm)%10+4;
}
mm/=10;
}
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... |