제출 #1199458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1199458		yeediot	Painting Walls (APIO20_paint)	C++20	0 / 100	0 ms	320 KiB

paint

#include<bits/stdc++.h>
#include "paint.h"
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
int n, m, k;
int minimumInstructions(int N, int M, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
    n = N, m = M, k = K;
    vector<int>col[k + 1];
    for(int i = 0; i < m; i++){
        for(int j = 0; j < A[i]; j++){
            col[B[i][j]].pb(i);
        }
    }
    map<int, int>dp[n];
    vector<int>ok(n);
    for(int i = n - 1; i >= 0; i--){
        for(auto j : col[C[i]]){
            dp[i][j] = dp[1 + 1][(j + 1) % m] + 1;
            ok[i] |= (dp[i][j] >= m);
        }
    }
    vector<int>dp2(n, 2e9);
    multiset<int>st;
    for(int i = 0; i < n; i++){
        if(i - m - 1 >= 0) st.erase(st.find(dp2[i - m - 1]));
        if(ok[i]){
            dp2[i] = (sz(st) ? *st.begin() : 0) + 1;
        }
        st.insert(dp2[i]);
    }
    return (dp2[n - m] < 2e9 ? dp2[n - m] : -1);
}

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