Submission #224765

#	Time	Username	Problem	Language	Result	Execution time	Memory
224765		Haunted_Cpp	Visiting Singapore (NOI20_visitingsingapore)	C++17	29 / 100	1039 ms	197112 KiB

VisitingSingapore

#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
 
typedef long long i64;
using namespace std;

const int N = 5e3 + 5;

int dp [N][N][2];

int k, n, m, a, b;

int felicidade_evento [N];
int dia_evento [N];
int tarefas [N];

int solve (int p, int task, bool is_skip) {
  if (task >= m) {
    return 0;
  }
  
  if (p >= n) {
    if (!is_skip) {
      return ( a + (m - task) * b);
    } else {
      return ( (m - task) * b );
    }
  }
  
  int &res = dp[p][task][is_skip];
  if (~res) return res;
  res = -1e9;
  

  if (tarefas[task] == dia_evento[p]) {
    res = max (res, felicidade_evento[tarefas[task]] + solve (p + 1, task + 1, false));
  } else {
    if (is_skip == false) {
      res = max (res, a + b + solve (p, task + 1, true));
      res = max (res, a + b + solve (p + 1, task, true));
    } else {
      res = max (res, b + solve (p, task + 1, true));
      res = max (res, a + b + solve (p + 1, task, true));
    }
  }
  return res;
}

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> k >> n >> m >> a >> b;
  for (int i = 1; i <= k; i++) cin >> felicidade_evento[i];
  for (int i = 0; i < n; i++) cin >> dia_evento[i];
  for (int i = 0; i < m; i++) cin >> tarefas[i];
  memset (dp, -1, sizeof(dp));
  int mn = -1e9;
  for (int i = 0; i < n; i++) {
    mn = max (mn, solve (i, 0, false));
  }
  cout << mn << '\n';
  return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 6 / 6
• Subtask 3: 12 / 12
• Subtask 4: 7 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 13
• Subtask 7: 0 / 50