제출 #1313055

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

fish

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

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector<int> a(n), b(n);
  for (int i = 0; i < m; i++) {
    if (x[i] == 0) {
      a[y[i]] = w[i];
    } else {
      b[y[i]] = w[i];
    }
  }
  if (n == 2) {
    long long ans = 0;
    ans = max(ans, accumulate(a.begin(), a.end(), 0LL));
    ans = max(ans, accumulate(b.begin(), b.end(), 0LL));
    return ans;
  }
  vector<long long> A(n + 1), B(n + 1);
  for (int i = 0; i < n; i++) {
    A[i + 1] = A[i] + a[i];
    B[i + 1] = B[i] + b[i];
  }
  long long ans = 0;
  for (int i = 0; i <= n; i++) {
    ans = max(ans, B[n] - B[i] + A[i]);
  }
  return ans;
}

• 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