# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967733 | duckindog | Boat (APIO16_boat) | C++17 | 463 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;
const int N = 500 + 10,
M = 1'000'000'000 + 7;
int n;
int a[N], b[N];
int f[2][1'000'000 + 10];
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i] >> b[i];
vector<int> rrh;
for (int i = 1; i <= n; ++i) {
for (int j = a[i]; j <= b[i]; ++j) rrh.push_back(j);
}
sort(rrh.begin(), rrh.end());
rrh.resize(unique(rrh.begin(), rrh.end()) - rrh.begin());
f[0][0] = 1;
for (int i = 1; i <= n; ++i) {
int id = i & 1, p = id ^ 1;
for (int j = 0; j <= rrh.size(); ++j) f[id][j] = 0;
int it = lower_bound(rrh.begin(), rrh.end(), a[i]) - rrh.begin() + 1;
for (int j = 0; j <= rrh.size(); ++j) f[id][j] = f[p][j];
for (int j = it; j <= b[i] - a[i] + it; ++j) {
for (int t = 0; t < j; ++t) f[id][j] += f[p][t];
}
}
int answer = 0;
for (int i = 1; i <= rrh.size(); ++i) answer += f[n & 1][i];
cout << answer << "\n";
}
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... |