제출 #637869

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

fish

#include "fish.h"
#include <bits/stdc++.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 first = 0LL, second = 0LL;
    for(int i = 0; i < m; i++) {
        if(x[i] == 0)
            first += 1LL*w[i];
        else
            second += 1LL*w[i];
    }
    if(n == 2)
        return max(first, second);
    if(first > second) {
        int mx = 0;
        for(int i = 0; i < m; i++) {
            if(x[i] == 0)
                mx = max(mx, y[i]);
        }
        for(int i = 0; i < m; i++) {
            if(x[i] == 1 && y[i] > mx)
                first += 1LL*w[i];
        }
        return first;
    } else if(first < second) {
        int mn = n;
        for(int i = 0; i < m; i++) {
            if(x[i] == 1)
                mn = min(mn, y[i]);
        }
        for(int i = 0; i < m; i++) {
            if(x[i] == 0 && y[i] < mn)
                second += 1LL*w[i];
        }
        return second;
    } else {
        int mx = 0, mn = n;
        for(int i = 0; i < m; i++) {
            if(x[i] == 0)
                mx = max(mx, y[i]);
            else
                mn = min(mn, y[i]);
        }
        for(int i = 0; i < m; i++) {
            if(x[i] == 1 && y[i] > mx)
                first += 1LL*w[i];
            else if(x[i] == 0 && y[i] < mn)
                second += 1LL*w[i];
        }
        return max(first, second);
    }
    return 0LL;
}

• Subtask 1: 3 / 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