제출 #824899

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

fish

#include "fish.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

const long long inf=1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    long long ans=0;
    vector<vector<pair<int,int> > > v(n);
    long long as[2]={0};
    vector<vector<long long> > pre(2,vector<long long>(n));
    for(int i=0;i<m;i++){
        v[x[i]].push_back({y[i],w[i]});
        pre[x[i]][y[i]]+=w[i];
        as[x[i]]+=w[i];
    }
    for(int i=1;i<n;i++){
        pre[0][i]+=pre[0][i-1];
    }
    for(int i=n-2;i>=0;i--){
        pre[1][i]+=pre[1][i+1];
    }
    if(n==2){
        return max(as[0],as[1]);
    }
    else{
        for(int i=0;i<n-1;i++){
            ans=max(ans,pre[0][i]+pre[1][i+1]);
        }
        ans=max(ans,pre[0][n-1]);
        ans=max(ans,pre[1][0]);
        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