oj.uz

Submission #767010

# Submission time Handle Problem Language Result Execution time Memory
767010 2023-06-26T10:14:38 Z LucaIlie Homecoming (BOI18_homecoming) C++17
31 / 100
 136 ms 196164 KB 
#include <bits/stdc++.h>
#include "homecoming.h"

using namespace std;

const long long INF = 1e16;
const int MAX_N = 5000;
long long dp[MAX_N + 1][MAX_N + 1];

long long solve( int n, int k, int a[], int b[] ) {
    long long ans = 0;

    for ( int take = 0; take <= 1; take++ ) {
        if ( !take ) {
            dp[n][0] = 0;
            for ( int j = 1; j <= k; j++ )
                dp[n][j] = dp[n][j - 1] - b[j - 1];
        } else {
            for ( int j = 0; j <= k; j++ )
                dp[n][j] = 0;
        }

        for ( int i = n - 1; i >= 0; i-- ) {
            dp[i][0] = -INF;
            if ( i >= k * take ) {
                for ( int j = 0; j <= k; j++ )
                    dp[i][0] = max( dp[i][0], dp[i + 1][j] );
            }

            for ( int j = 1; j < k; j++ )
                dp[i][j] = dp[i + 1][j - 1] - b[i];

            dp[i][k] = max( dp[i + 1][k - 1], dp[i + 1][k] ) - b[i] + a[i];
        }

        for ( int j = 0; j <= k; j++ )
            ans = max( ans, dp[0][j] );
    }

    return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3924 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3924 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 136 ms 196164 KB Output is correct
7 Correct 109 ms 167808 KB Output is correct
8 Correct 22 ms 27956 KB Output is correct
9 Correct 13 ms 24660 KB Output is correct
10 Correct 1 ms 468 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 12596 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 3924 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 1 ms 1364 KB Output is correct
6 Correct 136 ms 196164 KB Output is correct
7 Correct 109 ms 167808 KB Output is correct
8 Correct 22 ms 27956 KB Output is correct
9 Correct 13 ms 24660 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Runtime error 35 ms 12596 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -