Submission #1260870

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260870		rayan_bd	Catfish Farm (IOI22_fish)	C++20	0 / 100	50 ms	7268 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  vector<long long> x(2, 0);
  for(int i = 0; i < M; ++i){
    x[X[i]] += W[i];
  }
  long long ans = max(x[0], x[1]);
  if(N <= 2){
    return ans;
  }else{
    vector<pair<int, int>> v1, v2;
    for(int i = 0; i < M; ++i){
        if(X[i] == 0) v1.push_back({Y[i], W[i]});
        else v2.push_back({Y[i], W[i]});
    }
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    long long add = 0, rem = 0;
    for(int i = 0, iptr = 0, jptr = 0; i < N; ++i){
        while(iptr < v1.size() && v1[iptr].first <= i){
            add += v1[iptr].second;
            ++iptr;
        }
        while(jptr < v2.size() && v2[jptr].first <= i){
            rem += v2[iptr].second;
            ++jptr;
        }
        ans = max(ans, x[1] - rem + add);
    }
    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