# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735394 | keisuke6 | Painting Walls (APIO20_paint) | C++14 | 1 ms | 212 KiB |
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 <iostream>
#include <vector>
#include <map>
using namespace std;
int minimumInstructions(int N, int M, int K, vector<int> C,vector<int> A, vector<vector<int>> B){
map<int,int> m;// c, p
vector<int> AA(N);
for(int i=0;i<M;i++){
for(int x:B[i]){
m[x] = i;
}
}
for(int i=0;i<N;i++){
if(!m.count(C[i])) return -1;
AA[i] = m[C[i]];
}
vector<int> T = {0};
for(int i=1;i<N;i++){
if((AA[i-1]+1)%M != AA[i]){
T.push_back(i);
}
}
T.push_back(N);
int ans = 0;
bool ok = false;
for(int i=1;i<T.size();i++){
if(T[i]-T[i-1] >= M) ok = true;
ans += (T[i]-T[i-1]-1)/M+1;
}
return (ok ? ans : -1);
}
Compilation message (stderr)
# | 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... |