Submission #839357

#	Time	Username	Problem	Language	Result	Execution time	Memory
839357		Trunkty	Catfish Farm (IOI22_fish)	C++17	0 / 100	829 ms	155864 KiB

fish

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll

#include "fish.h"

ll arr[3005][3005],prearr[3005][3005];
ll dp[3005][3005],dp2[3005][3005]; // dp2 if adjacent AND lower

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
    for(int i=0;i<m;i++){
        arr[x[i]+1][y[i]+1] = w[i];
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            prearr[i][j] = prearr[i][j-1]+arr[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            // if first port
            dp[i][j] = prearr[i-1][j]+prearr[i+1][j];
            if(i-1<=0){
                continue;
            }
            for(int k=1;k<=n;k++){
                // build port at x=i, height = j, connects to port at x=i-1, height = k
                if(j>k){
                    dp[i][j] = max(dp[i][j],dp[i-1][k]-prearr[i][k]+prearr[i+1][j]+prearr[i-1][j]-prearr[i-1][k]);
                }
                else{
                    dp2[i][j] = max(dp2[i][j],max(dp[i-1][k],dp2[i-1][k])-prearr[i][j]+prearr[i+1][j]);
                }
            }
            if(i-2<=0){
                continue;
            }
            //cout << dp[i][j] << " " << i << " " << j << "a\n";
            for(int k=1;k<=n;k++){
                // build port at x=i, height = j, connects to port at x=i-2, height = k.
                if(j>k){
                    dp[i][j] = max(dp[i][j],max(dp[i-2][k],dp2[i-2][k])-prearr[i-1][k]+prearr[i+1][j]+prearr[i-1][j]);
                }
                else{
                    dp[i][j] = max(dp[i][j],max(dp[i-2][k],dp2[i-2][k])+prearr[i+1][j]);
                }
            }
            //cout << dp[i][j] << " " << i << " " << j << "a\n";
            if(i-3<=0){
                continue;
            }
            for(int k=1;k<=n;k++){
                // build port at x=i, height = j, connects to port at x=i-3, height = k
                dp[i][j] = max(dp[i][j],max(dp[i-3][k],dp2[i-3][k])+prearr[i-1][j]+prearr[i+1][j]);
            }
            //cout << dp[i][j] << " " << i << " " << j << "a\n";
        }
    }
    //cout << arr[1][3] << "\n";
    //cout << prearr[1][3] << "\n";
    //cout << dp[2][3] << "\n";
    ll ans=0;
    for(int i=0;i<=n;i++){
        ans = max(ans,dp[n][i]);
    }
    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