제출 #1000197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1000197		abczz	Painting Walls (APIO20_paint)	C++17	51 / 100	1558 ms	7784 KiB

paint

#include "paint.h"
#include <iostream>
#include <vector>
#include <queue>
#include <array>
#include <algorithm>
#define ll int

using namespace std;

ll p = -1, dp[2][50000], ver[2][50000];
vector <ll> color[100000], V;
bool X[100000];
int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B) {
  for (int i=0; i<M; ++i) {
    for (int j=0; j<A[i]; ++j) {
      color[B[i][j]].push_back(i);
    }
  }
  for (int i=0; i<N; ++i) {
    for (auto u : color[C[i]]) {
      if (ver[0][(u+M-1)%M] == i) {
        dp[1][u] = dp[0][(u+M-1)%M] + 1;
        if (dp[1][u] >= M) X[i-M+1] = 1;
      }
      else dp[1][u] = 1;
      ver[1][u] = i+1;
    }
    swap(dp[0], dp[1]);
    swap(ver[0], ver[1]);
  }
  for (int i=0; i<N; ++i) {
    if (X[i]) V.push_back(i);
  }
  p = 0;
  int f = 0;
  while (p < N) {
    auto it = lower_bound(V.begin(), V.end(), p+1);
    if (it == V.begin()) return -1;
    it = prev(it);
    if (*it+M <= p) return -1;
    p = *it+M;
    ++f;
  }
  return f;
}

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