Submission #1042023

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042023		VMaksimoski008	Catfish Farm (IOI22_fish)	C++17	12 / 100	50 ms	7288 KiB

fish

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

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    int mask = 0, mx = 0;
    for(int i=0; i<M; i++) mask |= (1 << (X[i] % 2));
    for(int i=0; i<M; i++) mx = max(mx, Y[i]);

    if(mask == 1) {
        ll ans = 0;
        for(int &x : W) ans += x;
        return ans;
    }

    if(mx == 0) {
        vector<ll> val(N+5), dp(N+5);
        for(int i=0; i<M; i++) val[X[i]] = W[i];

        ll ans = 0;
        vector<ll> MX(N+5); MX[0] = val[1];
        for(int i=1; i<N; i++) {
            dp[i] = max(dp[i-1], val[i-1]);
            if(i >= 3) dp[i] = max(dp[i], MX[i-3] + val[i-1]);
            if(i >= 2) dp[i] = max(dp[i], dp[i-2] + val[i-1]);
            MX[i] = max(MX[i-1], dp[i] + val[i+1]);
        }

        for(int i=0; i<N; i++) ans = max(ans, dp[i] + val[i+1]);
        return ans;
    }

    if(mx <= 8) {
        vector<vector<ll> > val(N+5, vector<ll>(mx+1));
        vector<vector<ll> > dp(N+5, vector<ll>(mx+1));
        for(int i=0; i<M; i++) val[X[i]][Y[i]] = W[i];
        for(int i=0; i<N; i++)
            for(int j=1; j<=mx; j++) val[i][j] += val[i][j-1];

        //dp here, gl&hf
        for(int i=1; i<N; i++) {
            for(int j=0; j<=mx; j++) {
                dp[i][j] = val[i-1][j];

                // //i-1
                // if(i >= 2) {

                // }

                //i-2
                if(i >= 2) for(int k=0; k<=mx; k++) dp[i][j] = max(dp[i][j], dp[i-2][k] + max(val[i-1][j], val[i-1][k]));
                //<=i-3
                for(int k=i-3; k>=0; k--)
                    for(int l=0; l<=mx; l++) dp[i][j] = max(dp[i][j], dp[k][l] + val[k+1][l] + val[i-1][j]);
            }
        }

        ll ans = 0;
        for(int i=0; i<N; i++)
            for(int j=0; j<=mx; j++) ans = max(ans, dp[i][j] + val[i+1][j]);
        return ans;
    }


    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 9 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16