# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21834 | mohammad_kilani | Boat (APIO16_boat) | C++14 | 2000 ms | 524288 KiB |
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;
#define Mod 1000000007
int n;
int l[1000];
int r[1001];
vector<vector<int> > sum;
int main() {
scanf("%d",&n);
int ans = 0 ;
sum.resize(n+1);
for(int i=0;i<n;i++){
scanf("%d%d",&l[i],&r[i]);
for(int k=l[i];k<=r[i];k++){
int cur = 1;
for(int j=0;j<i;j++){
if(k <= l[j])
continue;
int num = min(r[j]+1,k) - l[j] - 1;
cur+=sum[j][num];
if(cur >= Mod)
cur-=Mod;
}
sum[i].push_back(cur);
if(k != l[i])
sum[i][k-l[i]]+=sum[i][k-l[i]-1];
ans+=cur;
if(ans >= Mod)
ans-=Mod;
}
}
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | 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... |