Submission #395192

#TimeUsernameProblemLanguageResultExecution timeMemory
395192syl123456벽 칠하기 (APIO20_paint)C++17
63 / 100
1501 ms16452 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) {
    vector<set<int>> mp(K);
    for (int i = 0; i < M; ++i) for (int j : B[i]) mp[j].insert(i);
    int cnt = 0, ptr = 0;
    auto calc = [&](int x, int y) {
        int l = y, r = y, tmp = x;
        while (r - ptr < M - 1 && r < N - 1 && mp[C[r + 1]].count((tmp + 1) % M))
            ++r, tmp = tmp < M - 1 ? tmp + 1 : 0;
        if (r - ptr + 1 == M) return r;
        tmp = x;
        while (r - l + 1 < M && l > 0 && mp[C[l - 1]].count((tmp + M - 1) % M))
            --l, tmp = tmp ? tmp - 1 : M - 1;
        return r - l + 1 == M ? r : -1;
    };
    while (ptr < N) {
        int r = -1;
        for (int i : mp[C[ptr]]) r = max(r, calc(i, ptr));
        if (r == -1) return -1;
        ++cnt, ptr = r + 1;
    }
    return cnt;
}
#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...