Submission #965885

#	Time	Username	Problem	Language	Result	Execution time	Memory
965885		phoenix0423	Painting Walls (APIO20_paint)	C++17	100 / 100	101 ms	15956 KiB

paint

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#include "paint.h"
const int INF = 1e9 + 7;
const int maxn = 1e5 + 5;
int st[maxn], ed[maxn];

int minimumInstructions(
    int n, int m, int k, std::vector<int> c,
    std::vector<int> a, std::vector<std::vector<int>> b) {
    vector<vector<int>> pos(k);
    for(int i = 0; i < n; i++) pos[c[i]].pb(i);
    for(int i = 0; i < n; i++) st[i] = -1, ed[i] = m;
    for(int i = 0; i < m; i++){
      for(int j = 0; j < a[i]; j++){
        for(auto x : pos[b[i][j]]){
          if(x >= i){
            if(st[x - i] == i - 1) st[x - i] ++;
          }
        }
      }
    }
    for(int i = m - 1; i >= 0; i--){
      for(int j = 0; j < a[i]; j++){
        for(auto x : pos[b[i][j]]){
          if(x + m - i < n){
            if(ed[x + m - i] == i + 1) ed[x + m - i] --;
          }
        }
      }
    }
    vector<int> valid(n);
    for(int i = 0; i < n; i++){
      int l = ed[i], r = st[i];
      // cout<<i<<" : "<<l<<" "<<r<<"\n";
      int len = r - l + 2;
      if(len <= 0) continue;
      // cout<<"add : ["<<i - r<<" - "<<i - r + len - 1<<"]\n";
      valid[i - (m - l)] ++;
      if(i - (m - l) + len < n) valid[i - (m - l) + len] --;
    }
    for(int i = 1; i < n; i++) valid[i] += valid[i - 1];
    // for(int i = 0; i < n; i++) cout<<valid[i]<<" ";
    // cout<<"\n";
    deque<int> dq;
    vector<int> dp(n, INF);
    if(!valid[0]) return -1;
    dq.pb(0), dp[0] = 1;
    for(int i = 1; i < n; i++){
      if(!valid[i]) continue;
      while(dq.size() && dq[0] < i - m) dq.pop_front();
      if(dq.empty()) break;
      // cout<<"ck : "<<i<<" : "<<dq.size()<<"\n";
      // cout<<"top : "<<dq[0]<<" "<<dp[dq[0]]<<"\n";
      dp[i] = dp[dq[0]] + 1;
      while(!dq.empty() && dp[dq.size() - 1] >= dp[i]) dq.pop_back();
      dq.pb(i);
    }
    // for(int i = 0; i < n; i++) cout<<dp[i]<<" ";
    // cout<<"\n";
    int ans = INF;
    for(int i = n - 1; i >= n - m; i--) ans = min(ans, dp[i]);
    return ans < INF ? ans : -1;
}


// int main() {
//   int N, M, K;
//   assert(3 == scanf("%d %d %d", &N, &M, &K));
  
//   std::vector<int> C(N);
//   for (int i = 0; i < N; ++i) {
//     assert(1 == scanf("%d", &C[i]));
//   }

//   std::vector<int> A(M);
//   std::vector<std::vector<int>> B(M);
//   for (int i = 0; i < M; ++i) {
//     assert(1 == scanf("%d", &A[i]));
//     B[i].resize(A[i]);
//     for (int j = 0; j < A[i]; ++j) {
//       assert(1 == scanf("%d", &B[i][j]));
//     }
//   }

//   int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
//   printf("%d\n", minimum_instructions);
  
//   return 0;
// }

/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/

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