oj.uz

Submission #155177

# Submission time Handle Problem Language Result Execution time Memory
155177 2019-09-26T19:02:59 Z mat_v Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 711 ms 13284 KB 
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define mod 1000000007
#define pb push_back
#define mid(l, r) ((l)+(r))/2
#define len(a) (a).length()
#define sz(a) (a).size()
#define xx first
#define yy second
#define inf int(2e9)
#define ff(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i, a, b) for(int (i) = (a); (i) >= (b); --(i))
#define maxn 200005

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

template<class T>
void print(const T niz[], const int siz)
{
    for(int i=0;i<siz;i++)
        cout << niz[i] << " ";
    cout << endl;
}

int n,q;
ll s,t;
ll niz[maxn];
ll dif[maxn];
ll res;
int main()
{
    ios_base::sync_with_stdio(false);
    cin >> n >> q >> s >> t;
    ff(i,0,n)cin >> niz[i];
    ff(i,0,n-1){
        dif[i] = niz[i + 1] - niz[i];
        if(dif[i] > 0)res -= dif[i]*s;
        else res -= dif[i]*t;
    }
    while(q--){
        int l,r;
        ll x;
        cin >> l >> r >> x;
        if(dif[l-1] > 0)res += dif[l-1]*s;
        else res += dif[l-1]*t;
        dif[l-1] += x;
        if(dif[l-1] > 0)res -= dif[l-1]*s;
        else res -= dif[l-1]*t;
        if(r != n){
            if(dif[r] > 0)res += dif[r]*s;
            else res += dif[r]*t;
            dif[r] -= x;
            if(dif[r] > 0)res -= dif[r]*s;
            else res -= dif[r]*t;
        }
        cout << res << endl;
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp:2:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 680 ms 5388 KB Output is correct
2 Correct 695 ms 10976 KB Output is correct
3 Correct 686 ms 11636 KB Output is correct
4 Correct 688 ms 11000 KB Output is correct
5 Correct 686 ms 12152 KB Output is correct
6 Correct 656 ms 11128 KB Output is correct
7 Correct 655 ms 11128 KB Output is correct
8 Correct 685 ms 11896 KB Output is correct
9 Correct 699 ms 12408 KB Output is correct
10 Correct 693 ms 11112 KB Output is correct
11 Correct 643 ms 11128 KB Output is correct
12 Correct 649 ms 11896 KB Output is correct
13 Correct 641 ms 12024 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 9 ms 472 KB Output is correct
6 Correct 9 ms 376 KB Output is correct
7 Correct 9 ms 504 KB Output is correct
8 Correct 9 ms 548 KB Output is correct
9 Correct 9 ms 504 KB Output is correct
10 Correct 9 ms 504 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 9 ms 504 KB Output is correct
13 Correct 9 ms 376 KB Output is correct
14 Correct 9 ms 476 KB Output is correct
15 Correct 8 ms 504 KB Output is correct
16 Correct 8 ms 508 KB Output is correct
17 Correct 9 ms 376 KB Output is correct
18 Correct 9 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 680 ms 5388 KB Output is correct
23 Correct 695 ms 10976 KB Output is correct
24 Correct 686 ms 11636 KB Output is correct
25 Correct 688 ms 11000 KB Output is correct
26 Correct 686 ms 12152 KB Output is correct
27 Correct 656 ms 11128 KB Output is correct
28 Correct 655 ms 11128 KB Output is correct
29 Correct 685 ms 11896 KB Output is correct
30 Correct 699 ms 12408 KB Output is correct
31 Correct 693 ms 11112 KB Output is correct
32 Correct 643 ms 11128 KB Output is correct
33 Correct 649 ms 11896 KB Output is correct
34 Correct 641 ms 12024 KB Output is correct
35 Correct 683 ms 10588 KB Output is correct
36 Correct 688 ms 11936 KB Output is correct
37 Correct 695 ms 12776 KB Output is correct
38 Correct 708 ms 12568 KB Output is correct
39 Correct 682 ms 12492 KB Output is correct
40 Correct 711 ms 12552 KB Output is correct
41 Correct 687 ms 12384 KB Output is correct
42 Correct 686 ms 12536 KB Output is correct
43 Correct 685 ms 11792 KB Output is correct
44 Correct 682 ms 12232 KB Output is correct
45 Correct 679 ms 12152 KB Output is correct
46 Correct 683 ms 13284 KB Output is correct
47 Correct 647 ms 11640 KB Output is correct
48 Correct 656 ms 11764 KB Output is correct
49 Correct 671 ms 11000 KB Output is correct
50 Correct 666 ms 11620 KB Output is correct
51 Correct 642 ms 12036 KB Output is correct
52 Correct 648 ms 11788 KB Output is correct