Submission #1218169

#	Time	Username	Problem	Language	Result	Execution time	Memory
1218169		vanea	Catfish Farm (IOI22_fish)	C++20	9 / 100	947 ms	2162688 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;

int n, m;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N; m = M;
    bool f = true, s = true, t = true;
    for(int i = 0; i < m; i++) {
        if(X[i] & 1) f = false;
        if(X[i] > 1) s = false;
        if(Y[i] != 0) t = false;
    }
    if(f) {
        ll ans = 0;
        for(int i = 0; i < m; i++) ans += W[i];
        return ans;
    }
    if(s) {
        ll f1 = 0, s1 = 0;
        vector<ll> pref(n+1);
        for(int i = 0; i < m; i++) {
            if(X[i] == 0) f1 += W[i];
            else s1 += W[i];
        }
        if(n <= 2) return max(f1, s1);
        vector<ll> pref1(n+1), pref2(n+1);
        for(int i = 0; i < m; i++) {
            if(X[i] == 0) pref1[Y[i]] += W[i];
            else pref2[Y[i]] += W[i];
        }
        ll ans = max(f1, s1);
        for(int i = 1; i <= n; i++) {
            pref1[i] += pref1[i-1];
            pref2[i] += pref2[i-1];
        }
        for(int i = 0; i < n; i++) {
            ans = max(ans, s1-pref2[i]+pref1[i]);
        }
        return ans;
    }
    vector<vector<ll>> pref(n+1, vector<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];
        }
    }
    vector<vector<array<ll, 2>>> dp(n+1, vector<array<ll, 2>>(n+1));
    ll ans = 0;
    for(int i = 1; i < n; i++) {
        for(int j = 0; j <= n; j++) {
            for(int k = 0; k <= n; k++) {
                    dp[i][j][0] = max({dp[i][j][0],
                                      max(dp[i-1][k][1], dp[i-1][k][0]) + max(0LL, pref[i][k] - pref[i][j])});

                    dp[i][j][1] = max({dp[i][j][1],
                                      max(dp[i-1][k][0], dp[i-1][k][1]) + max(0LL, pref[i-1][j]-pref[i-1][k])});
            }
        }
    }
    for(int i = 0; i <= n; i++) {
        ans = max({ans, dp[n-1][i][0], dp[n-1][i][1]});
    }
    return ans;
}

/*int main()
{
    cout << max_weights(4, 3, {0, 1, 2}, {0, 1, 2}, {1, 1, 1});
}*/

• Subtask 1: 3 / 3
• Subtask 2: 6 / 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