#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<long long,long long>
using namespace std;
using ll = long long;
using ld = long double;
constexpr int SIZE = 5e5+5;
constexpr int MOD = 1e9+7;
pii tab[SIZE];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q;
for (int i=1; i<=n; i++) cin >> tab[i].F >> tab[i].S;
ll x, l, r;
for (int t=0; t<q; t++){
cin >> x >> l >> r;
l ++;
bool dmod = 0;
for (int i=l; i<=r; i++){
if (tab[i].S == 1) x += tab[i].F;
else if (dmod) x *= tab[i].S;
else x = max(x+tab[i].F, x*tab[i].S);
if (x >= MOD) dmod = 1;
x %= MOD;
}
cout << x << '\n';
}
return 0;}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 | #include <bits/stdc++.h> #define F first #define S second #define pii pair<long long,long long> using namespace std; using ll = long long; using ld = long double; constexpr int SIZE = 5e5+5; constexpr int MOD = 1e9+7; pii tab[SIZE]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; for (int i=1; i<=n; i++) cin >> tab[i].F >> tab[i].S; ll x, l, r; for (int t=0; t<q; t++){ cin >> x >> l >> r; l ++; bool dmod = 0; for (int i=l; i<=r; i++){ if (tab[i].S == 1) x += tab[i].F; else if (dmod) x *= tab[i].S; else x = max(x+tab[i].F, x*tab[i].S); if (x >= MOD) dmod = 1; x %= MOD; } cout << x << '\n'; } return 0;} |
English