oj.uz

Submission #68208

# Submission time Handle Problem Language Result Execution time Memory
68208 2018-08-16T08:23:37 Z BThero Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 573 ms 165724 KB 
// Why I am so dumb? :c
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;

typedef long long ll;

const int MAXN = (int)2e5 + 5;

ll t[MAXN << 2];

int n, q, a, b;

int arr[MAXN];

ll ans;

void segUpd(int v, int tl, int tr, int l, int r, int x) {
	if (l > r || tl > r || tr < l) {
		return;
	}

	if (l <= tl && tr <= r) {
		t[v] += x;
		return;
	}

	int mid = (tl + tr) >> 1;
	int c1 = (v << 1), c2 = (c1 | 1);

	segUpd(c1, tl, mid, l, r, x);
	segUpd(c2, mid + 1, tr, l, r, x);	                            	
}

ll getVal(int v, int tl, int tr, int ps) {
	if (tl == tr) {
		return t[v] + arr[tl];
	}

	int mid = (tl + tr) >> 1;
	int c1 = (v << 1), c2 = (c1 | 1);

	if (ps <= mid) {
		return t[v] + getVal(c1, tl, mid, ps);
	}
	else {
		return t[v] + getVal(c2, mid + 1, tr, ps);
	}
}

ll calc(int ps) {
	if (ps < 0 || ps == n) {
		return 0ll;
	}

	ll v1 = getVal(1, 0, n, ps);
	ll v2 = getVal(1, 0, n, ps + 1);

	if (v1 < v2) {
		return a * (v1 - v2);
	}
	else {
		return b * (v1 - v2);
	}
}

void solve() {                   
	scanf("%d %d %d %d", &n, &q, &a, &b);

 	for (int i = 0; i <= n; ++i) {
		scanf("%d", &arr[i]); 	
 	}	

 	for (int i = 0; i < n; ++i) {
 		ans += calc(i);
 	}

 	for (int i = 1; i <= q; ++i) {
 		int l, r, x;
 		scanf("%d %d %d", &l, &r, &x); 	
 		ans -= calc(l - 1);
 		ans -= calc(r);

 		segUpd(1, 0, n, l, r, x);
                               
 		ans += calc(l - 1);
 		ans += calc(r);

 		printf("%lld\n", ans);                       
 	} 
}

int main() {    
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void solve()':
foehn_phenomena.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d", &n, &q, &a, &b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &arr[i]);  
   ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:88:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d %d", &l, &r, &x);  
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 515 ms 11548 KB Output is correct
2 Correct 523 ms 17496 KB Output is correct
3 Correct 535 ms 23600 KB Output is correct
4 Correct 573 ms 28356 KB Output is correct
5 Correct 481 ms 35232 KB Output is correct
6 Correct 215 ms 36196 KB Output is correct
7 Correct 226 ms 40908 KB Output is correct
8 Correct 490 ms 50472 KB Output is correct
9 Correct 434 ms 56364 KB Output is correct
10 Correct 500 ms 60656 KB Output is correct
11 Correct 288 ms 62000 KB Output is correct
12 Correct 277 ms 67136 KB Output is correct
13 Correct 214 ms 72404 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 484 KB Output is correct
3 Correct 7 ms 484 KB Output is correct
4 Correct 5 ms 564 KB Output is correct
5 Correct 7 ms 624 KB Output is correct
6 Correct 7 ms 684 KB Output is correct
7 Correct 7 ms 684 KB Output is correct
8 Correct 6 ms 684 KB Output is correct
9 Correct 6 ms 684 KB Output is correct
10 Correct 6 ms 684 KB Output is correct
11 Correct 6 ms 684 KB Output is correct
12 Correct 6 ms 684 KB Output is correct
13 Correct 6 ms 684 KB Output is correct
14 Correct 6 ms 684 KB Output is correct
15 Correct 6 ms 684 KB Output is correct
16 Correct 7 ms 684 KB Output is correct
17 Correct 5 ms 684 KB Output is correct
18 Correct 4 ms 688 KB Output is correct
19 Correct 2 ms 688 KB Output is correct
20 Correct 3 ms 688 KB Output is correct
21 Correct 2 ms 688 KB Output is correct
22 Correct 515 ms 11548 KB Output is correct
23 Correct 523 ms 17496 KB Output is correct
24 Correct 535 ms 23600 KB Output is correct
25 Correct 573 ms 28356 KB Output is correct
26 Correct 481 ms 35232 KB Output is correct
27 Correct 215 ms 36196 KB Output is correct
28 Correct 226 ms 40908 KB Output is correct
29 Correct 490 ms 50472 KB Output is correct
30 Correct 434 ms 56364 KB Output is correct
31 Correct 500 ms 60656 KB Output is correct
32 Correct 288 ms 62000 KB Output is correct
33 Correct 277 ms 67136 KB Output is correct
34 Correct 214 ms 72404 KB Output is correct
35 Correct 450 ms 79756 KB Output is correct
36 Correct 531 ms 86572 KB Output is correct
37 Correct 471 ms 92788 KB Output is correct
38 Correct 472 ms 97940 KB Output is correct
39 Correct 491 ms 103392 KB Output is correct
40 Correct 485 ms 108760 KB Output is correct
41 Correct 486 ms 113928 KB Output is correct
42 Correct 471 ms 119468 KB Output is correct
43 Correct 485 ms 124428 KB Output is correct
44 Correct 493 ms 130076 KB Output is correct
45 Correct 460 ms 135476 KB Output is correct
46 Correct 505 ms 142160 KB Output is correct
47 Correct 228 ms 142836 KB Output is correct
48 Correct 256 ms 147360 KB Output is correct
49 Correct 536 ms 154964 KB Output is correct
50 Correct 292 ms 156064 KB Output is correct
51 Correct 242 ms 161004 KB Output is correct
52 Correct 344 ms 165724 KB Output is correct