Submission #391622

#	Time	Username	Problem	Language	Result	Execution time	Memory
391622		MrDomino	Painting Walls (APIO20_paint)	C++14	28 / 100	1590 ms	9772 KiB

paint

#include <bits/stdc++.h>
#include "paint.h"

using namespace std;

int sum(int a, int b) {
  return a * b;
}

const int INF = (int) 1e9;

int minimumInstructions(int n, int m, int uselesspieceofinformation, vector<int> c, vector<int> a, vector<vector<int>> b) {
  vector<int> can(n, 0);
  vector<set<int>> match(m);
  for (int i = 0; i < m; i++) {
    for (auto &j : b[i]) {
      match[i].insert(j);
    }
  }
  for (int i = 0; i + m - 1 < n; i++) {
    /// can[i] = 1?
    for (int x = 0; x < m; x++) {
      bool good = 1;
      for (int l = 0; l < m; l++) {
        if (!match[(x + l) % m].count(c[i + l])) {
          good = 0;
          break;
        }
      }
      if (good) {
        can[i] = 1;
        break;
      }
    }
  }
  { /// shift can by 1
    reverse(can.begin(), can.end());
    can.push_back(0);
    reverse(can.begin(), can.end());
  }
  vector<int> dp(n + 1, INF);
  dp[0] = 0;
  for (int i = m; i <= n; i++) {
    /// finish at position i => I've started at position i-k+1
    int start = i - m + 1;
    if (!can[start]) {
      continue;
    }
    for (int lastend = start - 1; lastend <= i - 1; lastend++) {
      dp[i] = min(dp[i], dp[lastend] + 1);
    }
  }
  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