Submission #1226047

#TimeUsernameProblemLanguageResultExecution timeMemory
1226047sokratisiPainting Walls (APIO20_paint)C++20
0 / 100
0 ms324 KiB
#include "paint.h"
#include <vector>
#include <set>
#include <cstdio>

using namespace std;

int constofcolor[100005];

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b) {
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < a[i]; j++) {
            constofcolor[b[i][j]] = i;
        }
    }
    int cur = constofcolor[c[0]];
    int init = 0;
    bool okay = true;
    int ans = 0;
    for (int i = 1; i < n; i++) {
        cur++;
        cur %= m;
        if (cur != constofcolor[c[i]]) {
            if (i - init < m) okay = false;
            else {
                ans += (i - init - 1)/m + 1;
                init = i;
                cur = constofcolor[c[i]];
            }
        }
    }
    if (n < init < m) okay = false;
    else {
        ans += (n - init - 1)/m + 1;
    }
    if (!okay) return -1;
    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...