# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967733 | 2024-04-22T17:32:32 Z | duckindog | Boat (APIO16_boat) | C++17 | 463 ms | 524288 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 463 ms | 524288 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |