oj.uz

Submission #155232

# Submission time Handle Problem Language Result Execution time Memory
155232 2019-09-27T07:51:29 Z kungfulon Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 152 ms 13196 KB 
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a);i <= (b);i++)
#define repd(i,a,b) for(int i = (a);i >= (b);i--)
#define PB push_back
#define F first
#define S second
#define Task ""
using namespace std;
template <class T> T read(T &a){a = 0;char c = cin.get();bool nega = 0;while(!isdigit(c) && c != '-') c = cin.get();if(c == '-') nega = 1,c = cin.get();a = c - 48;c = cin.get();while(isdigit(c)) a = a * 10 + c - 48,c = cin.get();if(nega) a = -a;return a;}
template <class T> void writep(T a){if(a > 9) writep(a / 10);cout.put(a % 10 + 48);}
template <class T> void write(T a){if(a < 0) cout.put('-'),a = -a;writep(a);cout.put(' ');}
template <class T> void writeln(T a){write(a);cout.put('\n');}
const int N = 200012;
int n,q,s,t;
long long a[N],b[N];
long long ans = 0;
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//	ifstream cin (Task".inp");
//	ofstream cout (Task".out");
    cin >> n >> q >> s >> t;
    rep(i,0,n) cin >> a[i];
    rep(i,1,n) b[i] = a[i-1] - a[i];
    rep(i,1,n)
        ans += 1ll*b[i] * (b[i] < 0 ? s : t);
    while(q--)
    {
        int l,r,val;
        cin >> l >> r >> val;
        ans -= 1ll*b[l] * (b[l] < 0 ? s : t);
        if(r+1 <= n)ans -= 1ll*b[r+1] * (b[r+1] < 0 ? s : t);
        b[l] -= val;
        b[r+1] += val;
        ans += 1ll*b[l] * (b[l] < 0 ? s : t);
        if(r+1 <= n)ans += 1ll*b[r+1] * (b[r+1] < 0 ? s : t);
        cout << ans << '\n';
    }
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 424 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 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 128 ms 4860 KB Output is correct
2 Correct 141 ms 5468 KB Output is correct
3 Correct 148 ms 6136 KB Output is correct
4 Correct 137 ms 5240 KB Output is correct
5 Correct 152 ms 6060 KB Output is correct
6 Correct 117 ms 6264 KB Output is correct
7 Correct 116 ms 6388 KB Output is correct
8 Correct 135 ms 6316 KB Output is correct
9 Correct 136 ms 6652 KB Output is correct
10 Correct 131 ms 5636 KB Output is correct
11 Correct 108 ms 6396 KB Output is correct
12 Correct 113 ms 6816 KB Output is correct
13 Correct 119 ms 11936 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 424 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 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 128 ms 4860 KB Output is correct
23 Correct 141 ms 5468 KB Output is correct
24 Correct 148 ms 6136 KB Output is correct
25 Correct 137 ms 5240 KB Output is correct
26 Correct 152 ms 6060 KB Output is correct
27 Correct 117 ms 6264 KB Output is correct
28 Correct 116 ms 6388 KB Output is correct
29 Correct 135 ms 6316 KB Output is correct
30 Correct 136 ms 6652 KB Output is correct
31 Correct 131 ms 5636 KB Output is correct
32 Correct 108 ms 6396 KB Output is correct
33 Correct 113 ms 6816 KB Output is correct
34 Correct 119 ms 11936 KB Output is correct
35 Correct 127 ms 10488 KB Output is correct
36 Correct 150 ms 11924 KB Output is correct
37 Correct 152 ms 12788 KB Output is correct
38 Correct 152 ms 12612 KB Output is correct
39 Correct 137 ms 12540 KB Output is correct
40 Correct 141 ms 12408 KB Output is correct
41 Correct 141 ms 12280 KB Output is correct
42 Correct 145 ms 12388 KB Output is correct
43 Correct 131 ms 11808 KB Output is correct
44 Correct 140 ms 12024 KB Output is correct
45 Correct 133 ms 12152 KB Output is correct
46 Correct 141 ms 13196 KB Output is correct
47 Correct 117 ms 11748 KB Output is correct
48 Correct 116 ms 11768 KB Output is correct
49 Correct 120 ms 10700 KB Output is correct
50 Correct 114 ms 11512 KB Output is correct
51 Correct 137 ms 11896 KB Output is correct
52 Correct 122 ms 11768 KB Output is correct