제출 #293365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293365		daniel920712	벽 칠하기 (APIO20_paint)	C++14	28 / 100	65 ms	29816 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 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]);
        }
    }
    if(N<=500&&M<=200)
    {
        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;
}

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