oj.uz

답안 #767856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
767856 2023-06-27T08:33:03 Z LucaIlie Homecoming (BOI18_homecoming) C++17
13 / 100
 38 ms 23316 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 ) {
    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++ ) {
        long long s = 0;
        for ( int i = 0; i <= k; i++ ) {
            dp[n + i] = -s * (1 - take);
            s += b[i];
        }

        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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 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 732 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Incorrect 1 ms 468 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 38 ms 23316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 348 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 732 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Incorrect 1 ms 468 KB Output isn't correct
11 Halted 0 ms 0 KB -