Submission #1176770

#TimeUsernameProblemLanguageResultExecution timeMemory
1176770SulACatfish Farm (IOI22_fish)C++20
6 / 100
51 ms8264 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
using namespace std;
using namespace __gnu_pbds;

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    long long sum[2]{};
    int a[2][n]{};
    for (int i = 0; i < m; i++) {
        sum[ x[i] ] += w[i];
        a[ x[i] ][ y[i] ] = w[i];
    }
    if (n == 2)
        return max(sum[0], sum[1]);
    long long cur = sum[0], ans = cur;
    for (int i = n-1; i >= 0; i--) {
        cur -= a[0][i];
        cur += a[1][i];
        ans = max(ans, cur);
    }
    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...