oj.uz

Submission #31120

# Submission time Handle Problem Language Result Execution time Memory
31120 2017-08-10T04:04:48 Z trath Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 693 ms 23772 KB 
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long int
#define ieps 200010
#define eps (int) 1e9
#define pii pair<int,int>
struct node{
	ll leftmost, rightmost, sumup , sumdown;
	void clv(){
		leftmost = rightmost = sumup = sumdown = 0;
	}
};

int a , b , val;
int n , q ,   v[200100] ;
ll s , t;
ll lazy[560000];
node st[560000];
void propagate(int curr  , int l , int r){
	if(lazy[curr]){
		st[curr].leftmost += lazy[curr];
		st[curr].rightmost += lazy[curr];
		if(l != r){
		lazy[2*curr] += lazy[curr];
		lazy[2*curr + 1] += lazy[curr];
}	
		lazy[curr] = 0;
	}
	return;
}
node mixnode(node left, node right){
	node x;
	x.clv();
	ll toadd = 0 , tosubtract = 0;
	if(left.rightmost >= right.leftmost){
		toadd += t*(left.rightmost - right.leftmost);
	}
	else if(left.rightmost < right.leftmost){
		tosubtract += s*(right.leftmost - left.rightmost);
	}
	x.leftmost = left.leftmost;
	x.rightmost = right.rightmost;
	x.sumup = left.sumup + right.sumup + toadd;
	x.sumdown = left.sumdown + right.sumdown + tosubtract;
	return x;
}
void build(int l = 0 , int r = n- 1 , int curr = 1){
	if(l == r){
		st[curr].clv();
		st[curr].rightmost = st[curr].leftmost  = v[l];
		return;
	}
	build(l , (l+r)/2 , 2*curr);
	build((l+r)/2 + 1 , r, 2*curr + 1);
	st[curr] = mixnode(st[2*curr] , st[2*curr + 1]);
	return;
}
void update(int x , int y , int l = 0 , int r = n- 1 , int curr = 1){
	propagate(curr, l , r);
	if(l == x && r == y){
		lazy[curr]+=val;
		propagate(curr, l , r);
		return;
	}
	ll mid = (l+r)/2;
	if(y <= mid){
		update(x , y, l , mid , 2*curr);
	}
	else if(x > mid){
		update(x ,y, mid + 1 ,r , 2*curr + 1);

	}
	else{
		update(x , mid , l , mid , 2*curr);
		update(mid + 1 , y , mid + 1 , r , 2*curr + 1);
	}
	propagate(2*curr , l , mid);
	propagate(2*curr + 1 , mid + 1 , r);
	st[curr] = mixnode(st[2*curr] , st[2*curr + 1]);
	return;
}
int main(){
	scanf("%d %d %lld %lld", &n, &q, &s, &t);
	n = n+1;
	for(int i = 0;i<n;i++) scanf("%d", &(v[i]));;
	build();
	for(int i = 0;i<q;i++){
		scanf("%d%d%d", &a, &b, &val);
		update(a , b);
		ll p = st[1].sumup;
		p-=st[1].sumdown;
		printf("%lld\n",p);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:89:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %lld %lld", &n, &q, &s, &t);
                                          ^
foehn_phenomena.cpp:91:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0;i<n;i++) scanf("%d", &(v[i]));;
                                             ^
foehn_phenomena.cpp:94:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &a, &b, &val);
                                ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 539 ms 23772 KB Output is correct
2 Correct 579 ms 23772 KB Output is correct
3 Correct 693 ms 23772 KB Output is correct
4 Correct 569 ms 23772 KB Output is correct
5 Correct 459 ms 23772 KB Output is correct
6 Correct 223 ms 23772 KB Output is correct
7 Correct 216 ms 23772 KB Output is correct
8 Correct 399 ms 23772 KB Output is correct
9 Correct 439 ms 23772 KB Output is correct
10 Correct 493 ms 23772 KB Output is correct
11 Correct 229 ms 23772 KB Output is correct
12 Correct 229 ms 23772 KB Output is correct
13 Correct 223 ms 23772 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 23772 KB Output is correct
2 Correct 0 ms 23772 KB Output is correct
3 Correct 0 ms 23772 KB Output is correct
4 Correct 0 ms 23772 KB Output is correct
5 Correct 0 ms 23772 KB Output is correct
6 Correct 0 ms 23772 KB Output is correct
7 Correct 3 ms 23772 KB Output is correct
8 Correct 0 ms 23772 KB Output is correct
9 Correct 0 ms 23772 KB Output is correct
10 Correct 0 ms 23772 KB Output is correct
11 Correct 0 ms 23772 KB Output is correct
12 Correct 0 ms 23772 KB Output is correct
13 Correct 0 ms 23772 KB Output is correct
14 Correct 0 ms 23772 KB Output is correct
15 Correct 0 ms 23772 KB Output is correct
16 Correct 0 ms 23772 KB Output is correct
17 Correct 0 ms 23772 KB Output is correct
18 Correct 0 ms 23772 KB Output is correct
19 Correct 0 ms 23772 KB Output is correct
20 Correct 0 ms 23772 KB Output is correct
21 Correct 0 ms 23772 KB Output is correct
22 Correct 539 ms 23772 KB Output is correct
23 Correct 579 ms 23772 KB Output is correct
24 Correct 693 ms 23772 KB Output is correct
25 Correct 569 ms 23772 KB Output is correct
26 Correct 459 ms 23772 KB Output is correct
27 Correct 223 ms 23772 KB Output is correct
28 Correct 216 ms 23772 KB Output is correct
29 Correct 399 ms 23772 KB Output is correct
30 Correct 439 ms 23772 KB Output is correct
31 Correct 493 ms 23772 KB Output is correct
32 Correct 229 ms 23772 KB Output is correct
33 Correct 229 ms 23772 KB Output is correct
34 Correct 223 ms 23772 KB Output is correct
35 Correct 453 ms 23772 KB Output is correct
36 Correct 623 ms 23772 KB Output is correct
37 Correct 519 ms 23772 KB Output is correct
38 Correct 616 ms 23772 KB Output is correct
39 Correct 509 ms 23772 KB Output is correct
40 Correct 516 ms 23772 KB Output is correct
41 Correct 463 ms 23772 KB Output is correct
42 Correct 489 ms 23772 KB Output is correct
43 Correct 563 ms 23772 KB Output is correct
44 Correct 483 ms 23772 KB Output is correct
45 Correct 659 ms 23772 KB Output is correct
46 Correct 526 ms 23772 KB Output is correct
47 Correct 309 ms 23772 KB Output is correct
48 Correct 216 ms 23772 KB Output is correct
49 Correct 556 ms 23772 KB Output is correct
50 Correct 296 ms 23772 KB Output is correct
51 Correct 213 ms 23772 KB Output is correct
52 Correct 359 ms 23772 KB Output is correct