Submission #1251344

#TimeUsernameProblemLanguageResultExecution timeMemory
1251344pirhosigCatfish Farm (IOI22_fish)C++20
0 / 100
13 ms4416 KiB
#include "fish.h"
#include <bits/stdc++.h>
#define  R(a) for (int i = 0; i < a; ++i)
#define RR(a) for (int j = 0; j < a; ++j)
using namespace std;
typedef long long ll;
typedef vector<int> vi;



ll max_weights(int N, int M, vi X, vi Y, vi W) {
    vector<vector<ll>> val(2, vector<ll>(N));
    R(N) val[X[i]][Y[i]] = W[i];
    partial_sum(val[0].begin(), val[0].end(), val[0].begin());
    partial_sum(val[1].rbegin(), val[1].rend(), val[1].rbegin());

    if (N == 2) return max(val[0].back(), val[1].front());

    ll ans = val[1][0];
    R(N - 1) ans = max(ans, val[0][i] + val[1][i + 1]);

    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...