제출 #1260950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1260950		rayan_bd	Catfish Farm (IOI22_fish)	C++20	3 / 100	136 ms	15188 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
long long dp[(int) 1e5 + 100][2];
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  map<int, long long> mp;
  long long ans = 0;
  for(int i = 0; i < M; ++i){
    mp[X[i] + 1] += W[i];
  }
  for(int i = 1; i <= N; ++i){
   dp[i][1] = max(dp[i][1], dp[i - 1][0] + mp[i]);
   if(i >= 2){
    dp[i][1] = max(dp[i][1], dp[i - 2][0] + mp[i] + mp[i - 1]);
   }
   dp[i][0] = max(dp[i - 1][1], dp[i - 1][0]);
   ans = max(ans, max(dp[i][0], dp[i - 1][0] + mp[i]));
  }
  return ans;
}

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