Submission #1180326

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180326		madamadam3	Catfish Farm (IOI22_fish)	C++20	0 / 100	84 ms	8520 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;
typedef long long ll;

ll max_weights(int N, int M, vi X, vi Y, vi W) {
  // subtask 2: x[i] <= 1: either use everything in col0, or col1 (as using 1 means you cant use the other)
  ll c0 = 0, c1 = 0;
  for (int i = 0; i < M; i++) {
    if (X[i] == 0) {
      c0 += W[i];
    } else {
      c1 += W[i];
    }
  }

  ll cans = c1;
  ll ans = c1;

  vi fish(M); iota(fish.begin(), fish.end(), 0);
  sort(fish.begin(), fish.end(), [&](const int &a, const int &b) {
    return Y[a] == Y[b] ? X[a] < X[b] : Y[a] < Y[b];
  });

  for (int i = 0; i < M; i++) {
    if (X[fish[i]] == 0) {
      cans += W[fish[i]];
    } else if (X[fish[i] == 1]) {
      cans -= W[fish[i]];
    }
    ans = max(ans, cans);
  }

  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