# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
41593 | 2018-02-19T18:21:37 Z | gabrielsimoes | Boat (APIO16_boat) | C++14 | 6 ms | 480 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll MOD = 1000000007; const int MAXN = 510; ll fastpow(ll a, ll b) { ll result = 1; ll cur = a; while (b) { if (b & 1) result = (result * cur) % MOD; cur = (cur * cur) % MOD; b >>= 1; } return result; } int n; int va[MAXN], vb[MAXN]; ll dp[MAXN], sum[MAXN]; vector<int> splits; vector<ll> v; ll inv[MAXN]; ll bin(ll a, ll b) { ll result = 1; while (a && b) result = (result + (a--) * inv[b--]); return result; } int main() { for (int i = 1; i < MAXN; i++) inv[i] = fastpow(i, MOD - 2); scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d %d", &va[i], &vb[i]); splits.push_back(va[i]); splits.push_back(vb[i]); } sort(splits.begin(), splits.end()); splits.resize(unique(splits.begin(), splits.end()) - splits.begin()); for (int i = 1; i <= n; i++) { va[i] = (lower_bound(splits.begin(), splits.end(), va[i]) - splits.begin()); vb[i] = (lower_bound(splits.begin(), splits.end(), vb[i]) - splits.begin()); } for (int split = 1; split < splits.size(); split++) { ll splitSize = splits[split] - splits[split - 1] + 1; for (int i = 1; i <= n; i++) { if (va[i] <= split && vb[i] >= split) { dp[i] = (dp[i] + splitSize) % MOD; v.push_back(sum[i - 1]); for (auto p = v.rbegin(); p != v.rend(); p++) { int middle = p - v.rbegin(); dp[i] = (dp[i] + (*p) * bin(splitSize + middle, middle + 1)) % MOD; } } } for (int i = 1; i <= n; i++) sum[i] = (sum[i - 1] + dp[i]) % MOD; v.clear(); } ll ans = 0; for (int i = 1; i <= n; i++) ans = (ans + dp[i]) % MOD; printf("%lld\n", ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 480 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |