제출 #1164149

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

fish

#include<bits/stdc++.h>
#include "fish.h"
using namespace std;
typedef long long ll;
template<class T>void maximize(T& a, T b){
    if(a < b){
        a = b;
    }
}
ll max_weights(int n, int m, vector<int>X, vector<int>Y, vector<int>W){
    ll sum = 0;
    vector<vector<pair<int, int>>>p(2);
    for(int i = 0; i < m; i++){
        if(X[i] == 1){
            sum += W[i];
            p[1].emplace_back(Y[i], W[i]);
        }
        else{
            p[0].emplace_back(Y[i], W[i]);
        }
    }
    sort(p[0].begin(), p[0].end());
    sort(p[1].begin(), p[1].end());
    p[1].emplace_back(n, 0);
    int i = 0;
    ll ans = sum;
    for(int j = 0; j + 1 < p[1].size(); j++){
        sum -= p[1][j].second;
        while(i < p[0].size() && p[0][i].first < p[1][j + 1].first){
            sum += p[0][i++].second;
        }
        maximize(ans, sum);
    }
    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