提交时间:2025-02-07 15:43:31
运行 ID: 36095
#include<bits/stdc++.h> using namespace std; using ll = long long; ll n,qs,l,r,q,x,s,t,a[229028],ans; void out(){ for(int i=1;i<=n;i++)cout<<a[i]<<' '; cout<<'\n'; } int main(){ ios::sync_with_stdio(0),cin.tie(0),cout.tie(0); cin>>n>>qs>>l>>r; for(int i=1;i<=n;i++)cin>>a[i]; sort(a+1,a+n+1); while(qs--){ cin>>q>>x>>s>>t; if(q==1)for(int i=n;i>=1;i--) if(a[i]>=x)a[i]=t*(a[i]+s); else break; if(q==2)for(int i=1;i<=n;i++) if(a[i]<=x)a[i]=trunc((a[i]-s)/t); else break; } for(int i=1;i<=n;i++)ans+=l<=a[i]&&a[i]<=r; cout<<ans; return 0; }