Submission #1336053

#TimeUsernameProblemLanguageResultExecution timeMemory
1336053gelastropodCatfish Farm (IOI22_fish)C++20
0 / 100
56 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) {
    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]);
        }
    }
    long long ans = 0;
    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, max(W1[iter1 - Y1.begin()], W2[iter2 - Y2.begin()]));
    }
    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...