oj.uz

Submission #288237

# Submission time Handle Problem Language Result Execution time Memory
288237 2020-09-01T10:43:09 Z Habitus Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 576 ms 11640 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (int)2e5+99;
ll diff[N], n, q, s, t;
ll pov, nepov;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
       
    cin >> n >> q >> s >> t;
    ll pret; cin >> pret;
    for(int i=1; i<=n; ++i) {
        ll tren; cin >> tren;
        diff[i]=tren-pret;
        pret=tren;
        if(diff[i]>0LL) pov+=diff[i];
        else nepov-=diff[i];
    }
    //cout << pov << ' ' << nepov << endl;
    while(q--) {
        ll pr, dr, tr; cin >> pr >> dr >> tr;
        bool biopov;
        ll stari;
        
        stari=diff[pr];
        if(stari>0LL) biopov=true;
        else biopov=false;
        diff[pr]+=tr;
        if(diff[pr]>0LL && biopov) {
            pov-=stari-diff[pr];
        }
        else if(diff[pr]>0LL && !biopov) {
            nepov+=stari;
            pov+=diff[pr];
        }
        else if(biopov) {
            pov-=stari;
            nepov-=diff[pr];
        }
        else {
            nepov+=stari-diff[pr];    
        }
        
        //cout << pov << ' ' << nepov << endl;
        
        if(dr!=n) {
            stari=diff[dr+1];
            if(stari>0LL) biopov=true;
            else biopov=false;
            diff[dr+1]-=tr;
            if(diff[dr+1]>0LL && biopov) {
                pov-=stari-diff[dr+1];
            }
            else if(diff[dr+1]>0LL && !biopov) {
                nepov+=stari;
                pov+=diff[dr+1];
            }
            else if(biopov) {
                pov-=stari;
                nepov-=diff[dr+1];
            }
            else {
                nepov+=stari-diff[dr+1];    
            }
        }
        //for(int i=1; i<=n; ++i) cout << diff[i] << ' '; cout << endl;
        //cout << pov << ' ' << nepov << endl;
        cout << -pov*s + nepov*t << endl;
    }
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 571 ms 8696 KB Output is correct
2 Correct 553 ms 9464 KB Output is correct
3 Correct 553 ms 9976 KB Output is correct
4 Correct 560 ms 9512 KB Output is correct
5 Correct 556 ms 10536 KB Output is correct
6 Correct 535 ms 9592 KB Output is correct
7 Correct 520 ms 9464 KB Output is correct
8 Correct 557 ms 10360 KB Output is correct
9 Correct 553 ms 10744 KB Output is correct
10 Correct 544 ms 9464 KB Output is correct
11 Correct 524 ms 9464 KB Output is correct
12 Correct 526 ms 10232 KB Output is correct
13 Correct 527 ms 10428 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 571 ms 8696 KB Output is correct
23 Correct 553 ms 9464 KB Output is correct
24 Correct 553 ms 9976 KB Output is correct
25 Correct 560 ms 9512 KB Output is correct
26 Correct 556 ms 10536 KB Output is correct
27 Correct 535 ms 9592 KB Output is correct
28 Correct 520 ms 9464 KB Output is correct
29 Correct 557 ms 10360 KB Output is correct
30 Correct 553 ms 10744 KB Output is correct
31 Correct 544 ms 9464 KB Output is correct
32 Correct 524 ms 9464 KB Output is correct
33 Correct 526 ms 10232 KB Output is correct
34 Correct 527 ms 10428 KB Output is correct
35 Correct 559 ms 9004 KB Output is correct
36 Correct 554 ms 10364 KB Output is correct
37 Correct 561 ms 11220 KB Output is correct
38 Correct 557 ms 11092 KB Output is correct
39 Correct 555 ms 11128 KB Output is correct
40 Correct 576 ms 11004 KB Output is correct
41 Correct 553 ms 10732 KB Output is correct
42 Correct 574 ms 10788 KB Output is correct
43 Correct 561 ms 10244 KB Output is correct
44 Correct 553 ms 10616 KB Output is correct
45 Correct 561 ms 10724 KB Output is correct
46 Correct 548 ms 11640 KB Output is correct
47 Correct 518 ms 10232 KB Output is correct
48 Correct 523 ms 10180 KB Output is correct
49 Correct 544 ms 9356 KB Output is correct
50 Correct 519 ms 10232 KB Output is correct
51 Correct 519 ms 10528 KB Output is correct
52 Correct 523 ms 10232 KB Output is correct