// UUID: 8b535f97-ae0c-4e17-9f48-cca1ae944dee
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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;
}| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 10/10 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 500 KiB | ||||
| subtask2 | 20/20 | ||||||
| 1 | Accepted | 1ms | 316 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| 3 | Accepted | 2ms | 316 KiB | ||||
| 4 | Accepted | 4ms | 508 KiB | ||||
| subtask3 | 0/70 | ||||||
| 1 | Accepted | 29ms | 456 KiB | ||||
| 2 | Accepted | 32ms | 464 KiB | ||||
| 3 | Accepted | 107ms | 316 KiB | ||||
| 4 | Accepted | 128ms | 512 KiB | ||||
| 5 | Accepted | 518ms | 820 KiB | ||||
| 6 | Accepted | 1.031s | 824 KiB | ||||
| 7 | Accepted | 714ms | 824 KiB | ||||
| 8 | Accepted | 592ms | 980 KiB | ||||
| 9 | Accepted | 981ms | 1132 KiB | ||||
| 10 | Accepted | 1.347s | 1080 KiB | ||||
| 11 | Accepted | 861ms | 1076 KiB | ||||
| 12 | Accepted | 2.371s | 1076 KiB | ||||
| 13 | Accepted | 1.562s | 1172 KiB | ||||
| 14 | Time limit exceeded | 2.579s | 988 KiB | ||||