Submission #1336096

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336096		gelastropod	Catfish Farm (IOI22_fish)	C++20	6 / 100	87 ms	17356 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
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;
    if (N > 2) {
        vector<int> Y1, Y2;
        vector<long long> W1 = { 0 }, W2 = { 0 };
        vector<pair<int, pair<int, int>>> v;
        for (int i = 0; i < M; i++) {
            v.push_back({ Y[i], {X[i], W[i]} });
        }
        sort(v.begin(), v.end());
        for (int i = 0; i < M; i++) {
            if (v[i].second.first) {
                Y2.push_back(v[i].first);
                W2.push_back(W2.back() + v[i].second.second);
            }
            else {
                Y1.push_back(v[i].first);
                W1.push_back(W1.back() + v[i].second.second);
            }
        }
        for (int i = 0; i <= N; i++) {
            auto iter1 = lower_bound(Y1.begin(), Y1.end(), i);
            auto iter2 = lower_bound(Y2.begin(), Y2.end(), i);
            ans = max(ans, W1[iter1 - Y1.begin()] + W2.back() - W2[iter2 - Y2.begin()]);
        }
        return ans;
    }
    long long v1 = 0, v2 = 0;
    for (int i = 0; i < M; i++) {
        if (X[i]) v1 += W[i];
        else v2 += W[i];
    }
    return max(max(ans, v1), v2);
}

• 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