# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202589 | pr3pony | Boat (APIO16_boat) | C++14 | 438 ms | 4472 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 = 505, MOD = 1e9 + 7;
typedef long long ll;
vector<int> val;
typedef array<int, 2> ar;
ar p[N];
ll dp[2 * N][N], inv[N];
int main()
{
int n;
cin >> n;
val = {-1};
for (int i = 1; i <= n; ++i) {
cin >> p[i][0] >> p[i][1];
++p[i][1];
val.push_back(p[i][0]);
val.push_back(p[i][1]);
}
sort(val.begin(), val.end());
val.resize(unique(val.begin(), val.end()) - val.begin());
int w = val.size();
inv[1] = 1;
for (int i = 2; i <= n; ++i)
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
for (int i = 0; i < w; ++i)
dp[i][0] = 1;
for (int b = 1; b <= n; ++b) {
# | 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... |