oj.uz

Submission #207791

# Submission time Handle Problem Language Result Execution time Memory
207791 2020-03-09T03:24:15 Z tri Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 837 ms 11640 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

const int MAXN = 2e5 + 10;

ll d[MAXN];
int N, Q;
ll S, T;

ll cost = 0;

void update(ll d, int x) {
    if (d > 0) {
        cost -= d * S * x;
    } else {
        cost += abs(d) * T * x;
    }
}

int main() {
    cin >> N >> Q >> S >> T;

    int last = 0;
    cin >> last;
    assert(last == 0);
    for (int i = 0; i < N; i++) {
        int c;
        cin >> c;
        d[i] = c - last;
        last = c;
    }

    for (int i = 0; i < N; i++) {
        update(d[i], 1);
    }
//    cout << cost << endl;

    for (int i = 0; i < Q; i++) {
        int l, r, x;
        cin >> l >> r >> x;

        l--;
        update(d[l], -1);
        d[l] += x;
        update(d[l], 1);

        if (r < N) {
            update(d[r], -1);
            d[r] -= x;
            update(d[r], 1);
        }

//        for (int i = 0; i < N; i++) {
//            cout << d[i] << " ";
//        }
//        cout << endl;

        cout << cost << endl;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 376 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 12 ms 376 KB Output is correct
5 Correct 12 ms 504 KB Output is correct
6 Correct 12 ms 504 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 12 ms 376 KB Output is correct
9 Correct 12 ms 376 KB Output is correct
10 Correct 13 ms 376 KB Output is correct
11 Correct 13 ms 504 KB Output is correct
12 Correct 12 ms 376 KB Output is correct
13 Correct 13 ms 376 KB Output is correct
14 Correct 13 ms 380 KB Output is correct
15 Correct 12 ms 376 KB Output is correct
16 Correct 12 ms 380 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 12 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 803 ms 3836 KB Output is correct
2 Correct 787 ms 4472 KB Output is correct
3 Correct 783 ms 4912 KB Output is correct
4 Correct 822 ms 9592 KB Output is correct
5 Correct 837 ms 10604 KB Output is correct
6 Correct 736 ms 9720 KB Output is correct
7 Correct 749 ms 9492 KB Output is correct
8 Correct 796 ms 10360 KB Output is correct
9 Correct 799 ms 10748 KB Output is correct
10 Correct 818 ms 9464 KB Output is correct
11 Correct 734 ms 9464 KB Output is correct
12 Correct 766 ms 10256 KB Output is correct
13 Correct 763 ms 10364 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 376 KB Output is correct
2 Correct 12 ms 376 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 12 ms 376 KB Output is correct
5 Correct 12 ms 504 KB Output is correct
6 Correct 12 ms 504 KB Output is correct
7 Correct 13 ms 376 KB Output is correct
8 Correct 12 ms 376 KB Output is correct
9 Correct 12 ms 376 KB Output is correct
10 Correct 13 ms 376 KB Output is correct
11 Correct 13 ms 504 KB Output is correct
12 Correct 12 ms 376 KB Output is correct
13 Correct 13 ms 376 KB Output is correct
14 Correct 13 ms 380 KB Output is correct
15 Correct 12 ms 376 KB Output is correct
16 Correct 12 ms 380 KB Output is correct
17 Correct 12 ms 376 KB Output is correct
18 Correct 12 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 803 ms 3836 KB Output is correct
23 Correct 787 ms 4472 KB Output is correct
24 Correct 783 ms 4912 KB Output is correct
25 Correct 822 ms 9592 KB Output is correct
26 Correct 837 ms 10604 KB Output is correct
27 Correct 736 ms 9720 KB Output is correct
28 Correct 749 ms 9492 KB Output is correct
29 Correct 796 ms 10360 KB Output is correct
30 Correct 799 ms 10748 KB Output is correct
31 Correct 818 ms 9464 KB Output is correct
32 Correct 734 ms 9464 KB Output is correct
33 Correct 766 ms 10256 KB Output is correct
34 Correct 763 ms 10364 KB Output is correct
35 Correct 788 ms 8952 KB Output is correct
36 Correct 816 ms 10488 KB Output is correct
37 Correct 795 ms 11128 KB Output is correct
38 Correct 822 ms 10908 KB Output is correct
39 Correct 802 ms 11000 KB Output is correct
40 Correct 835 ms 10880 KB Output is correct
41 Correct 798 ms 10872 KB Output is correct
42 Correct 814 ms 11012 KB Output is correct
43 Correct 800 ms 10320 KB Output is correct
44 Correct 811 ms 10700 KB Output is correct
45 Correct 813 ms 10604 KB Output is correct
46 Correct 828 ms 11640 KB Output is correct
47 Correct 751 ms 10232 KB Output is correct
48 Correct 732 ms 10232 KB Output is correct
49 Correct 764 ms 9336 KB Output is correct
50 Correct 728 ms 10244 KB Output is correct
51 Correct 774 ms 10360 KB Output is correct
52 Correct 741 ms 10188 KB Output is correct