oj.uz

Submission #725086

# Submission time Handle Problem Language Result Execution time Memory
725086 2023-04-16T20:18:01 Z Bogdan1110 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 374 ms 13096 KB 
#include <bits/stdc++.h>
#define FAST {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define FILES {freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);}
#define ll long long
#define ull unsigned long long
#define pqueue priority_queue
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(a) (a).begin(), (a).end()
#define mp make_pair 
using namespace std;
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element


const double eps = 0.00000001;
const int NMAX = 200010;
const ll inf = LLONG_MAX/3;
const ll modi = 998244353;


ll a[NMAX], d[NMAX];
ll n,q,s,t;

ll diff(ll pret, ll x) {
    ll res = 0;
    if ( pret * x <= 0 ) {
        if ( abs(x) > abs(pret) ) {
            if ( pret < 0 ) {
                res -= t*abs(pret);
            }
            else {
                res += s*abs(pret);
            }
            x += pret;
            pret = 0;
        }
    }
    if (pret == 0) {
        if ( x >= 0 ) {
            res -= s*x;
        }
        else {
            res -= t*x;
        }
        return res;
    }
    if ( pret < 0 ) {
        res -= x*t;
    }
    else {
        res -= x*s;
    }
    return res;
}

void solve() {
    cin >> n >> q >> s >> t;
    for (int i = 0 ; i <= n ; i++ ) {
        cin >> a[i];
    }
    ll res = 0;
    for (int i = 1; i <= n ; i++ ) {
        d[i] = a[i]-a[i-1];
        if ( d[i] > 0 ) {
            res -= d[i]*s;
        }
        else {
            res -= d[i]*t;
        }
    }
    //cout << res << endl << endl;
    while(q--) {
        ll l,r,x;
        cin >> l >> r >> x;
        //cout << diff(d[l],x) << ' ' << diff(d[r+1],-x) << endl;
        res += diff(d[l],x);
        d[l] += x;
        if ( r < n ) {
            res += diff(d[r+1],-x);
            d[r+1] += -x;

        }
        cout << res << endl;
    }
}

int main () { 
    FAST

    int t=1;

    /*
    cin >> t;
    //*/

    int i = 1;
    while(t--) {
        //cout << "Case #" << i++ << ": " ;
        solve();
    }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:102:9: warning: unused variable 'i' [-Wunused-variable]
  102 |     int i = 1;
      |         ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 10280 KB Output is correct
2 Correct 332 ms 10960 KB Output is correct
3 Correct 360 ms 11364 KB Output is correct
4 Correct 316 ms 10764 KB Output is correct
5 Correct 334 ms 12016 KB Output is correct
6 Correct 374 ms 10992 KB Output is correct
7 Correct 314 ms 11012 KB Output is correct
8 Correct 330 ms 11792 KB Output is correct
9 Correct 345 ms 12104 KB Output is correct
10 Correct 330 ms 10824 KB Output is correct
11 Correct 307 ms 10932 KB Output is correct
12 Correct 324 ms 11608 KB Output is correct
13 Correct 314 ms 11792 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 332 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 327 ms 10280 KB Output is correct
23 Correct 332 ms 10960 KB Output is correct
24 Correct 360 ms 11364 KB Output is correct
25 Correct 316 ms 10764 KB Output is correct
26 Correct 334 ms 12016 KB Output is correct
27 Correct 374 ms 10992 KB Output is correct
28 Correct 314 ms 11012 KB Output is correct
29 Correct 330 ms 11792 KB Output is correct
30 Correct 345 ms 12104 KB Output is correct
31 Correct 330 ms 10824 KB Output is correct
32 Correct 307 ms 10932 KB Output is correct
33 Correct 324 ms 11608 KB Output is correct
34 Correct 314 ms 11792 KB Output is correct
35 Correct 332 ms 10472 KB Output is correct
36 Correct 347 ms 11836 KB Output is correct
37 Correct 332 ms 12596 KB Output is correct
38 Correct 346 ms 12476 KB Output is correct
39 Correct 342 ms 12572 KB Output is correct
40 Correct 349 ms 12372 KB Output is correct
41 Correct 340 ms 12236 KB Output is correct
42 Correct 346 ms 12388 KB Output is correct
43 Correct 364 ms 11592 KB Output is correct
44 Correct 333 ms 12028 KB Output is correct
45 Correct 368 ms 12092 KB Output is correct
46 Correct 357 ms 13096 KB Output is correct
47 Correct 314 ms 11596 KB Output is correct
48 Correct 314 ms 11644 KB Output is correct
49 Correct 336 ms 10608 KB Output is correct
50 Correct 305 ms 11456 KB Output is correct
51 Correct 311 ms 11988 KB Output is correct
52 Correct 311 ms 11624 KB Output is correct