제출 #626281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
626281		dariasc	메기 농장 (IOI22_fish)	C++17	9 / 100	30 ms	4180 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define vec vector
#define ll long long

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {

  ll fish[N];
  memset(fish, 0, sizeof fish);
  for (int i = 0; i < M; i++) {
    fish[X[i]] = W[i];
  }

  ll dp[N];
  memset(dp, 0, sizeof dp);
  for (int x = 0; x < N; x++) {
    ll l = 0;
    if (x > 0) {
      l = fish[x-1];
    }
    ll r = 0;
    if (x < N-1) {
      r = fish[x+1];
    }
    dp[x] = l + r;
    if (x > 2) {
      dp[x] += dp[x-3];
    }

    if (x > 1) {
      dp[x] = max(dp[x], dp[x-2] + r);
    }
    if (x > 0) {
      dp[x] = max(dp[x], dp[x-1] - fish[x] + r);
    }
  }

  ll best = 0;
  for (int x = 0; x < N; x++) {
    best = max(best, dp[x]);
  }

  return best;
}

• 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