Submission #1023445

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023445		Issa	Catfish Farm (IOI22_fish)	C++17	0 / 100	924 ms	465728 KiB

fish

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

const int maxn = 3e3 + 100;
const int maxl = 11;

int n;
ll dp[maxn][maxn][2];
ll a[maxn][maxn];

long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    n = N;
    for(int i = 0; i < M; i++){
        X[i]++; Y[i]++;
        a[X[i]][Y[i]] += W[i];
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            a[i][j] += a[i][j-1];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            dp[i][j][0] = dp[i][j][1] = -(ll)1e18;
            if(i == 1) dp[i][j][1] = dp[i][j][0] = 0;
        }
    }
    for(int i = 1; i < n; i++){
        for(int j = 0; j <= n; j++){
            for(int k = 0; k <= n; k++){
                if(j <= k){
                    dp[i+1][k][1] = max(dp[i+1][k][1], dp[i][j][1] + a[i][k] - a[i][j]);
                }
                if(j >= k){
                    dp[i+1][k][0] = max(dp[i+1][k][0], dp[i][j][0] + a[i+1][j] - a[i+1][k]);
                }
                if(i + 2 <= n){
                    dp[i+2][k][0] = max(dp[i+2][k][0], dp[i][j][1] + a[i][n] + a[i+2][n] - a[i][j] - a[i+2][k]);
                    dp[i+2][k][1] = max(dp[i+2][k][1], dp[i][j][0] + a[i+1][max(j, k)]);
                }
            }
        }
    }
    // for(int i = 1; i <= n; i++){
    //     for(int j = 0; j <= n; j++){
    //         cout << dp[i][j][0] << ' ';
    //     } cout << endl;
    //     for(int j = 0; j <= n; j++){
    //         cout << dp[i][j][1] << ' ';
    //     } cout << endl << endl;
    // }
    ll ans = 0;
    for(int i = 0; i <= n; i++){
        for(int c = 0; c < 2; c++){
            ans = max(ans, dp[n][i][c]);
            ans = max(ans, dp[n-1][i][c] + a[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