172622025-06-08 12:12:01algoproGamecpp17Time limit exceeded 30/1002.578s1140 KiB
// UUID: c319eabb-ba26-407b-808b-30b5ac74fa4e
#include <iostream>

using namespace std;

const int MAX_N = 1e5;
int a[MAX_N];

int f[1 + MAX_N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin >> n >> k;
    for ( int i = 0; i < n; i ++ )
        cin >> a[i];
        
    for ( ; k > 0; k -- ) {
        int p;
        cin >> p;
        for ( int i = 1; i <= n; i ++ )
            f[i] = 0;
        for ( int i = 0; i < p; i ++ )
            f[a[i]] ++;
            
        int mx = n, pocket = 0, player = 1;
        long long score = 0;
        for ( int i = p; i < n; i ++, player *= -1 ) {
            if ( pocket ) {
                score += pocket * player;
                pocket = 0;
            } else {
                while ( !f[mx] )
                    mx --;
                f[mx] --;
                score += mx * player;
            }
            if ( a[i] <= mx )
                f[a[i]] ++;
            else
                pocket = a[i];
        }
        
        for ( int i = 0; i < p; i ++, player *= -1 ) {
            if ( pocket ) {
                score += pocket * player;
                pocket = 0;
            } else {
                while ( !f[mx] )
                    mx --;
                f[mx] --;
                score += mx * player;
            }
        }
        cout << score << '\n';
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask110/10
1Accepted1ms316 KiB
2Accepted1ms316 KiB
subtask220/20
1Accepted1ms328 KiB
2Accepted1ms316 KiB
3Accepted2ms316 KiB
4Accepted4ms436 KiB
subtask30/70
1Accepted29ms460 KiB
2Accepted32ms464 KiB
3Accepted108ms496 KiB
4Accepted128ms512 KiB
5Accepted518ms860 KiB
6Accepted1.031s840 KiB
7Accepted716ms820 KiB
8Accepted593ms1080 KiB
9Accepted981ms1140 KiB
10Accepted1.348s1076 KiB
11Accepted862ms1076 KiB
12Accepted2.371s992 KiB
13Accepted1.56s1076 KiB
14Time limit exceeded2.578s1032 KiB