제출 #1336074

#제출 시각아이디문제언어결과실행 시간메모리
1336074gelastropod메기 농장 (IOI22_fish)C++20
0 / 100
55 ms13516 KiB
#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    long long ans = 0;
    if (N > 2) {
        vector<int> Y1, Y2;
        vector<long long> W1 = { 0 }, W2 = { 0 };
        for (int i = 0; i < M; i++) {
            if (X[i]) {
                Y2.push_back(Y[i]);
                W2.push_back(W2.back() + W[i]);
            }
            else {
                Y1.push_back(Y[i]);
                W1.push_back(W1.back() + W[i]);
            }
        }
        for (int i = 0; i <= N; i++) {
            auto iter1 = lower_bound(Y1.begin(), Y1.end(), i);
            auto iter2 = lower_bound(Y2.begin(), Y2.end(), i);
            ans = max(ans, W1[iter1 - Y1.begin()] + W2.back() - W2[iter2 - Y2.begin()]);
        }
    }
    long long v1 = 0, v2 = 0;
    for (int i = 0; i < M; i++) {
        if (X[i]) v1 += W[i];
        else v2 += W[i];
    }
    return max(max(ans, v1), v2);
}
#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...