제출 #849316

#제출 시각아이디문제언어결과실행 시간메모리
849316sonamoo메기 농장 (IOI22_fish)C++17
6 / 100
80 ms9812 KiB
#include <fish.h>

#include <bits/stdc++.h>
#define MAX 200005
#define INF 1e12
#define ll long long
#define pii pair<int,int>
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL);

using namespace std;

vector<pair<ll,ll> > fish;
long long ans;
long long a1[100005] , a2[100005] , ps1[100005] , ps2[100005];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    for (int i = 0; i < M; i++) {
        if (X[i] == 0) a1[Y[i]+1] += W[i];
        else a2[Y[i]+1] += W[i];
    }

    for (int i = 1; i <= N; i++) {
        ps1[i] = ps1[i-1]+a1[i];
        ps2[i] = ps2[i-1]+a2[i];
    }

    for (int i = 0; i <= N; i++) {
        if (N >= 3) ans = max(ans , ps2[N]-ps2[i]+ps1[i]);
        ans = max(ans , ps2[i]);
        ans = max(ans , ps1[i]);
    }

    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...