Submission #566277

#	Time	Username	Problem	Language	Result	Execution time	Memory
566277		zaneyu	Painting Walls (APIO20_paint)	C++14	28 / 100	1574 ms	9696 KiB

paint

/*input
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
 
*/
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ALL(x) x.begin(),x.end()
#define pii pair<int,int>
#define f first
#define s second
#define MXTO(a,b) a=max(a,b)
#define MNTO(a,b) a=min(a,b)
#define sz(x) (int)x.size()
#define pb push_back
const int maxn=1e5+5;
int n,m;
int dp[maxn];
const int INF=0x3f3f3f3f;
int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B) {
    n=N,m=M;
    multiset<int> ms;
    ms.insert(0);
    REP1(i,m-1) dp[i]=INF,ms.insert(dp[i]);
    for(int i=m;i<=n;i++){
        int mn=(*ms.begin());
        dp[i]=INF;
        REP(k,m){
            int c=k;
            bool ok=1;
            for(int j=i-m+1;j<=i;j++){
                bool hv=0;
                for(int a:B[c]) if(a==C[j-1]){
                    hv=1;
                    break;
                }
                if(!hv){
                    ok=0;
                    break;
                }
                c=(c+1)%m;
            }
            if(ok){
                dp[i]=mn+1;
                break;
            }
        }  
        ms.erase(ms.find(dp[i-m]));
        ms.insert(dp[i]);
    }
    if(dp[n]>=INF) dp[n]=-1;
    return dp[n];
}

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