제출 #760963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
760963		drdilyor	메기 농장 (IOI22_fish)	C++17	35 / 100	1085 ms	2097152 KiB

fish

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

ll max_weights(
    int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    vector arr(n+1, vector(n+1, 0ll));
    for (int i = 0; i < m; i++) {
        arr[x[i]+1][y[i]] += w[i];
    }
    auto pref = arr;
    for (int i = 0; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            pref[i][j] += pref[i][j-1];
        }
    }

    auto sum_right = [&](int c, int right)->ll{
        return right < 0 ? 0 : pref[c][right];
    };

    auto sum = [&](int c, int l, int r) { // [l, r]
        if (l <= r) return sum_right(c, r) - sum_right(c, l-1);
        else return 0ll;
    };

    vector memo(2, vector(n+1, vector(n+1, -1ll)));
    auto dp = [&](auto& dp, bool inc, int c, int h2)->ll{
        if (c == n+1) return 0;
        ll& res = memo[inc][c][h2];
        if (res!=-1) return res;
        res = 0;
        if (inc) {
            for (int h3 = h2; h3 <= n; h3++) {
                ll val = sum(c-1, h2, h3-1) + sum(c, h3, h2-1);
                res = max(res, val + dp(dp, true, c+1, h3));
                res = max(res, val + dp(dp, false, c+1, h3));
            }
        } else {
            for (int h3 = 0; h3 <= h2; h3++) {
                ll val = sum(c-1, h2, h3-1) + sum(c, h3, h2-1);
                res = max(res, val + dp(dp, false, c+1, h3));
            }
        }
        res = max(res, dp(dp, true, c+1, 0));
        return res;
    };
    ll res = dp(dp, true, 1, 0);
    return res;

}

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