Submission #637238

#	Time	Username	Problem	Language	Result	Execution time	Memory
637238		pigeonbat	Catfish Farm (IOI22_fish)	C++17	0 / 100	1098 ms	122184 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 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++){
            up[i][j]=down[i-1][0]-s[i-1][0]+s[i-1][j+1];
            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+1]);
                down[i][j]=max(down[i][j],max(down[i-1][k],up[i-1][k])+s[i-1][k+1]-s[i-1][j]);
            }
        }
    }
    ll re=0;
    for(int i=0;i<N;i++) re=max(re,max(up[N-1][i],down[N-1][i]));
    return re;
}

• 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