Submission #1338858

#TimeUsernameProblemLanguageResultExecution timeMemory
1338858nagorn_phPainting Walls (APIO20_paint)C++20
28 / 100
1595 ms8960 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) {
    set <int> s[m];
    for (int i = 0; i < m; i++) {
        for (auto e : b[i]) {
            s[i].emplace(e);
        }
    }
    int dp1[2][m]; memset(dp1, 0, sizeof dp1);
    vector <bool> can(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            dp1[i%2][j] = 0;
            if (s[j].find(c[i]) != s[j].end()) dp1[i%2][j] = (i == 0 ? 0 : dp1[(i - 1)%2][(j - 1 + m) % m]) + 1;
            if (dp1[i%2][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...