제출 #1330459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1330459		SpyrosAliv	메기 농장 (IOI22_fish)	C++20	0 / 100	33 ms	7440 KiB

fish

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

int n, m;
vector<int> x, y, 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;
  w = W;
  ll ans1 = 0, ans2 = 0;
  for (int i = 0; i < m; i++) {
    if (x[i] == 0) ans1 += w[i];
    else ans2 += w[i];
  }
  if (n == 2) return max(ans1, ans2);
  vector<ll> pref(n, 0), suff(n, 0);
  for (int i = 0; i < m; i++) {
    if (x[i] == 0) {
      pref[y[i]] += w[i];
    }
    else {
      suff[y[i]] += w[i];
    }
  }
  ll ans = suff[0];
  for (int i = 0; i < n; i++) {
    ll curr = pref[i];
    if (i < n-1) curr += suff[i+1];
    ans = max(ans, curr);
  }
  return ans;
}

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