제출 #1221442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1221442		totoro	Catfish Farm (IOI22_fish)	C++20	6 / 100	52 ms	9544 KiB

fish

#include <algorithm>
#include <array>
#include <cassert>
#include <map>
#include <numeric>
#include <vector>

#include "fish.h"

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    std::map<int, long long> sums;
    long long ans = 0;
    for (int i = 0; i < M; ++i) sums[X[i]] += W[i], ans = std::max(ans, sums[X[i]]);
    if (N == 2) {
        return ans;
    }

    std::vector<std::vector<long long>> ws(2, std::vector<long long>(N));
    long long cursum = 0;
    for (int i = 0; i < M; ++i) ws[X[i]][Y[i]] = W[i], cursum += X[i] * W[i];
    long long max = cursum;
    for (int y = 0; y < N; ++y) {
        cursum += ws[0][y] - ws[1][y];
        max = std::max(max, cursum);
    }
    return max;
}

• 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