제출 #991791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991791		thinknoexit	메기 농장 (IOI22_fish)	C++17	0 / 100	1092 ms	196068 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;
int a[3030][3030];
/*
0 -> Increasing
1 -> Decreasing
2 -> No Poles
*/
ll dp[3][3030][3030];
int n, m;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M;
    for (int i = 0;i < m;i++) {
        a[X[i] + 1][Y[i] + 1] = W[i];
    }
    ll mx;
    for (int i = 2;i <= n;i++) {
        // h[i-1] <= h[i] (1)
        mx = 0;
        for (int j = 0;j <= n;j++) {
            mx = max({ mx + a[i - 1][j], dp[0][i - 1][j], dp[2][i - 1][j] });
            dp[0][i][j] = mx;
        }
        // h[i-1] >= h[i] (2)
        mx = 0;
        for (int j = n;j >= 0;j--) {
            dp[1][i][j] = mx;
            mx = max({ mx + a[i][j],dp[0][i - 1][j], dp[1][i - 1][j] });
        }
        // (3)
        mx = 0;
        ll sum = 0;
        for (int j = 0;j <= n;j++) {
            sum += a[i][j];
            mx = max({ mx, dp[0][i - 1][j], dp[1][i - 1][j] });
            dp[2][i][j] = mx + sum;
        }
    }
    ll ans = 0;
    for (int i = 1;i <= n;i++) {
        for (int j = 0;j <= n;j++) {
            ans = max(ans, dp[0][i][j]);
            ans = max(ans, dp[1][i][j]);
        }
    }
    return ans;
}

• 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