Submission #784005

#	Time	Username	Problem	Language	Result	Execution time	Memory
784005		SoulKnight	Catfish Farm (IOI22_fish)	C++17	6 / 100	127 ms	15568 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ln '\n'


long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {

    if (N <= 2){
        ll r1, r2; r1 = r2 = 0LL;

        for (int i = 0; i < M; i++){
            if (X[i] == 1) r2 += W[i];
            else r1 += W[i];
        }

        return max(r1, r2);
    } else {
        ll r0, r1; r0 = r1 = 0LL;

        vector<array<ll, 2>> vec0, vec1;

        for (int i = 0; i < M; i++){
            if (X[i] == 0) {vec0.push_back({Y[i], W[i]}); r0 += W[i];}
            else {vec1.push_back({Y[i], W[i]}); r1 += W[i];}
        }

        if (vec0.empty()) {return r1;}
        if (vec1.empty()) {return r0;}

        sort(vec0.begin(), vec0.end());
        sort(vec1.begin(), vec1.end());

        for (int i = 1; i < vec0.size(); i++) vec0[i][1] += vec0[i-1][1];
        for (int i = 1; i < vec1.size(); i++) vec1[i][1] += vec1[i-1][1];


        ll ans = r1;
        array<ll, 2> t;

        for (auto& p: vec0){
            // cout << p[0] << ' ' << p[1] << ln;
            t = {p[0], -1};
            int idx = lower_bound(vec1.begin(), vec1.end(), t) - vec1.begin();
            if (idx == vec1.size()) {ans = max(ans, p[1]); continue;}

            if (vec1[idx][0] > p[0]) idx--;
            ll tmp = r1;
            if (idx >= 0) tmp -= vec1[idx][1];

            ans = max(ans, tmp + p[1]);
        }

        return ans;
    }

}

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:39:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int i = 1; i < vec0.size(); i++) vec0[i][1] += vec0[i-1][1];
      |                         ~~^~~~~~~~~~~~~
fish.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for (int i = 1; i < vec1.size(); i++) vec1[i][1] += vec1[i-1][1];
      |                         ~~^~~~~~~~~~~~~
fish.cpp:50:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             if (idx == vec1.size()) {ans = max(ans, p[1]); continue;}
      |                 ~~~~^~~~~~~~~~~~~~

• 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