Submission #293424

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
293424	2020-09-08 04:57:38	rama_pang	Painting Walls (APIO20_paint)	C++14	100 / 100	974 ms	13816 KiB

paint

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B) {
  vector<vector<int>> colors(K);
  for (int i = 0; i < M; i++) {
    for (auto c : B[i]) {
      colors[c].emplace_back(i);
    }
  }
  int mx = 0;
  vector<bool> possible(N + 1, false);
  auto Update = [&](int i, int sgn) {
    static vector<int> freq(M, 0);
    static vector<int> cnt(M + 1, 0);
    auto UpdateMax = [&]() {
      while (mx + 1 <= M && cnt[mx + 1] > 0) mx++;
      while (mx > 0 && cnt[mx] == 0) mx--;
    };
    for (auto j : colors[C[i]]) {
      int v = j - (i % M);
      if (v < 0) v += M;
      if (sgn == 1) {
        freq[v] += sgn;
        cnt[freq[v]] += sgn;
      } else if (sgn == -1) {
        cnt[freq[v]] += sgn;
        freq[v] += sgn;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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