제출 #1330463

#제출 시각아이디문제언어결과실행 시간메모리
1330463SpyrosAliv메기 농장 (IOI22_fish)C++20
0 / 100
14 ms5056 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int n, m;
vector<int> x, y;
vector<ll> w;

ll max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  n = N;
  m = M;
  x = X;
  y = Y;
  for (auto x: W) w.push_back(x);
  vector<ll> arr(n);
  for (int i = 0; i < m; i++) {
    arr[x[i]] += w[i];
  }
  vector<ll> dp(n, 0);
  ll ans = 0;
  for (int i = 1; i < n; i++) {
    dp[i] = dp[i-1];
    if (i >= 2) {
      dp[i] = max(dp[i], dp[i-2] + w[i-1]);
    }
    if (i >= 3) {
      dp[i] = max(dp[i], dp[i-3] + w[i-2] + w[i-1]);
    }
    ans = max({ans, dp[i], dp[i-1] + w[i]});
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...