제출 #292757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292757		daniel920712	벽 칠하기 (APIO20_paint)	C++14	28 / 100	1547 ms	179880 KiB

paint

#include "paint.h"

#include <vector>
#include <stdio.h>
using namespace std;
bool can[2005][100005]={0};
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(auto i:how[all[here]])
    {
        ok2=1;
        for(j=0;j<M;j++)
        {
            if(can[(i+j)%M][all[here+j]]==0)
            {
                ok2=0;
                break;
            }
        }
        if(ok2) ok=1;
    }
    DP[here]=1e9;
    if(ok)
    {
        for(i=1;i<=M;i++)
        {
            DP[here]=min(DP[here],F(here+i)+1);
            //printf("%d %d %d\n",here,i,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;
    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);
        }
    }
    int t=F(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