Submission #560336

#TimeUsernameProblemLanguageResultExecution timeMemory
560336piOOEPainting Walls (APIO20_paint)C++17
51 / 100
1123 ms524288 KiB
#include "paint.h"

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
    auto cont = [&B](int i, int x) {
        auto it = lower_bound(begin(B[i]), end(B[i]), x);
        if (it == end(B[i]) || *it != x) return false;
        return true;
    };
    vector<bool> ok(N);
    vector<vector<int>> dp(N + 1, vector<int>(M));
    for (int i = N - 1; i > -1; --i) {
        for (int j = 0; j < M; ++j) {
            if (!cont(j, C[i])) continue;
            dp[i][j] = min(M, 1 + dp[i + 1][(j + 1) % M]);
            if (dp[i][j] == M) {
                ok[i] = true;
            }
        }
    }
    int lst = N, p = N;
    int ans = 0;
    for (int i = N - M; i > -1; --i) {
        if (i + M < p) {
            if (lst >= p) {
                return -1;
            }
            p = lst;
            ++ans;
        }
        if (ok[i]) {
            lst = i;
        }
    }
    if (p != 0) {
        if (lst >= p) return -1;
        ++ans;
    }
    return ans;
}
#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...