제출 #1218170

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218170		vanea	메기 농장 (IOI22_fish)	C++20	0 / 100	959 ms	2162688 KiB

fish

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

int n, m;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N; m = M;
    vector<vector<ll>> pref(n+1, vector<ll>(n+1));
    for(int i = 0; i < m; i++) {
        pref[X[i]][Y[i]+1] += W[i];
    }
    for(int i = 0; i < n; i++) {
        for(int j = 1; j <= n; j++) {
            pref[i][j] += pref[i][j-1];
        }
    }
    vector<vector<array<ll, 2>>> dp(n+1, vector<array<ll, 2>>(n+1));
    ll ans = 0;
    for(int i = 1; i < n; i++) {
        for(int j = 0; j <= n; j++) {
            for(int k = 0; k <= n; k++) {
                    dp[i][j][0] = max({dp[i][j][0],
                                      max(dp[i-1][k][1], dp[i-1][k][0]) + max(0LL, pref[i][k] - pref[i][j])});

                    dp[i][j][1] = max({dp[i][j][1],
                                      max(dp[i-1][k][0], dp[i-1][k][1]) + max(0LL, pref[i-1][j]-pref[i-1][k])});
            }
        }
    }
    for(int i = 0; i <= n; i++) {
        ans = max({ans, dp[n-1][i][0], dp[n-1][i][1]});
    }
    return ans;
}

/*int main()
{
    cout << max_weights(4, 3, {0, 1, 2}, {0, 1, 2}, {1, 1, 1});
}*/

• Subtask 1: 0 / 3
• Subtask 2: 0 / 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