Submission #985198

#	Time	Username	Problem	Language	Result	Execution time	Memory
985198		nnin	Painting Walls (APIO20_paint)	C++14	100 / 100	76 ms	15688 KiB

paint

#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
 
vector<int> f[100005];
 
int seg[200005];
void update(int i, int l, int r, int x, int val) {
  if(l==r) {
    seg[i] += val;
    return;
  }
  int m = (l+r)/2;
  if(x<=m) update(i*2+1, l, m, x, val);
  else update(i*2+2, m+1, r, x, val);
  seg[i] = max(seg[i*2+1], seg[i*2+2]);
}
 
int dp[100005];
 
int minimumInstructions(int N, int M, int K, std::vector<int> C, vector<int> A, vector<vector<int>> B) {
  for(int i=0;i<M;i++) {
    for(int k:B[i]) f[k].push_back(i);
  }
  for(int i=0;i<M;i++) {
    for(int p:f[C[i]]) update(0, 0, (int)5e4, (p-(i%M)+M)%M, 1);
    dp[i] = 1;
  }
  if(seg[0]<M) return -1;
  int last = M-1;
  for(int i=M;i<N;i++) {
    if(last<i-M) return -1;
    if(C[i]!=C[i-M]) {
      for(int p:f[C[i-M]]) update(0,0,(int)5e4,(p-(i%M)+M)%M,-1);
      for(int p:f[C[i]])update(0,0,(int)5e4,(p-(i%M)+M)%M,1);
    }
    if(seg[0]==M) {
      for(int j=last+1;j<=i;j++) dp[j] = (i-M>=0 ? dp[i-M]+1 : 1);
      last = i;
    }
  }
  if(last!=N-1) return -1;
  return dp[N-1];
}

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