172612025-06-08 12:11:31algoproGamecpp17Time limit exceeded 30/1002.582s1208 KiB
// UUID: 42dc7668-93b9-4bfc-86de-bb184e7e5ff6
#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
1Accepted1ms500 KiB
2Accepted1ms316 KiB
subtask220/20
1Accepted1ms316 KiB
2Accepted1ms324 KiB
3Accepted2ms316 KiB
4Accepted4ms500 KiB
subtask30/70
1Accepted29ms460 KiB
2Accepted32ms464 KiB
3Accepted108ms496 KiB
4Accepted128ms508 KiB
5Accepted518ms868 KiB
6Accepted1.031s824 KiB
7Accepted716ms820 KiB
8Accepted592ms1076 KiB
9Accepted981ms1076 KiB
10Accepted1.347s1076 KiB
11Accepted861ms1076 KiB
12Accepted2.369s1076 KiB
13Accepted1.56s1076 KiB
14Time limit exceeded2.582s1208 KiB