Submission #730651

#TimeUsernameProblemLanguageResultExecution timeMemory
730651t6twotwoPainting Walls (APIO20_paint)C++17
28 / 100
1580 ms12352 KiB
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1E6;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
    vector<vector<int>> f(K);
    for (int i = 0; i < M; i++) {
        for (int x : B[i]) {
            f[x].push_back(i);
        }
    }
    vector<int> dp(N + 1, inf);
    dp[0] = 0;
    for (int i = M - 1; i < N; i++) {
        auto mn = inf;
        vector<int> cnt(M);
        for (int j = 1; j <= M; j++) {
            for (int k : f[C[i - M + j]]) {
                cnt[(k - j + M) % M]++;
            }
            mn = min(mn, dp[i - M + j]);
        }
        if (count(cnt.begin(), cnt.end(), M)) {
            dp[i + 1] = min(dp[i + 1], mn + 1);
        }
    }
    return dp[N] == inf ? -1 : dp[N];
}
#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...