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>
#include "prison.h"
using namespace std;
#define ll long long
vector<vector<int>> devise_strategy(int n){
vector<vector<int>>s(62,vector<int>(n+1,0));
for(int i=1;i<=n;i++){
s[0][i]=i/10+1;
}
for(int i=1;i<=51;i++){
s[i][0]=1;
for(int j=1;j<=n;j++){
if(j/10+1<i){
s[i][j]=-2;
}
else if(j/10+1>i){
s[i][j]=-1;
}
else{
s[i][j]=j%10+52;
}
}
}
for(int i=52;i<=61;i++){
s[i][0]=0;
for(int j=1;j<=n;j++){
if(j%10<i-52){
s[i][j]=-1;
}
else{
s[i][j]=-2;
}
}
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |