#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, q, mod = 1e9+7;
//long long w = 1;
cin >> n >> q;
vector<pair<int,int>>v(n);
for(int i = 0; i < n; ++i){
cin >> v[i].first >> v[i].second;
//w = max(w+v[i].first, w*v[i].second);
}
int l, r;
long long x;
while(q--){
cin >> x >> l >> r;
for(int i = l; i < r; ++i){
long long alfa = x+v[i].first;
long long beta = x*v[i].second;
x = max(alfa,beta);
}
cout << x%mod << "\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 | #include <bits/stdc++.h> using namespace std; #define ll long long int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, q, mod = 1e9+7; //long long w = 1; cin >> n >> q; vector<pair<int,int>>v(n); for(int i = 0; i < n; ++i){ cin >> v[i].first >> v[i].second; //w = max(w+v[i].first, w*v[i].second); } int l, r; long long x; while(q--){ cin >> x >> l >> r; for(int i = l; i < r; ++i){ long long alfa = x+v[i].first; long long beta = x*v[i].second; x = max(alfa,beta); } cout << x%mod << "\n"; } return 0; } |
English