# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636838 | drkarlicio2107 | Boat (APIO16_boat) | C++14 | 2068 ms | 16252 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; long long int mod=1e9+7;
pair <long long int, long long int> l [1000];
long long int dp [2][1000010];
vector < pair < pair< int, int> , pair <int, int> > > s;
int dulj [1000010];
int main(){
long long int n; cin >> n;
for (int i=0; i<n; i++){
long long int a,b; cin >> a >> b;
l [i].first=a; l[i].second=b; s.push_back ({{a, b}, {i, 0}}); dulj [i]=b-a+1;
}
s.push_back ({{0, 0}, {0, 0}});
sort (s.begin(), s.end());
for (int i=1; i<s.size(); i++){
if (l [s[i].second.first].first>l [s[i-1].second.first].second){
l [s[i].second.first].first=l [s[i-1].second.first].second+1;
l [s[i].second.first].second=dulj [s[i].second.first]+l [s[i].second.first].first;
}
}
dp [0][0]=1;
for (int j=1; j<1000010; j++) dp [0][j]+=dp [0][j-1];
for (int i=0; i<n; i++){
for (int j=l [i].first; j<=l [i].second; j++){
dp [1][j]=(dp [1][j]+dp [0][j-1])%mod;
//cout << dp [1][j] << endl;
}
dp [1][0]=(dp [1][0]+dp [0][1000009])%mod;
for (int j=1; j<1000010; j++){
//cout << dp [1][j] << " ";
dp[1][j]=(dp [1][j]+dp [1][j-1])%mod;
//cout << dp [1][j] << endl;
}
//cout << endl;
swap (dp [0], dp [1]);
for (int j=0; j<1000010; j++) dp [1][j]=0;
}
cout << (dp [0][1000009]-1)%mod << endl;
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... |