Submission #769129

#	Time	Username	Problem	Language	Result	Execution time	Memory
769129		jack715	Catfish Farm (IOI22_fish)	C++17	0 / 100	34 ms	3800 KiB

fish

#include "fish.h"

#include <vector>
#include <iostream>
// #include <bits/stdc++.h>
#include <algorithm>  

void start() {
  //1 call
}
using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  long long ans = 0, now = 0, a = 0, b = 0;
  vector<pair<int, pair<int, int> > > nums;
  for (int i = 0; i < M; i++) {
    nums.push_back({Y[i], {X[i], W[i]}});
    if (X[i] == 1)
      now += W[i], b += W[i];
    else 
      a += W[i];
  }

  if (N == 2)
    return max(a, b);
  sort(nums.begin(), nums.end());
  for (int i = 0; i < M; i++) {
    cout << nums[i].first << ' ' << nums[i].second.first << '\n';
    if (i == 0 || nums[i].first != nums[i-1].first)
      ans = max(ans, now);
    if (nums[i].second.first == 0)
      now += nums[i].second.second;
    else 
      now -= nums[i].second.second;
  }

  ans = max(ans, now);
  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