Submission #560326

#TimeUsernameProblemLanguageResultExecution timeMemory
560326piOOEPainting Walls (APIO20_paint)C++17
28 / 100
1575 ms7756 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);
    for (int i = 0; i <= N - M; ++i) {
        for (int j = 0; j < M; ++j) {
            bool nw = true;
            for (int l = 0; l < M; ++l) {
                if (!cont((j + l) % M, C[i + l])) {
                    nw = false;
                    break;
                }
            }
            if (nw) {
                ok[i] = true;
                break;
            }
        }
    }
    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...