# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342007 | thecodingwizard | Boat (APIO16_boat) | C++11 | 9 ms | 4332 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;
using ll = long long;
#define ii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010
const int mod = 1e9+7;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
ii A[n];
map<int, int> compress;
set<int> setValues; setValues.insert(0); setValues.insert(1);
F0R(i, n) {
cin >> A[i].f >> A[i].s;
A[i].s++;
setValues.insert(A[i].f);
setValues.insert(A[i].s);
}
int idx = 0;
vector<int> values;
for (auto x : setValues) {
compress[x] = idx;
values.pb(x);
idx++;
}
F0R(i, n) {
A[i].f = compress[A[i].f];
A[i].s = compress[A[i].s];
}
int dp[n][values.size()];
int dpSum[n][values.size()];
F0R(i, n) {
F0R(j, values.size()-1) {
if (i == 0 && j == 0) { dp[i][j] = 1; continue; }
if (A[i].f <= j && A[i].s > j) {
// range is within [a...b]
ll numValues = values[j+1]-values[j];
dp[i][j] = ((ll)(i==0?0:dp[i-1][j]) + (ll)(i>0&&j>0?dpSum[i-1][j-1]:1)*numValues) % mod;
} else {
// range is outside of [a...b]
dp[i][j] = i==0?0:dp[i-1][j];
}
if (j == 0) assert(dp[i][j] == 1);
}
F0R(j, values.size()-1) {
dpSum[i][j] = ((ll)(j>0?dpSum[i][j-1]:0)+dp[i][j])%mod;
}
}
cout << dpSum[n-1][values.size()-2]-1 << endl;
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... |