# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
376264 |
2021-03-11T06:33:43 Z |
shivensinha4 |
Boat (APIO16_boat) |
C++17 |
|
2000 ms |
16240 KB |
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
// #define endl '\n'
const ll mod = 1e9+7;
ll power(ll x, ll y) {
if (y == 0) return 1;
ll p = power(x, y/2) % mod;
p = (p * p) % mod;
return (y%2 == 0)? p : (x * p) % mod;
}
ll modInverse(ll a) {
return power(a, mod-2);
}
const int MXN = 500;
ll choose[4*MXN+2][MXN+1], dp[2][MXN+1][MXN+1][2];
int main() {
#ifdef mlocal
freopen("test.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<ii> lt(n);
vi raw(2*n);
for_(i, 0, n) {
cin >> lt[i][0] >> lt[i][1];
raw[2*i] = lt[i][0], raw[2*i+1] = lt[i][1];
}
sort(raw.begin(), raw.end());
raw.resize(unique(raw.begin(), raw.end()) - raw.begin());
vector<ii> seg;
int pre = -1;
for_(i, 0, raw.size()) {
if (pre < raw[i] and pre != -1) seg.push_back({pre, raw[i]-1});
seg.push_back({raw[i], raw[i]});
pre = raw[i]+1;
}
int ns = seg.size();
memset(choose, 0, sizeof(choose)); memset(dp, 0, sizeof(dp));
vector<ll> modInv(n+1);
for_(i, 1, n+1) modInv[i] = modInverse(i);
for_(i, 0, ns) {
choose[i][0] = 1;
for_(r, 1, min(n, seg[i][1]-seg[i][0]+1) + 1) choose[i][r] = (((choose[i][r-1] * (seg[i][1]-seg[i][0]-r+2)) % mod) * modInv[r]) % mod;
}
int c = 0;
for (int s = ns-1; s >= 0; s--) {
memset(dp[c], 0, sizeof(dp[c]));
for (int ct = min(n-1, seg[s][1]-seg[s][0]+1); ct >= 0; ct--) {
dp[c][ct][n][0] = choose[s][ct];
for (int idx = n-1; idx >= 0; idx--) {
if (seg[s][0] >= lt[idx][0] and seg[s][1] <= lt[idx][1]) dp[c][ct][idx][1] += dp[c][ct+1][idx+1][0];
if (dp[c][ct][idx][1] >= mod) dp[c][ct][idx][1] -= mod;
dp[c][ct][idx][1] += (choose[s][ct] * (s < ns-1 ? dp[1-c][0][idx][1] : 0)) % mod;
if (dp[c][ct][idx][1] >= mod) dp[c][ct][idx][1] -= mod;
dp[c][ct][idx][0] = dp[c][ct][idx][1] + dp[c][ct][idx+1][0];
if (dp[c][ct][idx][0] >= mod) dp[c][ct][idx][0] -= mod;
}
}
c = 1-c;
}
cout << (dp[1-c][0][0][0]-1+mod) % mod << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1131 ms |
16140 KB |
Output is correct |
2 |
Correct |
1161 ms |
16140 KB |
Output is correct |
3 |
Correct |
1167 ms |
16140 KB |
Output is correct |
4 |
Correct |
1176 ms |
16140 KB |
Output is correct |
5 |
Correct |
1166 ms |
16108 KB |
Output is correct |
6 |
Correct |
986 ms |
16108 KB |
Output is correct |
7 |
Correct |
1014 ms |
16152 KB |
Output is correct |
8 |
Correct |
1006 ms |
16236 KB |
Output is correct |
9 |
Correct |
1006 ms |
16236 KB |
Output is correct |
10 |
Correct |
1010 ms |
16140 KB |
Output is correct |
11 |
Correct |
1016 ms |
16236 KB |
Output is correct |
12 |
Correct |
993 ms |
16236 KB |
Output is correct |
13 |
Correct |
1028 ms |
16140 KB |
Output is correct |
14 |
Correct |
1008 ms |
16236 KB |
Output is correct |
15 |
Correct |
1012 ms |
16108 KB |
Output is correct |
16 |
Correct |
213 ms |
16108 KB |
Output is correct |
17 |
Correct |
234 ms |
16236 KB |
Output is correct |
18 |
Correct |
231 ms |
16108 KB |
Output is correct |
19 |
Correct |
234 ms |
16108 KB |
Output is correct |
20 |
Correct |
255 ms |
16108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1131 ms |
16140 KB |
Output is correct |
2 |
Correct |
1161 ms |
16140 KB |
Output is correct |
3 |
Correct |
1167 ms |
16140 KB |
Output is correct |
4 |
Correct |
1176 ms |
16140 KB |
Output is correct |
5 |
Correct |
1166 ms |
16108 KB |
Output is correct |
6 |
Correct |
986 ms |
16108 KB |
Output is correct |
7 |
Correct |
1014 ms |
16152 KB |
Output is correct |
8 |
Correct |
1006 ms |
16236 KB |
Output is correct |
9 |
Correct |
1006 ms |
16236 KB |
Output is correct |
10 |
Correct |
1010 ms |
16140 KB |
Output is correct |
11 |
Correct |
1016 ms |
16236 KB |
Output is correct |
12 |
Correct |
993 ms |
16236 KB |
Output is correct |
13 |
Correct |
1028 ms |
16140 KB |
Output is correct |
14 |
Correct |
1008 ms |
16236 KB |
Output is correct |
15 |
Correct |
1012 ms |
16108 KB |
Output is correct |
16 |
Correct |
213 ms |
16108 KB |
Output is correct |
17 |
Correct |
234 ms |
16236 KB |
Output is correct |
18 |
Correct |
231 ms |
16108 KB |
Output is correct |
19 |
Correct |
234 ms |
16108 KB |
Output is correct |
20 |
Correct |
255 ms |
16108 KB |
Output is correct |
21 |
Correct |
774 ms |
16108 KB |
Output is correct |
22 |
Correct |
753 ms |
16108 KB |
Output is correct |
23 |
Correct |
775 ms |
16236 KB |
Output is correct |
24 |
Correct |
726 ms |
16152 KB |
Output is correct |
25 |
Correct |
798 ms |
16152 KB |
Output is correct |
26 |
Correct |
661 ms |
16152 KB |
Output is correct |
27 |
Correct |
740 ms |
16152 KB |
Output is correct |
28 |
Correct |
721 ms |
16152 KB |
Output is correct |
29 |
Correct |
724 ms |
16152 KB |
Output is correct |
30 |
Correct |
1387 ms |
16156 KB |
Output is correct |
31 |
Correct |
1374 ms |
16156 KB |
Output is correct |
32 |
Correct |
1380 ms |
16156 KB |
Output is correct |
33 |
Correct |
1367 ms |
16156 KB |
Output is correct |
34 |
Correct |
1439 ms |
16156 KB |
Output is correct |
35 |
Correct |
1093 ms |
16236 KB |
Output is correct |
36 |
Correct |
1107 ms |
16140 KB |
Output is correct |
37 |
Correct |
1145 ms |
16108 KB |
Output is correct |
38 |
Correct |
1143 ms |
16236 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
189 ms |
16112 KB |
Output is correct |
2 |
Correct |
178 ms |
16236 KB |
Output is correct |
3 |
Correct |
196 ms |
16236 KB |
Output is correct |
4 |
Correct |
197 ms |
16164 KB |
Output is correct |
5 |
Correct |
183 ms |
16236 KB |
Output is correct |
6 |
Correct |
184 ms |
16236 KB |
Output is correct |
7 |
Correct |
189 ms |
16236 KB |
Output is correct |
8 |
Correct |
173 ms |
16108 KB |
Output is correct |
9 |
Correct |
223 ms |
16236 KB |
Output is correct |
10 |
Correct |
188 ms |
16236 KB |
Output is correct |
11 |
Correct |
225 ms |
16108 KB |
Output is correct |
12 |
Correct |
222 ms |
16108 KB |
Output is correct |
13 |
Correct |
170 ms |
16108 KB |
Output is correct |
14 |
Correct |
212 ms |
16108 KB |
Output is correct |
15 |
Correct |
211 ms |
16236 KB |
Output is correct |
16 |
Correct |
75 ms |
16108 KB |
Output is correct |
17 |
Correct |
78 ms |
16240 KB |
Output is correct |
18 |
Correct |
87 ms |
16108 KB |
Output is correct |
19 |
Correct |
76 ms |
16108 KB |
Output is correct |
20 |
Correct |
83 ms |
16108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1131 ms |
16140 KB |
Output is correct |
2 |
Correct |
1161 ms |
16140 KB |
Output is correct |
3 |
Correct |
1167 ms |
16140 KB |
Output is correct |
4 |
Correct |
1176 ms |
16140 KB |
Output is correct |
5 |
Correct |
1166 ms |
16108 KB |
Output is correct |
6 |
Correct |
986 ms |
16108 KB |
Output is correct |
7 |
Correct |
1014 ms |
16152 KB |
Output is correct |
8 |
Correct |
1006 ms |
16236 KB |
Output is correct |
9 |
Correct |
1006 ms |
16236 KB |
Output is correct |
10 |
Correct |
1010 ms |
16140 KB |
Output is correct |
11 |
Correct |
1016 ms |
16236 KB |
Output is correct |
12 |
Correct |
993 ms |
16236 KB |
Output is correct |
13 |
Correct |
1028 ms |
16140 KB |
Output is correct |
14 |
Correct |
1008 ms |
16236 KB |
Output is correct |
15 |
Correct |
1012 ms |
16108 KB |
Output is correct |
16 |
Correct |
213 ms |
16108 KB |
Output is correct |
17 |
Correct |
234 ms |
16236 KB |
Output is correct |
18 |
Correct |
231 ms |
16108 KB |
Output is correct |
19 |
Correct |
234 ms |
16108 KB |
Output is correct |
20 |
Correct |
255 ms |
16108 KB |
Output is correct |
21 |
Correct |
774 ms |
16108 KB |
Output is correct |
22 |
Correct |
753 ms |
16108 KB |
Output is correct |
23 |
Correct |
775 ms |
16236 KB |
Output is correct |
24 |
Correct |
726 ms |
16152 KB |
Output is correct |
25 |
Correct |
798 ms |
16152 KB |
Output is correct |
26 |
Correct |
661 ms |
16152 KB |
Output is correct |
27 |
Correct |
740 ms |
16152 KB |
Output is correct |
28 |
Correct |
721 ms |
16152 KB |
Output is correct |
29 |
Correct |
724 ms |
16152 KB |
Output is correct |
30 |
Correct |
1387 ms |
16156 KB |
Output is correct |
31 |
Correct |
1374 ms |
16156 KB |
Output is correct |
32 |
Correct |
1380 ms |
16156 KB |
Output is correct |
33 |
Correct |
1367 ms |
16156 KB |
Output is correct |
34 |
Correct |
1439 ms |
16156 KB |
Output is correct |
35 |
Correct |
1093 ms |
16236 KB |
Output is correct |
36 |
Correct |
1107 ms |
16140 KB |
Output is correct |
37 |
Correct |
1145 ms |
16108 KB |
Output is correct |
38 |
Correct |
1143 ms |
16236 KB |
Output is correct |
39 |
Correct |
189 ms |
16112 KB |
Output is correct |
40 |
Correct |
178 ms |
16236 KB |
Output is correct |
41 |
Correct |
196 ms |
16236 KB |
Output is correct |
42 |
Correct |
197 ms |
16164 KB |
Output is correct |
43 |
Correct |
183 ms |
16236 KB |
Output is correct |
44 |
Correct |
184 ms |
16236 KB |
Output is correct |
45 |
Correct |
189 ms |
16236 KB |
Output is correct |
46 |
Correct |
173 ms |
16108 KB |
Output is correct |
47 |
Correct |
223 ms |
16236 KB |
Output is correct |
48 |
Correct |
188 ms |
16236 KB |
Output is correct |
49 |
Correct |
225 ms |
16108 KB |
Output is correct |
50 |
Correct |
222 ms |
16108 KB |
Output is correct |
51 |
Correct |
170 ms |
16108 KB |
Output is correct |
52 |
Correct |
212 ms |
16108 KB |
Output is correct |
53 |
Correct |
211 ms |
16236 KB |
Output is correct |
54 |
Correct |
75 ms |
16108 KB |
Output is correct |
55 |
Correct |
78 ms |
16240 KB |
Output is correct |
56 |
Correct |
87 ms |
16108 KB |
Output is correct |
57 |
Correct |
76 ms |
16108 KB |
Output is correct |
58 |
Correct |
83 ms |
16108 KB |
Output is correct |
59 |
Execution timed out |
2073 ms |
16108 KB |
Time limit exceeded |
60 |
Halted |
0 ms |
0 KB |
- |