Submission #949320

#	Time	Username	Problem	Language	Result	Execution time	Memory
949320		vjudge1	Painting Walls (APIO20_paint)	C++17	0 / 100	1 ms	348 KiB

paint

#include <bits/stdc++.h>

//#include "paint.h"


using namespace std;

const int inf = 1e9;

int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B) {
	vector <int> dp(N + 1, inf);
	dp[0] = 0;
	set <int> st[M];
	for(int i = 0; i < M; i++){
		for(auto x : B[i]){
			st[i].insert(x);
		}
	}
	for(int i = 0; i < N - M + 1; i++){
		for(int j = 0; j < M; j++){
			bool flag = 1;
			for(int l = 0; l < M; l++){
				if(st[(l + j) % M].find(C[i + l]) == st[(l + j) % M].end()){
					flag = 0;
					break;
				}
			}
			if(flag){
				if(i == 0)
					dp[i + M - 1] = 1;
				else{
					for(int j = i - 1; j < N - M + 1; j++){
						dp[i + M - 1] = min(dp[j] + 1,dp[i + M - 1]);
					}
				}
				//cout << i + M - 1 <<"-"<< dp[i + M - 1] << endl;
			}
		}
	}
	if(dp[N - 1] == inf)
		return -1;
	return dp[N - 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;
}
*/

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