Submission #627464

#	Time	Username	Problem	Language	Result	Execution time	Memory
627464		Trisanu_Das	Catfish Farm (IOI22_fish)	C++17	0 / 100	25 ms	3564 KiB

fish

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

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  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 ans1 = 0, ans2 = 0, ans3 = 0;
  for (int i = 0; i <= N; i++) {
    ans1 = max(ans1, pref1[i]);
    ans2 = max(ans2, pref0[i]);
    ans3 = max(ans3, pref1[N] - pref1[i] + pref0[i]);
  }
  if (N == 2) return max(ans1, ans2);
  else return max(ans1, max(ans2, ans3));
}

• 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