oj.uz

Submission #129283

# Submission time Handle Problem Language Result Execution time Memory
129283 2019-07-12T02:04:01 Z Dajunctic Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 565 ms 7416 KB 
/*
 _   ________   ___       __ ___   _           _  _
| | / /|  _  \ / _ \     / // _ \ | |         | |(_)
| |/ / | | | |/ /_\ \   / // /_\ \| | __ __ _ | | _
|    \ | | | ||  _  |  / / |  _  || |/ // _` || || |
| |\  \| |/ / | | | | / /  | | | ||   <| (_| || || |
\_| \_/|___/  \_| |_//_/   \_| |_/|_|\_\\__,_||_||_|
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5+50;
const int mod = 1e9+7;
#define pb push_back
const int in = 1e9+9;
typedef pair<int,int> ii;
int n, q, s, t;
int d[N], wind = 0, ans[N];
#define fi first
#define se second
signed main(){
	cin >> n >> q >> s >> t;
	int cur = 0;
	for(int i=0;i<=n;i++){
		cin >> d[i];
		d[i] = d[i] - cur;
		cur = d[i] + cur;
	}
	for(int i=1;i<=n;i++){
        if(d[i]>0) wind -= d[i] * s;
        else wind -= d[i] * t;
    }
    for(int i=1;i<=q;i++){
        int  a, b, x;
        cin >> a >> b >> x;
        if(d[a] > 0)  wind += d[a] * s;
        else wind += d[a] * t;
        if(b != n) {
            if(d[b+1]>0) wind += d[b+1] * s;
            else wind += d[b+1] * t;
        }
        d[a] += x;
        d[b+1] -= x;
        if(d[a] > 0)  wind -= d[a] * s;
        else  wind -= d[a] * t;
        if(b!=n) {
            if(d[b+1]>0) wind -= d[b+1] * s;
            else wind -= d[b+1] * t;
        }
        ans[i] = wind;
    }
    for(int i=1;i<=q;i++) cout << ans[i] << "\n";
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 380 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 428 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 400 KB Output is correct
16 Correct 6 ms 248 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 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 489 ms 4952 KB Output is correct
2 Correct 487 ms 5608 KB Output is correct
3 Correct 494 ms 6116 KB Output is correct
4 Correct 501 ms 5368 KB Output is correct
5 Correct 521 ms 6008 KB Output is correct
6 Correct 428 ms 6440 KB Output is correct
7 Correct 428 ms 6588 KB Output is correct
8 Correct 498 ms 6376 KB Output is correct
9 Correct 510 ms 6684 KB Output is correct
10 Correct 490 ms 5676 KB Output is correct
11 Correct 412 ms 6480 KB Output is correct
12 Correct 438 ms 6904 KB Output is correct
13 Correct 427 ms 7256 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 380 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 376 KB Output is correct
12 Correct 6 ms 428 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 7 ms 376 KB Output is correct
15 Correct 6 ms 400 KB Output is correct
16 Correct 6 ms 248 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 489 ms 4952 KB Output is correct
23 Correct 487 ms 5608 KB Output is correct
24 Correct 494 ms 6116 KB Output is correct
25 Correct 501 ms 5368 KB Output is correct
26 Correct 521 ms 6008 KB Output is correct
27 Correct 428 ms 6440 KB Output is correct
28 Correct 428 ms 6588 KB Output is correct
29 Correct 498 ms 6376 KB Output is correct
30 Correct 510 ms 6684 KB Output is correct
31 Correct 490 ms 5676 KB Output is correct
32 Correct 412 ms 6480 KB Output is correct
33 Correct 438 ms 6904 KB Output is correct
34 Correct 427 ms 7256 KB Output is correct
35 Correct 496 ms 5084 KB Output is correct
36 Correct 488 ms 6488 KB Output is correct
37 Correct 498 ms 7412 KB Output is correct
38 Correct 497 ms 7252 KB Output is correct
39 Correct 565 ms 7288 KB Output is correct
40 Correct 493 ms 7032 KB Output is correct
41 Correct 490 ms 6904 KB Output is correct
42 Correct 490 ms 7160 KB Output is correct
43 Correct 491 ms 6364 KB Output is correct
44 Correct 491 ms 6904 KB Output is correct
45 Correct 501 ms 6520 KB Output is correct
46 Correct 529 ms 7132 KB Output is correct
47 Correct 438 ms 7160 KB Output is correct
48 Correct 421 ms 7416 KB Output is correct
49 Correct 446 ms 6332 KB Output is correct
50 Correct 415 ms 7288 KB Output is correct
51 Correct 439 ms 7040 KB Output is correct
52 Correct 434 ms 7032 KB Output is correct