oj.uz

Submission #858431

# Submission time Handle Problem Language Result Execution time Memory
858431 2023-10-08T13:32:22 Z LucaIlie Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 140272 KB 
#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;
long long dp[MAX_N][MAX_N], dpLower[MAX_N][MAX_N];
int costCell[MAX_N][MAX_N];
long long 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] = -INF;
            for ( int prevY = 0; prevY <= crtY; prevY++ ) {
                dpLower[x][crtY] = max( dpLower[x][crtY], dpLower[x - 1][prevY] + spX[x][prevY] - spX[x][crtY] );
                dp[x][crtY] = max( dp[x][crtY], dpLower[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][crtY] - spX[x - 1][prevY] );
            }
            for ( int prevY = crtY; prevY <= n; 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] );
            }
            //printf( "%lld ", dp[x][crtY] );
        }
        //printf( "\n" );
    }

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

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 140272 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 125672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 6492 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 125672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 140272 KB Time limit exceeded
2 Halted 0 ms 0 KB -