제출 #637997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637997		aris12345678	메기 농장 (IOI22_fish)	C++17	0 / 100	118 ms	17292 KiB

fish

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

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

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector<piii> A;
    ll first = 0LL, second = 0LL;
    for(int i = 0; i < m; i++) {
        if(x[i] == 0)
            first += 1LL*w[i];
        else
            second += 1LL*w[i];
        A.push_back({y[i], {x[i], w[i]}});
    }
    if(n == 2)
        return max(first, second);
    ll ans = 0LL;
    sort(A.begin(), A.end());
    first = 0LL;
    for(int i = 0; i < m; i++) {
        if(A[i].Y.X == 0)
            first += 1LL*A[i].Y.Y;
        else
            second -= 1LL*A[i].Y.Y;
        if(i+1 != m && A[i+1].Y.X == 1 && A[i].Y.X == 0 && A[i].X == A[i+1].X) continue;
        ans = max(ans, first+second);
    }
    return ans;
}

• 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