Submission #915530

#TimeUsernameProblemLanguageResultExecution timeMemory
915530NamkhingCatfish Farm (IOI22_fish)C++17
6 / 100
78 ms14676 KiB
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;

const int Max = 1e5 + 1;
ll qs[2][Max];

ll max_weights(int N, int M, vi X, vi Y, vi W) {
    for (int i = 0; i < M; i++) {
        qs[X[i]][Y[i] + 1] = W[i];
    }

    for (int i = 0; i < 2; i++) {
        for (int j = 1; j <= N; j++) {
            qs[i][j] += qs[i][j - 1];
        }
    }
    
    if (N == 2) {
        return max(qs[0][N], qs[1][N]);
    }

    ll total = 0;

    for (int i = 0; i <= N; i++) {
        total = max(total, qs[0][i] + qs[1][N] - qs[1][i]);
    }

    return total;
}
#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...