제출 #1157817

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

fish

#include<bits/stdc++.h>

#include "fish.h"

using namespace std;

#define fi first
#define se second

//#define int long long
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()

using ll = long long;


ll max_weights(int n, int m, vector<int> X, vector<int> Y, vector<int> W){

    vector<vector<ll>> w(n + 1, vector<ll>(n + 1));

    for(int i = 0; i < m; i++){
        X[i] = X[i] + 1;
        Y[i] = Y[i] + 1;
        w[X[i]][Y[i]] = W[i];
    }

    vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            dp[i][0] = max(dp[i][0], dp[i - 1][j]);
        }

        ll sum = 0;
        for(int j = 1; j <= n; j++){
            sum += w[i - 1][j];
            int sub = 0;
            for(int p = 0; p < j; p++){
                sub += w[i - 1][p];

                dp[i][j] = max(dp[i][j], dp[i - 1][p] + (sum - sub));
            }
        }
    }

    vector<vector<ll>> dp2(n + 1, vector<ll>(n + 1, 0));
    for(int i = n - 1; i >= 1; i--){
        for(int j = 0; j <= n; j++){
            dp2[i][0] = max(dp2[i][0], dp2[i + 1][j]);
        }

        ll sum = 0;
        for(int j = 1; j <= n; j++){
            sum += w[i + 1][j];
            int sub = 0;
            for(int p = 0; p < j; p++){
                sub += w[i + 1][p];

                dp2[i][j] = max(dp2[i][j], dp2[i + 1][p] + (sum - sub));
            }
        }
    }

    ll answer = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            answer = max(answer, dp[i][j] + dp2[i][j]);
        }
    }
    return answer;
}

• 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