oj.uz

Submission #340316

# Submission time Handle Problem Language Result Execution time Memory
340316 2020-12-27T12:23:51 Z Kerim Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 415 ms 15084 KB 
#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
ll s[MAXN<<2],ans;
int arr[MAXN],n,q,sa,t;
void inc(int l,int r,int v,int nd=1,int x=1,int y=n){
	if(l>y or x>r)return;
	if(l<=x and y<=r){s[nd]+=v;return;}
	int mid=(x+y)>>1;
	inc(l,r,v,nd<<1,x,mid);inc(l,r,v,nd<<1|1,mid+1,y);
}
ll get(int p,int nd=1,int x=1,int y=n){
	if(!p)return 0LL;
	if(x==y)return s[nd]+arr[x];
	int mid=(x+y)>>1;	
	if(p<=mid)return s[nd]+get(p,nd<<1,x,mid);
	return s[nd]+get(p,nd<<1|1,mid+1,y);
}
ll cost(int p){
	ll a=get(p),b=get(p+1);
	if(a<b)
		return sa*(a-b);
	return t*(a-b);
}
int main(){
    //freopen("dreaming.in", "r", stdin);
    scanf("%d%d%d%d",&n,&q,&sa,&t);
    for(int i=0;i<=n;i++)scanf("%d",arr+i);
	for(int i=0;i<n;i++)ans+=cost(i);
    while(q--){
    	int l,r,x;
		scanf("%d%d%d",&l,&r,&x);
		ans-=cost(l-1);if(r<n)ans-=cost(r);
		inc(l,r,x);	
		ans+=cost(l-1);if(r<n)ans+=cost(r);
		printf("%lld\n",ans);
    }
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   43 |     scanf("%d%d%d%d",&n,&q,&sa,&t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:44:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |     for(int i=0;i<=n;i++)scanf("%d",arr+i);
      |                          ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   scanf("%d%d%d",&l,&r,&x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 12100 KB Output is correct
2 Correct 415 ms 12780 KB Output is correct
3 Correct 410 ms 13420 KB Output is correct
4 Correct 403 ms 12780 KB Output is correct
5 Correct 410 ms 13804 KB Output is correct
6 Correct 149 ms 8812 KB Output is correct
7 Correct 151 ms 8812 KB Output is correct
8 Correct 349 ms 13804 KB Output is correct
9 Correct 351 ms 14016 KB Output is correct
10 Correct 341 ms 12652 KB Output is correct
11 Correct 209 ms 8736 KB Output is correct
12 Correct 150 ms 9324 KB Output is correct
13 Correct 195 ms 9580 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 408 ms 12100 KB Output is correct
23 Correct 415 ms 12780 KB Output is correct
24 Correct 410 ms 13420 KB Output is correct
25 Correct 403 ms 12780 KB Output is correct
26 Correct 410 ms 13804 KB Output is correct
27 Correct 149 ms 8812 KB Output is correct
28 Correct 151 ms 8812 KB Output is correct
29 Correct 349 ms 13804 KB Output is correct
30 Correct 351 ms 14016 KB Output is correct
31 Correct 341 ms 12652 KB Output is correct
32 Correct 209 ms 8736 KB Output is correct
33 Correct 150 ms 9324 KB Output is correct
34 Correct 195 ms 9580 KB Output is correct
35 Correct 404 ms 12268 KB Output is correct
36 Correct 413 ms 13684 KB Output is correct
37 Correct 410 ms 14444 KB Output is correct
38 Correct 408 ms 14232 KB Output is correct
39 Correct 407 ms 14316 KB Output is correct
40 Correct 411 ms 14188 KB Output is correct
41 Correct 415 ms 14060 KB Output is correct
42 Correct 409 ms 14316 KB Output is correct
43 Correct 411 ms 13420 KB Output is correct
44 Correct 408 ms 13804 KB Output is correct
45 Correct 406 ms 13932 KB Output is correct
46 Correct 415 ms 15084 KB Output is correct
47 Correct 151 ms 9324 KB Output is correct
48 Correct 196 ms 9452 KB Output is correct
49 Correct 397 ms 12652 KB Output is correct
50 Correct 208 ms 9216 KB Output is correct
51 Correct 150 ms 9580 KB Output is correct
52 Correct 247 ms 9452 KB Output is correct