제출 #627355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
627355		c28dnv9q3	Catfish Farm (IOI22_fish)	C++17	6 / 100	105 ms	8792 KiB

fish

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

using namespace std;
using ll = long long;

ll max_weights(
  int N, int M, vector<int> X, vector<int> Y, vector<int> W
) {
  vector<ll> pref0(N+1), pref1(N+1);
  for (int i = 0; i < M; i++) {
    if (X[i] == 0)
      pref0[Y[i] + 1] += W[i];
    else
      pref1[Y[i] + 1] += W[i];
  }
  for (int i = 1; i <= N; i++) {
    pref0[i] += pref0[i-1];
    pref1[i] += pref1[i-1];
  }
  ll s1 = 0, s2 = 0, s3 = 0;
  for (int i = 0; i <= N; i++) {
    s1 = max(s1, pref1[i]);
    s2 = max(s2, pref0[i]);
    s3 = max(s3, pref1[N] - pref1[i] + pref0[i]);
  }

  if (N == 2)
    return max(s1, s2);
  
  return max(s1, max(s2, s3));
}

• Subtask 1: 0 / 3
• Subtask 2: 6 / 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