# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111409 | ecasdqina | Boat (APIO16_boat) | C++14 | 6 ms | 4480 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::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
int main() {
int n; scanf("%d", &n); std::vector<int> a(n), b(n);
for(int i = 0; i < n; i++) scanf("%d%d", &a[i], &b[i]);
const int MOD = 1e9 + 7;
auto dp = make_v<i64>(n + 1, n + 1); dp[0][0] = 1;
for(int i = 0; i < n; i++) {
assert(a[i] == b[i]);
for(int j = 0; j < i + 1; j++) dp[i + 1][j] = dp[i][j];
for(int j = 0; j < i + 1; j++) {
if(j and a[j - 1] >= a[i]) continue;
dp[i + 1][i + 1] += dp[i][j];
dp[i + 1][i + 1] %= MOD;
}
}
i64 ans = 0;
for(int i = 1; i < dp[n].size(); i++) (ans += dp[n][i]) %= MOD;
printf("%lld\n", ans);
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... |