#include <bits/stdc++.h>
#define N 524288
#define M 1000000007
#define ll long long
#define x first
#define y second
using namespace std;
ll add(ll a, ll b) {
return (a + b) % M;
}
ll mul(ll a, ll b) {
return (a * b) % M;
}
int n, q, x, l, r;
ll w;
ll a[N];
ll b[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < q; i++) {
cin >> x >> l >> r;
l--;
r--;
w = x;
for (int j = l + 1; j <= r; j++) {
if (w + a[j] > w * b[j]) {
w = add(w, a[j]);
} else {
w = mul(w, b[j]);
}
}
cout << w << "\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 46 47 48 49 50 51 | #include <bits/stdc++.h> #define N 524288 #define M 1000000007 #define ll long long #define x first #define y second using namespace std; ll add(ll a, ll b) { return (a + b) % M; } ll mul(ll a, ll b) { return (a * b) % M; } int n, q, x, l, r; ll w; ll a[N]; ll b[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> q; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (int i = 0; i < q; i++) { cin >> x >> l >> r; l--; r--; w = x; for (int j = l + 1; j <= r; j++) { if (w + a[j] > w * b[j]) { w = add(w, a[j]); } else { w = mul(w, b[j]); } } cout << w << "\n"; } return 0; } |
English