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