Submission #858458

#	Time	Username	Problem	Language	Result	Execution time	Memory
858458		LucaIlie	메기 농장 (IOI22_fish)	C++17	0 / 100	639 ms	158488 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 3002;
const int MAX_M = 3e5;
const long long INF = 1e18;
int costCell[MAX_N][MAX_N];
long long dp[MAX_N][MAX_N], dpLower[MAX_N][MAX_N], spX[MAX_N][MAX_N];

long long max_weights( int n, int m, vector <int> X, vector <int> Y, vector <int> W ) {

    for ( int i = 0; i < m; i++ ) {
        X[i]++;
        Y[i]++;
        costCell[X[i]][Y[i]] = W[i];
    }

    for ( int x = 1; x <= n; x++ ) {
        for ( int y = 1; y <= n; y++ )
            spX[x][y] = spX[x][y - 1] + costCell[x][y];
    }

    for ( int crtY = 1; crtY <= n; crtY++ )
        dp[0][crtY] = dpLower[0][crtY] = -INF;
    dp[0][0] = dpLower[0][0] = 0;
    for ( int x = 1; x <= n + 1; x++ ) {
        for ( int crtY = 0; crtY <= n; crtY++ ) {
            dp[x][crtY] = dpLower[x][crtY] = -INF;
            for ( int prevY = 0; prevY <= crtY; prevY++ ) {
                dpLower[x][crtY] = max( dpLower[x][crtY], dpLower[x - 1][prevY] + spX[x - 1][crtY] - spX[x - 1][prevY] );
                if ( x >= 2 )
                    dpLower[x][crtY] = max( dpLower[x][crtY], dpLower[x - 2][prevY] + spX[x - 1][crtY] );

                dp[x][crtY] = max( dp[x][crtY], dpLower[x - 1][prevY] + spX[x - 1][crtY] - spX[x - 1][prevY] );
                if ( x >= 2 )
                    dp[x][crtY] = max( dp[x][crtY], dp[x - 2][prevY] + spX[x - 1][crtY] );
            }
            for ( int prevY = crtY; prevY <= n; prevY++ ) {
                if ( x >= 2 )
                    dpLower[x][crtY] = max( dpLower[x][crtY], dpLower[x - 2][prevY] + spX[x - 1][prevY] );

                dp[x][crtY] = max( dp[x][crtY], dp[x - 1][prevY] + spX[x][prevY] - spX[x][crtY] );
                if ( x >= 2 )
                    dp[x][crtY] = max( dp[x][crtY], dp[x - 2][prevY] + spX[x - 1][prevY] );
            }
            //printf( "%lld ", dpLower[x][crtY] );
        }
        //printf( "\n" );
    }

    return dp[n + 1][0];
}

• 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