oj.uz

Submission #875604

# Submission time Handle Problem Language Result Execution time Memory
875604 2023-11-20T07:02:53 Z ReLice Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 376 ms 24660 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define endl "\n"
#define fr first
#define sc second
#define sz size()
#define ins insert
#define bc back()
#define str string
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18+7;
const ll mod=1e9;
const ll N=2e5+7;
const ld eps=1e-9;

vector<ll> t(N*4);
ll add[N*4],a[N],vv[N];
void build(ll v,ll tl,ll tr){
	if(tl==tr){
		t[v]=vv[tl];
		return;
	}
	ll tm=(tl+tr)/2;
	build(v*2,tl,tm);
	build(v*2+1,tm+1,tr);
}
void push(ll v,ll tl,ll tr){
	if(tl!=tr){
		add[v*2]+=add[v];
		add[v*2+1]+=add[v];
	}
	else t[v]+=add[v];
	add[v]=0;
}
void upd(ll v,ll tl,ll tr,ll l,ll r,ll val){
	push(v,tl,tr);
	if(tl>r || tr<l) return;
	if(l<=tl && tr<=r){
		add[v]+=val;
		push(v,tl,tr);
		return;
	}
	ll tm=(tl+tr)/2;
	upd(v*2,tl,tm,l,r,val);
	upd(v*2+1,tm+1,tr,l,r,val);
}
ll get(ll v,ll tl,ll tr,ll pos){
	push(v,tl,tr);
	if(tl>pos || tr<pos)return -inf;
	if(tl==tr){
		return t[v];
	}
	ll tm=(tl+tr)/2;
	return max(get(v*2,tl,tm,pos),get(v*2+1,tm+1,tr,pos));
}
void solve(){
    ll i,j;
    ll n,q,x,y;
    cin>>n>>q>>x>>y;
    for(i=1;i<=n+1;i++){
		cin>>vv[i];
		if(i>1){
			a[i]=a[i-1]+(vv[i-1]-vv[i]<0 ? (vv[i-1]-vv[i])*x : (vv[i-1]-vv[i])*y);
		}
	}
	build(1,1,n+1);
	ll sum=a[n+1];
	ll l,r,b;
	n++;
	for(i=0;i<q;i++){
		cin>>l>>r>>b;
		if(r+1==n){
			ll l1=get(1,1,n,l),l2=get(1,1,n,l+1);
			ll prev=l1-l2,cur=l1-(l2+b);
			sum-=(prev<0 ? prev*x : prev*y);
			sum+=(cur<0 ? cur*x : cur*y);
			upd(1,1,n,l+1,r+1,b);
		}else{
			ll l1=get(1,1,n,l),l2=get(1,1,n,l+1),r1=get(1,1,n,r+1),r2=get(1,1,n,r+2);
			ll prev=l1-l2,cur=l1-(l2+b);
			sum-=(prev<0 ? prev*x : prev*y);
			sum+=(cur<0 ? cur*x : cur*y);
			prev=r1-r2,cur=(r1+b)-r2;
			sum-=(prev<0 ? prev*x : prev*y);
			sum+=(cur<0 ? cur*x : cur*y);
			upd(1,1,n,l+1,r+1,b);
		}
		cout<<sum<<endl;
	}
		
		
}

signed main(){
    start();
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    ll t=1;
    //cin>>t;
    while(t--) solve();
}
/*









*/

Compilation message

foehn_phenomena.cpp: In function 'void solve()':
foehn_phenomena.cpp:71:10: warning: unused variable 'j' [-Wunused-variable]
   71 |     ll i,j;
      |          ^
foehn_phenomena.cpp: In function 'void fre(std::string)':
foehn_phenomena.cpp:19:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:19:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 19564 KB Output is correct
2 Correct 316 ms 20108 KB Output is correct
3 Correct 313 ms 20616 KB Output is correct
4 Correct 321 ms 19940 KB Output is correct
5 Correct 307 ms 20820 KB Output is correct
6 Correct 155 ms 18516 KB Output is correct
7 Correct 155 ms 18304 KB Output is correct
8 Correct 267 ms 20972 KB Output is correct
9 Correct 258 ms 21604 KB Output is correct
10 Correct 250 ms 20052 KB Output is correct
11 Correct 227 ms 18560 KB Output is correct
12 Correct 176 ms 18768 KB Output is correct
13 Correct 153 ms 19316 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 4 ms 6748 KB Output is correct
4 Correct 4 ms 6720 KB Output is correct
5 Correct 4 ms 6748 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 5 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6748 KB Output is correct
10 Correct 4 ms 6864 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 3 ms 6752 KB Output is correct
15 Correct 4 ms 6748 KB Output is correct
16 Correct 4 ms 6744 KB Output is correct
17 Correct 3 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 2 ms 6748 KB Output is correct
20 Correct 2 ms 6748 KB Output is correct
21 Correct 2 ms 6748 KB Output is correct
22 Correct 307 ms 19564 KB Output is correct
23 Correct 316 ms 20108 KB Output is correct
24 Correct 313 ms 20616 KB Output is correct
25 Correct 321 ms 19940 KB Output is correct
26 Correct 307 ms 20820 KB Output is correct
27 Correct 155 ms 18516 KB Output is correct
28 Correct 155 ms 18304 KB Output is correct
29 Correct 267 ms 20972 KB Output is correct
30 Correct 258 ms 21604 KB Output is correct
31 Correct 250 ms 20052 KB Output is correct
32 Correct 227 ms 18560 KB Output is correct
33 Correct 176 ms 18768 KB Output is correct
34 Correct 153 ms 19316 KB Output is correct
35 Correct 322 ms 22056 KB Output is correct
36 Correct 321 ms 23552 KB Output is correct
37 Correct 367 ms 24240 KB Output is correct
38 Correct 332 ms 24196 KB Output is correct
39 Correct 323 ms 24076 KB Output is correct
40 Correct 351 ms 24076 KB Output is correct
41 Correct 376 ms 23896 KB Output is correct
42 Correct 306 ms 23976 KB Output is correct
43 Correct 315 ms 23124 KB Output is correct
44 Correct 307 ms 23548 KB Output is correct
45 Correct 329 ms 23572 KB Output is correct
46 Correct 317 ms 24660 KB Output is correct
47 Correct 160 ms 21136 KB Output is correct
48 Correct 211 ms 21328 KB Output is correct
49 Correct 313 ms 22256 KB Output is correct
50 Correct 227 ms 21056 KB Output is correct
51 Correct 169 ms 21384 KB Output is correct
52 Correct 240 ms 23216 KB Output is correct