제출 #1247489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247489		fskarica	Catfish Farm (IOI22_fish)	C++20	52 / 100	1101 ms	187532 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

//#define int long long
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>

const int MAX = 3010;
int n, m;
vector <int> vx, vy, w;
ll dp[MAX][MAX][2];
int mat[MAX][MAX];

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M, vx = X, vy = Y, w = W;

    for (int i = 0; i < m; i++) {
        vx[i]++;
        vy[i]++;

        mat[vx[i]][vy[i]] += w[i];
    }

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

        maxx = 0;
        for (int j = n; j >= 0; j--) {
            maxx = max(maxx, max(dp[i - 1][j][0], dp[i - 1][j][1]));

            dp[i][j][0] = max(dp[i][j][0], maxx);

            maxx += mat[i][j];
        }

        maxx = 0;
        for (int j = 0; j <= n; j++) {
            maxx += mat[i - 1][j];
            maxx = max(maxx, dp[i - 1][j][1]);

            dp[i][j][1] = max(dp[i][j][1], maxx);
        }

        for (int j = 0; j <= n; j++) dp[i][j][0] = max(dp[i][j][0], dp[i][j][1]);
    }

    ll ret = 0;
    for (int i = 0; i <= n; i++) ret = max(ret, max(dp[n][i][0], dp[n][i][1]));

    return ret;
}

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