제출 #637252

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

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll up[3010][3010];
ll down[3010][3010];
ll s[3010][3010];
ll dp[3010];

ll max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    for(int i=0;i<M;i++){
        s[X[i]][Y[i]+1]+=W[i];
    }
    for(int i=0;i<N;i++)
        for(int j=1;j<=N;j++)
            s[i][j]+=s[i][j-1];
    for(int i=1;i<N;i++){
        for(int j=0;j<N;j++){
            if(i==1) up[i][j]=-s[i-1][0]+s[i-1][j];
            else up[i][j]=dp[i-2]-s[i-1][0]+s[i-1][j];
            for(int k=0;k<=j;k++) up[i][j]=max(up[i][j],up[i-1][k]-s[i-1][k]+s[i-1][j]);
            for(int k=j;k<N;k++) down[i][j]=max(down[i][j],max(down[i-1][k],up[i-1][k])+s[i][k]-s[i][j]);
            //printf("%d %d %lld %lld\n",i,j,up[i][j],down[i][j]);
            dp[i]=max(dp[i],max(up[i][j],down[i][j]));
        }
    }
    return dp[N-1];
}

• 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