제출 #1198563

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198563		lioow	Foehn Phenomena (JOI17_foehn_phenomena)	C++20	100 / 100	213 ms	7348 KiB

foehn_phenomena

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define ca cout<<"Alice"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p2
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define lb long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
using namespace std;
//int dx[4]={-1,1,0,0};
//int dy[4]={0,0,1,-1};
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int mod=1e9+7,maxn=2e5+5,N=1000000,INF=1e18;
const int MOD=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dir[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={0,0,1,1};
int dy[4]={0,1,0,1};

int BIT[maxn];
int n,q,s,t;
int qry(int id){
    int sum = 0; for(;id>=1;id-=id&-id) sum += BIT[id]; return sum;
}
void upd(int id, int v) {
    for(;id<=2e5;id+=id&-id) BIT[id]+=v;
}
int qry_range_sum(int l, int r){
    return qry(r)- qry(l-1);
}
void upd_range(int l, int r, int v) {
    upd(l,v);
    upd(r+1,-v);
}

int con(int i){
	if(i==n) return 0;
	int a=qry(i),b=qry(i+1);
	if(a<b) return (a-b)*s;
	else return (a-b)*t;
}

void solve(){
	cin>>n>>q>>s>>t;
	int ans=0;
	int a[n+2];
	repp(i,0,n){
		cin>>a[i];
		if(i>0) upd_range(i,i,a[i]);
	}
	repp(i,0,n-1){
		ans+=con(i);
	}
	repp(i,1,q){
		int l,r,v;cin>>l>>r>>v;
		ans-=con(l-1)+con(r);
		upd_range(l,r,v);
		ans+=con(l-1)+con(r);
		cout<<ans<<endl;
	}
}

signed main(){
  liow;
  int tc=1;
//  cin>>tc;
  while(tc--){
  	solve();
  }
}

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60