제출 #981877

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

paint

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

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