# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46602 | Talant | Boat (APIO16_boat) | C++17 | 2086 ms | 544 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 mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
using namespace std;
const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;
int n;
long long ans;
long long a[N],b[N];
main () {
cin >> n;
for (int i = 1; i <= n; i ++) {
cin >> a[i] >> b[i];
}
for (int i = n; i >= 1; i --) {
ans = (ans + (b[i] - a[i] + 1)) % inf;
if (i == n)
continue;
for (int j = a[i]; j <= b[i]; j ++) {
for (int l = i + 1; l <= n; l ++) {
ans = (ans + max(b[l] - max(j*1ll + 1,a[l]) + 1,0ll)) % inf;
}
}
}
cout << ans << endl;
}
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... |