제출 #1247409

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247409		fskarica	Catfish Farm (IOI22_fish)	C++20	0 / 100	81 ms	15032 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

int n, m;
vector <int> vx, vy, w;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M, vx = X, vy = Y, w = W;

    vector <pii> v0, v1;

    ll zbr = 0;
    for (int i = 0; i < m; i++) {
        if (vx[i] == 0) v0.push_back({vy[i], w[i]});
        else v1.push_back({vy[i], w[i]}), zbr += w[i];
    }

    sort(v0.begin(), v0.end());
    sort(v1.begin(), v1.end());

    int pos = 0;
    ll ret = zbr;
    for (auto e : v0) {
        while (pos < v1.size() && v1[pos].fi <= e.fi) {
            zbr -= v1[pos].se;
            pos++;
        }
        zbr += e.se;

        ret = max(ret, zbr);
    }

    return ret;
}

//int main() {
//}

• 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