Submission #1234571

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234571		Ghulam_Junaid	Catfish Farm (IOI22_fish)	C++20	6 / 100	50 ms	7496 KiB

fish

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

typedef long long ll;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    ll sm[2] = {};
    vector<pair<int, int>> vec[2];
    for (int i = 0; i < m; i ++){
        sm[x[i]] += w[i];
        vec[x[i]].push_back({y[i], w[i]});
    }
    sort(vec[0].begin(), vec[0].end());
    sort(vec[1].begin(), vec[1].end());

    ll ans = max(sm[0], sm[1]);
    if (n == 2) return ans;

    sm[0] = 0;
    int it = 0;
    for (auto [yy, ww] : vec[0]){
        sm[0] += ww;
        while (it < vec[1].size() and vec[1][it].first <= yy)
            sm[1] -= vec[1][it++].second;
        ans = max(ans, sm[0] + sm[1]);
    }
    return ans;

    // vector<pair<int, int>> vec;
    // for (int i = 0; i < m; i ++)
    //     vec.push_back({x[i], w[i]});
    // sort(vec.begin(), vec.end());

    // ll dp[n] = {};

    return ans;
}

• 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