제출 #641865

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
641865	2022-09-17 17:26:15	Vanilla	메기 농장 (IOI22_fish)	C++17	35 / 100	1093 ms	119580 KiB

fish

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
#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][j];
            else up[i][j]=dp[i-2]+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];
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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