oj.uz

Submission #287582

# Submission time Handle Problem Language Result Execution time Memory
287582 2020-08-31T20:24:21 Z fgojko Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 553 ms 11896 KB 
#include <iostream>
#include <vector>

//#define FEEDBACK

using namespace std;

typedef long long ll;

int main()
{
  	ios_base::sync_with_stdio(false);
    int n, q;
    ll s, t;
    cin >> n >> q >> s >> t;
    s *= -1;
    vector<ll> vec(n);
    ll l1, l2;
    cin >> l1;
    ll temp = 0;
    for(int i = 0; i < n; ++i){
        cin >> l2;
        vec[i] = l1-l2;
        if(vec[i] < 0){
            temp -= vec[i]*s;
        }
        else{
            temp += vec[i]*t;
        }
        l1 = l2;
    }
    int l, k;
    ll x, y;
    vector<ll> res(q);
    bool b1, b2;
    for(int i = 0; i < q; ++i){
        cin >> l >> k >> x;
        --l;
        y = vec[l];
        vec[l] -= x;
        if(y < 0){
            temp += y*s;
        }
        else{
            temp -= y*t;
        }
        if(vec[l] < 0){
            temp -= vec[l]*s;
        }
        else{
            temp += vec[l]*t;
        }
        if(k < n){
            y = vec[k];
            vec[k] += x;
            if(y < 0){
                temp += y*s;
            }
            else{
                temp -= y*t;
            }
            if(vec[k] < 0){
                temp -= vec[k]*s;
            }
            else{
                temp += vec[k]*t;
            }
        }
        res[i] = temp;
    }
    for(int i = 0; i < q; ++i){
        cout << res[i] << endl;
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:35:10: warning: unused variable 'b1' [-Wunused-variable]
   35 |     bool b1, b2;
      |          ^~
foehn_phenomena.cpp:35:14: warning: unused variable 'b2' [-Wunused-variable]
   35 |     bool b1, b2;
      |              ^~

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 5 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 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 428 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 523 ms 5120 KB Output is correct
2 Correct 540 ms 5752 KB Output is correct
3 Correct 534 ms 6264 KB Output is correct
4 Correct 526 ms 5368 KB Output is correct
5 Correct 553 ms 6008 KB Output is correct
6 Correct 520 ms 11044 KB Output is correct
7 Correct 511 ms 11128 KB Output is correct
8 Correct 534 ms 10872 KB Output is correct
9 Correct 531 ms 11256 KB Output is correct
10 Correct 533 ms 9848 KB Output is correct
11 Correct 509 ms 10968 KB Output is correct
12 Correct 513 ms 11640 KB Output is correct
13 Correct 514 ms 11896 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 5 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 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 428 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 523 ms 5120 KB Output is correct
23 Correct 540 ms 5752 KB Output is correct
24 Correct 534 ms 6264 KB Output is correct
25 Correct 526 ms 5368 KB Output is correct
26 Correct 553 ms 6008 KB Output is correct
27 Correct 520 ms 11044 KB Output is correct
28 Correct 511 ms 11128 KB Output is correct
29 Correct 534 ms 10872 KB Output is correct
30 Correct 531 ms 11256 KB Output is correct
31 Correct 533 ms 9848 KB Output is correct
32 Correct 509 ms 10968 KB Output is correct
33 Correct 513 ms 11640 KB Output is correct
34 Correct 514 ms 11896 KB Output is correct
35 Correct 529 ms 9592 KB Output is correct
36 Correct 538 ms 11028 KB Output is correct
37 Correct 541 ms 11896 KB Output is correct
38 Correct 533 ms 11700 KB Output is correct
39 Correct 535 ms 11640 KB Output is correct
40 Correct 536 ms 11512 KB Output is correct
41 Correct 537 ms 11512 KB Output is correct
42 Correct 539 ms 11640 KB Output is correct
43 Correct 535 ms 10808 KB Output is correct
44 Correct 527 ms 11128 KB Output is correct
45 Correct 528 ms 11128 KB Output is correct
46 Correct 537 ms 11640 KB Output is correct
47 Correct 525 ms 11768 KB Output is correct
48 Correct 518 ms 11896 KB Output is correct
49 Correct 529 ms 10744 KB Output is correct
50 Correct 519 ms 11512 KB Output is correct
51 Correct 514 ms 11772 KB Output is correct
52 Correct 516 ms 11640 KB Output is correct