Submission #870620

#	Time	Username	Problem	Language	Result	Execution time	Memory
870620		Ludissey	Catfish Farm (IOI22_fish)	C++17	6 / 100	100 ms	16592 KiB

fish

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

long long max_weights(signed N, signed M, std::vector<signed> X, std::vector<signed> Y, std::vector<signed> W) {
  int rightsum=0,leftsum=0;
  vector<pair<int,int>> X0;
  vector<pair<int,int>> X1;
  for (int i = 0; i < M; i++){
    if(X[i]==0) {
      X0.push_back({Y[i], W[i]});
      leftsum+=W[i];
    }
    else {
      X1.push_back({Y[i], W[i]});
      rightsum+=W[i];
    }
  }
  sort(X0.begin(),X0.end());
  sort(X1.begin(),X1.end());

  int li=0,ri=0;
  int clsum=0;
  int crsum=rightsum;
  int sm=max(leftsum,rightsum);
  while(li<X0.size()&&ri<X1.size()){
    if(X0[li].first<X1[ri].first||(X0[li].first==X1[ri].first&&X0[li].second<X1[ri].second)){
      clsum+=X0[li].second;
      if(X0[li].first==X1[ri].first){
        crsum-=X1[ri].second;
        ri++;
      }
      li++;
    }else {
      crsum-=X1[ri].second;
      if(X0[li].first==X1[ri].first){
        clsum+=X0[li].second;
        li++;
      }
      ri++;
    }
    sm=max(sm, clsum+crsum);
  }
  if(N>2) return sm;
  return max(leftsum,rightsum);
}

Compilation message (stderr)

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:27:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   while(li<X0.size()&&ri<X1.size()){
      |         ~~^~~~~~~~~~
fish.cpp:27:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   while(li<X0.size()&&ri<X1.size()){
      |                       ~~^~~~~~~~~~

• 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