Submission #1216835

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216835		cpdreamer	Catfish Farm (IOI22_fish)	C++17	0 / 100	1010 ms	2162688 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
typedef long long ll;
const ll MOD = (ll)1e9+7;
#define P pair
#define S second
#define F first
#define pb push_back
#define V vector
#define all(v) v.begin(), v.end()

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    V<V<ll>>pref(N,V<ll>(N+1));
    for (int i=0;i<M;i++) {
        pref[X[i]][Y[i]+1]+=W[i];
    }
    for (int i=0;i<N;i++) {
        for (int j=1;j<=N;j++) {
            pref[i][j]+=pref[i][j-1];
        }
    }
    ll dp[(int)N][N+1][2];
    memset(dp,0,sizeof(dp));
    for (int i=1;i<N;i++) {
        for (int j=0;j<=N;j++) {
            for (int g=0;g<=N;g++) {
                if (g>=j) {
                    dp[i][j][0]=max(dp[i][j][0],max(dp[i-1][g][0],dp[i-1][g][1])+pref[i][g]-pref[i][j]);
                }
                else {
                    dp[i][j][1]=max(dp[i][j][1],max(dp[i-1][g][0],dp[i-1][g][1]+pref[i-1][j]-pref[i-1][g]));
                }
            }
        }
    }
    ll ans=0;
    for (int i=0;i<=N;i++) {
        ans=max(ans,max(dp[N-1][i][0],dp[N-1][i][1]));
    }
    return ans;
}

• 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