제출 #1338844

#제출 시각아이디문제언어결과실행 시간메모리
1338844nagorn_ph벽 칠하기 (APIO20_paint)C++20
28 / 100
916 ms589824 KiB
#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

int minimumInstructions(int n, int m, int k, std::vector<int> c, std::vector<int> a, std::vector<std::vector<int>> b) {
    map <int, map <int, bool>> mp;
    for (int i = 0; i < m; i++) {
        for (auto e : b[i]) {
            mp[e][i] = 1; // mp, person
        }
    }
    int dp1[n][m]; memset(dp1, 0, sizeof dp1);
    vector <bool> can(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (mp[c[i]][j]) dp1[i][j] = (i == 0 ? 0 : dp1[i - 1][(j - 1 + m) % m]) + 1;
            if (dp1[i][j] >= m) can[i] = true;
        }
    }
    // for (int i = 0; i < n; i++) {
    //     if (can[i]) cout << i << " ";
    // }
    vector <int> dp(n, 1e9);
    for (int i = m - 1; i < n; i++){
        if (!can[i]) continue;
        for (int j = i - 1; j >= max(-1, i - m); j--) {
            if (j == -1) dp[i] = 1;
            else dp[i] = min(dp[i], dp[j] + 1);
        }
    }
    return (dp[n-1] == 1e9 ? -1 : dp[n-1]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...