제출 #1329926

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

fish

#include <bits/stdc++.h>
#define REP(i,a,b) for(long long i = a; i<b; i++)
using namespace std;
typedef long long ll;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    vector<tuple<ll,ll,ll>> line;
    vector<ll> dp1(M+1);
    vector<ll> dp2(M+1);
    dp1[0] = dp2[0] = 0;
    REP(i,0,M){
        ll w;
        line.push_back({Y[i],W[i],X[i]});
    }
    sort(line.begin(),line.end());
    REP(i,0,M){
        ll x,y,w;
        tie(y,w,x) = line[i];
        if(x == 0){
            dp1[i+1] = dp1[i] + w;
            dp2[i+1] = max(dp1[i+1], dp2[i]);
        }
        else{
            dp1[i+1] = dp1[i];
            dp2[i+1] = dp2[i] + w;
        }
    }
    return dp2[M];
}

• 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