This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3e5 + 20, MOD = (int)1e9+7;
int dp[N],n;
ll a[N];
void test(){
cin >> n;
a[0] = 1;
for(int i = 1;i <= n;i++){
int l,r;
cin >> l >> r;
ll s =0;
for(int j = 0;j < N;j++){
s += a[j];
s %= MOD;
if(j >= l && j <= r){
a[j] = s;
}
}
if(i == n){
s = 0;
for(int j = 0;j < N;j++){
s += a[j];
s %= MOD;
}
cout << (s-1+MOD)%MOD;
return;
}
}
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
int t = 1;
// cin >> t;
while(t--){
test();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |