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;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<int>> devise_strategy(int N) {
vector<vector<int>>s(N/10+12,vector<int>(N+1,0));
s[0][0]=0;
for(int i=1;i<=N;i++)
{
s[0][i]=i/10+1;
}
for(int i=1;i<=N/10+1;i++)
{
s[i][0]=1;
for(int j=1;j<=N;j++)
s[i][j]=((j<i)?-2:-1);
s[i][i]=N/10+2+i%10;
}
for(int i=N/10+2 ;i<N/10+12;i++)
{
s[i][0]=0;
for(int j=i;j<=i+9;j++)
s[i][j]=((j-i<i-N/10+2)?-2:-1);
}
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... |