# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293367 | daniel920712 | Painting Walls (APIO20_paint) | C++14 | 1536 ms | 239524 KiB |
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 "paint.h"
#include <vector>
#include <stdio.h>
using namespace std;
bool can[2005][100005]={0};
bool use[2005][100005]={0};
int r[2005][100005];
int rr[100005];
bool have[200005]={0};
int DP[200005];
vector < int > all;
vector < int > how[200005];
int N,M;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A,vector< vector<int> > B)
{
int i,j,ok;
all=C;
::N=N;
::M=M;
for(i=0;i<M;i++)
{
for(j=0;j<A[i];j++)
{
can[i][B[i][j]]=1;
how[B[i][j]].push_back(i);
}
}
for(i=N;i>=0;i--)
{
rr[i]=-1e9;
for(j=M-1;j>=0;j--)
{
if(i==N) r[j][i]=N;
else if(can[j][all[i]]==0) r[j][i]=-1e9;
else r[j][i]=max(i,r[(j+1)%M][i+1]);
rr[i]=max(rr[i],r[j][i]);
}
}
for(i=N;i>=0;i--)
{
ok=0;
DP[i]=1e9;
if(i==N) DP[i]=0;
else if(i+M>N) DP[i]=1e9;
else
{
if(rr[i]>=i+M-1) for(j=1;j<=M;j++) DP[i]=min(DP[i],DP[i+j]+1);
}
}
int t=DP[0];
if(t>=1000000000) return -1;
return t;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |