Submission #293363

#	Time	Username	Problem	Language	Result	Execution time	Memory
293363		daniel920712	Painting Walls (APIO20_paint)	C++14	28 / 100	1602 ms	239552 KiB

paint

#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];
bool have[200005]={0};
int DP[200005];
vector < int > all;
vector < int > how[200005];
int N,M;
int F(int here)
{
    int ok=0,ok2,i,j;
    if(have[here]) return DP[here];
    if(here==N) return 0;
    have[here]=1;
    if(here+M>N)
    {
        DP[here]=1e9;
        return 1e9;
    }
    for(i=0;i<M;i++) if(r[i][here]>=here+M-1) ok=1;
    DP[here]=1e9;
    if(ok) for(i=1;i<=M;i++) DP[here]=min(DP[here],F(here+i)+1);
    return DP[here];
}

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--)
    {
        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]);
        }
    }
    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
        {
            for(j=0;j<M;j++) if(r[j][i]>=i+M-1) ok=1;
            if(ok)
            {
                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)

paint.cpp: In function 'int F(int)':
paint.cpp:16:14: warning: unused variable 'ok2' [-Wunused-variable]
   16 |     int ok=0,ok2,i,j;
      |              ^~~
paint.cpp:16:20: warning: unused variable 'j' [-Wunused-variable]
   16 |     int ok=0,ok2,i,j;
      |                    ^

• Subtask 1: 0 / 12
• Subtask 2: 15 / 15
• Subtask 3: 13 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 37