제출 #637998

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637998		aris12345678	Catfish Farm (IOI22_fish)	C++17	6 / 100	123 ms	17576 KiB

fish

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

typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<pii> A, B;
    ll first = 0LL, second = 0LL;
    for(int i = 0; i < m; i++) {
        if(x[i] == 0) {
            first += 1LL*w[i];
            A.push_back({y[i], w[i]});
        } else {
            second += 1LL*w[i];
            B.push_back({y[i], w[i]});
        }
    }
    A.push_back({INT_MAX, INT_MAX});
    B.push_back({INT_MAX, INT_MAX});
    if(n == 2)
        return max(first, second);
    ll ans = second;
    first = 0LL;
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    int i = 0, j = 0;
    while(i+j < m) {
        if(A[i].X < B[j].X)
            first += 1LL*A[i++].Y;
        else
            second -= 1LL*B[j++].Y;
        ans = max({ans, first+second});
    }
    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