제출 #770809

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

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 3e2+5, MAXX = 15;
int n,m;
int dp[MAXN][MAXN][MAXN], g[MAXN][MAXN], p[MAXN][MAXN];
int dp1[MAXN][MAXN], dp2[MAXN][MAXN][MAXN], dp3[MAXN][MAXN][MAXN];

long long max_weights(int32_t N, int32_t M, std::vector<int32_t> X, std::vector<int32_t> Y, std::vector<int32_t> W) {
    n = N; m = M;
    int yn = 0LL;
    FOR(i,0,m) {
        g[X[i]][Y[i]] = W[i]*1LL;
        yn = max(yn,Y[i]*1LL);
    }
    FOR(i,1,n+1) {
        FOR(j,1,n+1) {
            p[i][j] = p[i][j-1]+g[i-1][j-1];
        }
    }
    // FORR(j,yn+1,0) {
    //     FOR(i,1,n+1) cout << p[i][j] << " ";
    //     cout << ln;
    // }
    // cout << ln;
    FOR(i,2,n+1) {
        FOR(j,0,yn+2) {
            FOR(k,0,yn+2) {
                if (j >= k) {
                    dp[i][j][k] = dp1[i-1][k]+p[i-1][j]-p[i-1][k];
                    //dp[i][j][k] = max(dp[i][j][k], dp2[i-1][k][j]+p[i-1][j]);
                    dp[i][j][k] = max(dp[i][j][k], dp3[i-1][k][j]);
                }
                else {
                    dp[i][j][k] = dp3[i-1][k][0]+p[i][k]-p[i][j];
                }
                // FOR(l,0,yn+2) {
                //     if (j >= k) {
                //         dp[i][j][k] = max(dp[i][j][k], dp[i-1][k][l]+max(0LL,p[i-1][j]-p[i-1][max(k,l)]));
                //     }
                //     else {
                //         dp[i][j][k] = max(dp[i][j][k], dp[i-1][k][l]+p[i][k]-p[i][j]);
                //     }
                // }
            }
        }
        FOR(j,0,yn+2) {
            FOR(k,0,yn+2) {
                if (k <= j) dp1[i][j] = max(dp1[i][j], dp[i][j][k]);
                else dp2[i][j][k] = max(dp2[i][j][k-1], dp[i][j][k]-p[i][k]);
            }
            FORR(k,yn+1,-1) {
                dp3[i][j][k] = max(dp3[i][j][k+1], dp[i][j][k]);
            }
        }
    }
    // cout << ln;
    // FORR(j,yn+1,-1) {
    //     FOR(i,1,n+1) cout << dp[i][j][0] << " ";
    //     cout << ln;
    // }
    // cout << dp[4][1][0] << ln;
    int res = -LLINF;
    FOR(j,0,n+1) {
        FOR(k,0,n+1) res = max(res, dp[n][j][k]);
    }
    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