Submission #833333

#	Time	Username	Problem	Language	Result	Execution time	Memory
833333		tengiz05	Catfish Farm (IOI22_fish)	C++17	6 / 100	259 ms	40892 KiB

fish

#include "fish.h"

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

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    i64 s[N] {};
    map<pair<int, int>, int> f;
    for (int i = 0; i < M; i++) {
        s[X[i]] += W[i];
        f[{X[i], Y[i]}] = W[i];
    }
    if (N == 2) {
        return max(s[0], s[1]);
    }
    vector pre(2, vector<i64>(N + 1));
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < N; j++) {
            pre[i][j + 1] = pre[i][j] + f[{i, j}];
        }
    }
    i64 ans = 0;
    for (int i = 0; i <= N; i++) {
        ans = max(ans, pre[1][N] - pre[1][i] + pre[0][i]);
    }
    return ans;
}

• Subtask 1: 0 / 3
• Subtask 2: 6 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16