# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23038 | ngkan146 | Boat (APIO16_boat) | C++98 | 3 ms | 2420 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>
#define ll long long
using namespace std;
const ll mod = (ll) 1e9+7;
ll n, a[505], b[505];
vector <ll> mjk;
ll dp[50005];
ll len(ll l1,ll r1,ll l2,ll r2){
return max(0ll, min(r1,r2) - max(l1,l2) + 1);
}
int main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%lld %lld",&a[i],&b[i]),
mjk.push_back(a[i]),
mjk.push_back(b[i]);
mjk.push_back(0ll);
mjk.push_back((ll)1e9+1);
sort(mjk.begin(),mjk.end());
mjk.resize(unique(mjk.begin(),mjk.end()) - mjk.begin());
dp[0] = 1;
for(int i=1;i<=n;i++){
ll cnt = 0;
for(int j=0;j<mjk.size()-1;j++){
ll tmp = (cnt + dp[j]) % mod;
dp[j] = (dp[j] + len(mjk[j], mjk[j+1]-1, a[i], b[i]) * cnt) % mod;
cnt = tmp;
}
}
ll ans = 0;
for(int i=1;i<mjk.size()-1;i++)
ans = (ans + dp[i]) % mod;
cout << ans;
}
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... |