Submission #1199934

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199934		fadyscube	Catfish Farm (IOI22_fish)	C++17	0 / 100	81 ms	11448 KiB

fish

#include "fish.h"

#include <vector>
#include <algorithm>

using namespace std;

#define ll long long

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    ll can1 = 0;
    ll can2 = 0;
    for (int i = 0; i < M; i++) {
        if (X[i] == 0)
            can2 += W[i];
        else
            can1 += W[i];
    }

    if (N <= 2) {
        return max(can1, can2);
    } else {
        vector<pair<int, int>> v;
        for (int i = 0; i < M; i++) {
            v.push_back({Y[i], i});
        }
        struct {
            bool operator()(pair<int, int> a, pair<int, int> b) const {
                if (a.first == b.first) return a.second > b.second;
                return a.first < b.first;
            }
        }
        customLess;
        sort(v.begin(), v.end(), customLess);
        ll tmp = can1;
        for (int i = 0; i < M;) {
            int j = v[i].second;
            if (i+1 < M && v[i].first == v[i+1].first) {
                tmp -= W[j];
                tmp += W[v[i+1].second];
                i += 2;
            } else if (X[j] == 0) {
                tmp += W[j];
                i++;
            } else {
                tmp -= W[j];
                i++;
            }
            can1 = max(tmp, can1);
        }

        return can1;
    }
}

• 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