oj.uz

Submission #767156

# Submission time Handle Problem Language Result Execution time Memory
767156 2023-06-26T12:54:31 Z LucaIlie Homecoming (BOI18_homecoming) C++17
13 / 100
 36 ms 15948 KB 
#include <bits/stdc++.h>
#include "homecoming.h"
using namespace std;
const long long INF = 1e16;
const int MAX_N = 4e6 + 1; 
deque<int> maxVal;long long sumB[MAX_N], dp[MAX_N], val[MAX_N]; 
void add( int i ) {    while ( !maxVal.empty() && val[i] > val[maxVal.back()] )        maxVal.pop_back();    maxVal.push_back( i );} 

void rem( int i ) {    if ( !maxVal.empty() && maxVal.front() == i )        maxVal.pop_front();}

long long getVal( int i ) {    if ( maxVal.front() == 0 )        return dp[0];    return dp[maxVal.front()] - (sumB[i + 1] - sumB[maxVal.front()]);} 

long long solve( int n, int k, int a[], int b[] ) {    long long ans = 0;     for ( int i = n; i <= n + k; i++ )        sumB[i] = 0;    for ( int i = n - 1; i >= 0; i-- )        sumB[i] = sumB[i + 1] + b[i];     for ( int take = 0; take <= 1; take++ ) {        if ( !take ) {            long long s = 0;            for ( int i = 0; i <= k; i++ ) {                dp[n + i] = -s;                s += b[i];            }        } else {            for ( int i = 0; i <= k; i++ )                dp[n + i] = 0;        }         maxVal.clear();        for ( int i = n + k - 1; i >= n; i-- ) {            val[i] = dp[i] + sumB[i - 1];            add( i );        }          long long maxA = dp[n + k];        for ( int i = n - 1; i >= 0; i-- ) {            dp[i] = -INF;            if ( i >= k * take ) {                dp[i] = max( getVal( i ), maxA );                val[i] = dp[i] + sumB[i];                add( i );            }             rem( i + k );            maxA = max( maxA, dp[i + k] - (sumB[i + 1] - sumB[i + k]) );            maxA = maxA - b[i] + a[i];        }         ans = max( ans, getVal( -1 ) );        ans = max( ans, maxA );    }     return ans;}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 15948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -