Submission #628243

#	Time	Username	Problem	Language	Result	Execution time	Memory
628243		c28dnv9q3	Catfish Farm (IOI22_fish)	C++17	9 / 100	30 ms	12116 KiB

fish

#include "fish.h"
#include <vector>

using namespace std;
using ll = long long;

const int N_MAX = 100005;

ll v[N_MAX];
ll dp[N_MAX];
bool got[N_MAX];

ll f(int i) {
  if (i == 0) return 0;
  if (got[i]) return dp[i];
  ll ans = f(i-1);
  if (i == 1) {
    ans = max(v[0], v[1]);
  } else if (i == 2) {
    ans = max(ans, v[0] + v[2]);
  }
  if (i >= 2) {
    ans = max(ans, v[i-1] + f(i-2));
  }
  if (i >= 3) {
    ans = max(ans, f(i-3) + v[i] + v[i-2]);
  }
  if (i >= 4) {
    ans = max(ans, f(i-4) + v[i] + v[i-3]);
  }

  got[i] = true;
  return dp[i] = ans;
}

ll max_weights(
  int N, int M, vector<int> X, vector<int> Y, vector<int> W
) {
  for (int i = 0; i < M; i++)
    v[X[i]] = W[i];

  return f(N-1);
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16