oj.uz

Submission #252704

# Submission time Handle Problem Language Result Execution time Memory
252704 2020-07-26T07:03:50 Z ChrisT Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 233 ms 13180 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MN = 2e5 + 5;
ll bit[MN], a[MN];
void update (int i, ll v) {
	for (;i<MN;i+=i&-i)
		bit[i] += v;
}
ll query (int i) {
	ll ret = 0;
	for (;i;i^=i&-i)
		ret += bit[i];
	return ret;
}
int main () { 
	int n,q,s,t; ll sum = 0;
	scanf ("%d %d %d %d",&n,&q,&s,&t);
	for (int i = 0; i <= n; i++) {
		scanf ("%lld",&a[i]);  if (!i) continue;
		update(i,a[i]); update(i+1,-a[i]);
		if (a[i] <= a[i-1]) sum += (ll)t * (a[i-1] - a[i]);
		else sum -= (ll)s * (a[i]-a[i-1]);
	}
	while (q--) {
		int l,r,x;
		scanf ("%d %d %d",&l,&r,&x);
		if (l > 0) {
			a[l] = query(l); a[l-1] = query(l-1);
			if (a[l] <= a[l-1]) sum -= (ll)t * (a[l-1] - a[l]);
			else sum += (ll)s * (a[l]-a[l-1]);
		}
		if (r < n) {
			a[r+1] = query(r+1); a[r] = query(r);
			if (a[r+1] <= a[r]) sum -= (ll)t * (a[r] - a[r+1]);
			else sum += (ll)s * (a[r+1]-a[r]);
		}
		update(l,x); update(r+1,-x);
		if (l > 0) {
			a[l] = query(l); a[l-1] = query(l-1);
			if (a[l] <= a[l-1]) sum += (ll)t * (a[l-1] - a[l]);
			else sum -= (ll)s * (a[l]-a[l-1]);
		}
		if (r < n) {
			a[r+1] = query(r+1); a[r] = query(r);
			if (a[r+1] <= a[r]) sum += (ll)t * (a[r] - a[r+1]);
			else sum -= (ll)s * (a[r+1]-a[r]);
		}
		printf ("%lld\n",sum);
	}
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d %d %d %d",&n,&q,&s,&t);
  ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:20:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%lld",&a[i]);  if (!i) continue;
   ~~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:27: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 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 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 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 4856 KB Output is correct
2 Correct 216 ms 5496 KB Output is correct
3 Correct 229 ms 6136 KB Output is correct
4 Correct 215 ms 5368 KB Output is correct
5 Correct 199 ms 6008 KB Output is correct
6 Correct 155 ms 6520 KB Output is correct
7 Correct 152 ms 6392 KB Output is correct
8 Correct 199 ms 6392 KB Output is correct
9 Correct 194 ms 6752 KB Output is correct
10 Correct 191 ms 5496 KB Output is correct
11 Correct 150 ms 6520 KB Output is correct
12 Correct 145 ms 6776 KB Output is correct
13 Correct 142 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 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 1 ms 384 KB Output is correct
22 Correct 203 ms 4856 KB Output is correct
23 Correct 216 ms 5496 KB Output is correct
24 Correct 229 ms 6136 KB Output is correct
25 Correct 215 ms 5368 KB Output is correct
26 Correct 199 ms 6008 KB Output is correct
27 Correct 155 ms 6520 KB Output is correct
28 Correct 152 ms 6392 KB Output is correct
29 Correct 199 ms 6392 KB Output is correct
30 Correct 194 ms 6752 KB Output is correct
31 Correct 191 ms 5496 KB Output is correct
32 Correct 150 ms 6520 KB Output is correct
33 Correct 145 ms 6776 KB Output is correct
34 Correct 142 ms 11896 KB Output is correct
35 Correct 199 ms 10488 KB Output is correct
36 Correct 213 ms 11832 KB Output is correct
37 Correct 206 ms 12664 KB Output is correct
38 Correct 222 ms 12536 KB Output is correct
39 Correct 208 ms 12536 KB Output is correct
40 Correct 223 ms 12536 KB Output is correct
41 Correct 216 ms 12300 KB Output is correct
42 Correct 233 ms 12540 KB Output is correct
43 Correct 208 ms 11768 KB Output is correct
44 Correct 210 ms 12152 KB Output is correct
45 Correct 194 ms 12152 KB Output is correct
46 Correct 192 ms 13180 KB Output is correct
47 Correct 155 ms 11768 KB Output is correct
48 Correct 164 ms 11768 KB Output is correct
49 Correct 197 ms 10744 KB Output is correct
50 Correct 140 ms 11512 KB Output is correct
51 Correct 153 ms 11896 KB Output is correct
52 Correct 160 ms 11804 KB Output is correct