# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375343 | astoria | Painting Walls (APIO20_paint) | C++14 | 1 ms | 748 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 "bits/stdc++.h"
#include "paint.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){
int f[K+5]; //for the colour i, who can do?
memset(f,-1,sizeof(f));
for(int i=0; i<M; i++){
for(int j=0; j<A[i]; j++){
int col = B[i][j];
f[col]=i;
}
}
for(int i=0; i<K; i++){
if(f[i]==-1) return -1;
}
int lng[N+5];
memset(lng,-1,sizeof(lng));
lng[0]=1;
for(int i=1; i<N; i++){
lng[i] = 1;
int cur = f[C[i]];
int lst = f[C[i-1]];
int nxt = (lst+1)%M;
if(nxt==cur) lng[i] += lng[i-1];
}
int dp[N+5];
multiset<int> mns; mns.insert(0);
for(int i=0; i<N; i++){
if(lng[i]<M) dp[i]=1e9;
else dp[i]=(*mns.begin())+1;
mns.insert(dp[i]);
if(mns.size()>M&&i>=M) mns.erase(mns.find(dp[i-M]));
else if(mns.size()>M) mns.erase(0);
}
if(dp[N-1]>=1e6) return -1;
return dp[N-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... |