제출 #1357858

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1357858		lyra_g13	Catfish Farm (IOI22_fish)	C++20	6 / 100	38 ms	10588 KiB

fish

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

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  ll sum = 0;
  ll sum2 = 0;
  for (int i = 0; i < w.size(); i++) {
    if (x[i] == 0)
      sum += w[i];
    else
      sum2 += w[i];
  }
  ll find = max(sum, sum2);
  if (n <= 2) {
    return find;
  } else {
    vector<ll> y1(n + 1), y2(n + 1);
    for (int i = 0; i < m; i++) {
      if (x[i] == 0) {
        y1[y[i]] += w[i];
      } else {
        y2[y[i]] += w[i];
      }
    }

    vector<ll> sy(n + 2);
    for (int i = n; i >= 0; i--) {
      if (i == n)
        sy[i] = y2[i];
      else
        sy[i] = sy[i + 1] + y2[i];
    }
    vector<ll> py(n + 1);
    for (int i = 0; i <= n; i++) {
      if (i == 0)
        py[i] = y1[i];
      else
        py[i] = py[i - 1] + y1[i];
    }

    ll maxx = sy[0];
    for (int i = 0; i <= n; i++) {
      maxx = max(py[i] + sy[i + 1], maxx);
    }

    return maxx;
  }
};

• 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