提交时间:2025-02-07 16:18:30
运行 ID: 36123
#include<bits/stdc++.h> using namespace std; const int N=2e5+10; #define ll long long ll n,Q,L,R,q,x,s,t; ll a[N]; int main(){ ios::sync_with_stdio(0); cin>>n>>Q>>L>>R; for (int i = 1; i <= n; i++) { cin>>a[i]; } while (Q--) { cin>>q>>x>>s>>t; if(q==1){ for (int i = 1; i <= n; i++) { if(a[i]>=x) a[i]=t*(a[i]+s); } }else{ for (int i = 1; i <= n; i++) { if(a[i]<=x){ double tmp=(a[i]-s)/t; if(tmp>0) a[i]=floor(tmp); else a[i]=ceil(tmp); } } } } int ans=0; for (int i = 1; i <= n; i++) { if(a[i]>=L && a[i]<=R) ans++; } cout<<ans; return 0; }