# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898288 | irmuun | Painting Walls (APIO20_paint) | C++17 | 37 ms | 9092 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;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
int minimumInstructions(int n,int m,int k,vector<int>C,vector<int>A,vector<vector<int>>B){
vector<int>can(k,-1);
for(int i=0;i<m;i++){
for(int j=0;j<A[i];j++){
can[B[i][j]]=i;
}
}
for(int i=0;i<n;i++){
if(can[C[i]]==-1) return -1;
}
vector<int>count(n,0);
int cur=1;
count[n-1]=1;
for(int i=n-2;i>=0;i--){
if(can[C[i]]==can[C[i+1]]-1||(can[C[i+1]]==0&&can[C[i]]==m-1)){
cur++;
}
else{
cur=1;
}
count[i]=cur;
}
int ans=0;
bool ok=true;
if(count[0]<m) return -1;
ans++;
int r=m-1,nxt=0;
for(int i=1;i<n;i++){
if(count[i]>=m){
nxt=i;
}
if(i>r){
r=nxt+m-1;
if(i>r) return -1;
ans++;
}
}
return ans;
}
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... |