Submission #934348

#	Time	Username	Problem	Language	Result	Execution time	Memory
934348		irmuun	Painting Walls (APIO20_paint)	C++17	100 / 100	368 ms	16204 KiB

paint

#include<bits/stdc++.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>pos[k];
    for(int i=0;i<m;i++){
        for(auto x:B[i]){
            pos[x].pb(i);
        }
    }
    vector<int>q(m),q1(m,-1e9);
    vector<int>L(n,-1e9);
    vector<int>change,back;
    for(auto j:pos[C[n-1]]){
        q[j]=1;
        L[n-1]=1;
        change.pb(j);
    }
    for(int i=n-2;i>=0;i--){
        back=change;
        for(auto j:change){
            q1[j]=q[j];
        }
        change.clear();
        for(auto j:pos[C[i]]){
            if(q1[(j+1)%m]==-1e9){
                q[j]=1;
                change.pb(j);
            }
            else{
                q[j]=q1[(j+1)%m]+1;
                change.pb(j);
            }
            L[i]=max(L[i],q[j]);
        }
        for(auto j:back){
            q1[j]=-1e9;
        }
    }
    vector<int>mn(n+1,1e9);
    mn[n]=0;
    multiset<int>st;
    for(int i=n-m+1;i<=n;i++){
        st.insert(mn[i]);
    }
    for(int i=n-m;i>=0;i--){
        bool ok=(L[i]>=m);
        if(ok){
            mn[i]=*st.begin()+1;
        }
        st.erase(st.find(mn[i+m]));
        st.insert(mn[i]);
    }
    if(mn[0]>=1e9) return -1;
    return mn[0];
}

• Subtask 1: 12 / 12
• Subtask 2: 15 / 15
• Subtask 3: 13 / 13
• Subtask 4: 23 / 23
• Subtask 5: 37 / 37