Submission #1678008


Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

using int64 = long long;

int main() {
    int N;
    cin >> N;

    vector<int> a(N), prev(N);
    prev[0] = 0;

    int max_idx = -1;
    int64 sum = 0;
    for (int i = 0; i < N; i++) {
        cin >> a[i];
        sum += a[i];

        prev[i] = max_idx;
        if (max_idx < 0 or a[max_idx] < a[i]) {
            max_idx = i;
        }
    }

    priority_queue<int64> Q;
    int64 charge = 0;
    for (int i = N - 1; i >= max_idx; i--) {
        Q.push(a[i]);
        if (a[i] == a[max_idx]) charge++;
    }

    vector<int64> ans(N, 0);

    int64 op_sum = 0;
    while (max_idx != 0) {
        int prev_idx = prev[max_idx];
        /*
        cerr << "max_idx: " << max_idx << " prev_idx: " << prev_idx << endl;
        cerr << "charge: " << charge << endl;
        */

        int64 cnt = (a[max_idx] - a[prev_idx]) * charge;

        for (int i = prev_idx; i < max_idx; i++) Q.push(a[i]);

        while (!Q.empty() and Q.top() >= a[prev_idx]) {
            if (Q.top() != a[max_idx]) {
                cnt += Q.top() - a[prev_idx];
                charge++;
            }
            Q.pop();
        }

        ans[max_idx] = cnt;
        op_sum += cnt;
        max_idx = prev_idx;
    }

    ans[0] = sum - op_sum;

    for (int i = 0; i < N; i++) cout << ans[i] << endl;

    return 0;
}

Submission Info

Submission Time
Task E - Frequency
User myusa
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1444 Byte
Status AC
Exec Time 199 ms
Memory 2936 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 39
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 13 ms 512 KB
03.txt AC 2 ms 256 KB
04.txt AC 2 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 2 ms 256 KB
09.txt AC 17 ms 640 KB
10.txt AC 1 ms 256 KB
11.txt AC 190 ms 2936 KB
12.txt AC 191 ms 2936 KB
13.txt AC 184 ms 2936 KB
14.txt AC 183 ms 2932 KB
15.txt AC 194 ms 2936 KB
16.txt AC 199 ms 2932 KB
17.txt AC 198 ms 2432 KB
18.txt AC 198 ms 2932 KB
19.txt AC 170 ms 2932 KB
20.txt AC 188 ms 2936 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 13 ms 384 KB
25.txt AC 2 ms 256 KB
26.txt AC 2 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 194 ms 2560 KB
29.txt AC 198 ms 2688 KB
30.txt AC 196 ms 2688 KB
31.txt AC 193 ms 2560 KB
32.txt AC 191 ms 2560 KB
33.txt AC 193 ms 2932 KB
34.txt AC 191 ms 2932 KB
35.txt AC 195 ms 2932 KB
36.txt AC 193 ms 2932 KB
37.txt AC 190 ms 2932 KB