This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "paint.h"
#include <vector>
using namespace std;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
vector<int> contract(K, -1);
for(int i = 0; i < M; i++) for(int q: B[i]) contract[q] = i;
int res = 0, count = 0;
if(contract[C[0]] == -1) return -1;
res++;
count++;
for(int i = 1; i < N; i++)
{
if(contract[C[i]] % M != (contract[C[i-1]] + 1) % M || count == M)
{
res++;
count = 1;
}
else count++;
}
return res;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |