제출 #858724

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
858724		deepaung	Catfish Farm (IOI22_fish)	C++17	0 / 100	913 ms	295824 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>

using namespace std;

long long sumtop[3003][3003], sumbot[3003][3003];
long long dp[3003][3003];

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {

    for (long long i = 0; i < M; i++) {
        sumtop[X[i]+1][Y[i]+1] += W[i];
        sumbot[X[i]+1][Y[i]+1] += W[i];
    }

    for (long long i = 1; i <= N; i++) {
        for (long long j = 1; j <= N; j++) sumtop[i][j] += sumtop[i][j-1];
        for (long long j = N; j >= 1; j--) sumbot[i][j] += sumbot[i][j-1];
    }
  
    for (long long i = 1; i <= N; i++) {
        for (long long j = 0; j <= N; j++) {
            for (long long k = 0; k <= N; k++) {
                dp[i][j] = max(
                    dp[i][j], 
                    dp[i-1][k] - sumbot[i][min(j, k)] + sumbot[i+1][k] + (k > j ? sumbot[i-1][k] - sumbot[i-1][j] : 0)
                );
            }
        }
    }

    long long mx = 0;
    for (long long j = 0; j <= N; j++) {
        mx = max(mx, dp[N][j]);
    }

    return mx;

}

• 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