제출 #981498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981498		Abito	벽 칠하기 (APIO20_paint)	C++17	0 / 100	1 ms	604 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>
#define pb push_back
#define ep insert
using namespace std;
int minimumInstructions(
    int n, int m, int k, vector<int> C,
    vector<int> A, vector<vector<int>> B){
    int D[k],p[n];
    for (int i=0;i<n;i++) p[i]=0;
    for (int i=0;i<k;i++) D[i]=-1;
    for (int i=0;i<m;i++) for (auto u:B[i]) D[u]=i;
    for (int i=0;i<k;i++){
        if (D[i]==-1) return -1;
    }
    for (int i=0;i<n-1;i++){
        p[i+1]=p[i];
        p[i+1]+=(D[C[i]]>-1 && D[C[i+1]]>-1 && (D[C[i]]+1)%m==D[C[i+1]]);
    }
    int dp[n+1];
    for (int i=0;i<n;i++) dp[i]=10*n;
    dp[n]=0;
    multiset<int> s;
    for (int i=1;i<m;i++) s.ep(10*n);
    s.ep(0);
    for (int i=n-m;i>=0;i--){
        bool ok=(p[i+m-1]-p[i]==m-1);
        if (ok) dp[i]=*s.begin()+1;
        s.erase(s.find(dp[i+m]));
        s.ep(dp[i]);
    }
    //for (int i=0;i<=n;i++) cout<<dp[i]<<' ';cout<<endl;
    if (dp[0]>=10*n) return -1;
    return dp[0];
}

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