답안 #199307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199307	2020-01-30T23:16:44 Z	osaaateiasavtnl	Boat (APIO16_boat)	C++14	100 / 100	995 ms	8568 KB

boat

#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1007, MOD = 1000 * 1000 * 1000 + 7;
int fp(int a, int p) {
    ll ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = ans * c % MOD;
        c = c * c % MOD;
    }   
    return ans;
}   
int f[N], inv[N];
int n, l[N], r[N], dp[N][N], mem[N][N], cur[N], pref[N], lmao[N];
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    f[0] = inv[0] = 1;
    for (int i = 1; i < N; ++i) {
        f[i] = ((ll)f[i - 1] * i) % MOD;
        inv[i] = fp(f[i], MOD - 2);
    }   
    for (int i = 0; i < N; ++i)
        mem[i][0] = 1;
    for (int i = 1; i < N; ++i)
        for (int j = 1; j < N; ++j)
            mem[i][j] = (mem[i - 1][j] + mem[i - 1][j - 1]) % MOD;
    cin >> n;
    vector <int> c;
    for (int i = 1; i <= n; ++i) {
        cin >> l[i] >> r[i];
        c.app(l[i]); c.app(r[i] + 1);
    }                                
    sort(all(c));
    c.resize(unique(all(c)) - c.begin());
 
    dp[0][0] = 1;
    for (int i = 0; i + 1 < (int)c.size(); ++i) {   
        cur[0] = 1;
        ll t = 1;
        for (int j = 1; j <= n; ++j) {
            t = (t * (c[i + 1] - c[i] - j + 1)) % MOD;
            cur[j] = (t * inv[j]) % MOD;  
        }
        for (int j = 1; j <= n; ++j)
            pref[j] = pref[j - 1] + (l[j] <= c[i] && c[i + 1] - 1 <= r[j]);
        for (int mx = 1; mx <= n; ++mx) {
            lmao[mx] = 0;
            for (int cnt = 1; cnt <= mx; ++cnt)
                lmao[mx] = (lmao[mx] + (ll)mem[mx - 1][cnt - 1] * cur[cnt]) % MOD;
        }
        for (int j = 0; j <= n; ++j) {  
            dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % MOD;
            for (int k = j + 1; k <= n; ++k) {
                if (l[k] <= c[i] && c[i + 1] - 1 <= r[k]) {
                    int mx = pref[k] - pref[j];
                    dp[i + 1][k] = (dp[i + 1][k] + (ll)dp[i][j] * lmao[mx]) % MOD;
                }   
            }
        }   
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i)
        ans = (ans + dp[c.size() - 1][i]) % MOD;
    cout << ans << '\n';
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	902 ms	8312 KB	Output is correct
2	Correct	901 ms	8440 KB	Output is correct
3	Correct	913 ms	8440 KB	Output is correct
4	Correct	909 ms	8312 KB	Output is correct
5	Correct	915 ms	8460 KB	Output is correct
6	Correct	807 ms	8312 KB	Output is correct
7	Correct	795 ms	8396 KB	Output is correct
8	Correct	800 ms	8312 KB	Output is correct
9	Correct	799 ms	8312 KB	Output is correct
10	Correct	813 ms	8440 KB	Output is correct
11	Correct	806 ms	8436 KB	Output is correct
12	Correct	805 ms	8312 KB	Output is correct
13	Correct	809 ms	8568 KB	Output is correct
14	Correct	800 ms	8440 KB	Output is correct
15	Correct	811 ms	8440 KB	Output is correct
16	Correct	168 ms	5020 KB	Output is correct
17	Correct	176 ms	5116 KB	Output is correct
18	Correct	171 ms	5112 KB	Output is correct
19	Correct	182 ms	5112 KB	Output is correct
20	Correct	169 ms	5112 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	902 ms	8312 KB	Output is correct
2	Correct	901 ms	8440 KB	Output is correct
3	Correct	913 ms	8440 KB	Output is correct
4	Correct	909 ms	8312 KB	Output is correct
5	Correct	915 ms	8460 KB	Output is correct
6	Correct	807 ms	8312 KB	Output is correct
7	Correct	795 ms	8396 KB	Output is correct
8	Correct	800 ms	8312 KB	Output is correct
9	Correct	799 ms	8312 KB	Output is correct
10	Correct	813 ms	8440 KB	Output is correct
11	Correct	806 ms	8436 KB	Output is correct
12	Correct	805 ms	8312 KB	Output is correct
13	Correct	809 ms	8568 KB	Output is correct
14	Correct	800 ms	8440 KB	Output is correct
15	Correct	811 ms	8440 KB	Output is correct
16	Correct	168 ms	5020 KB	Output is correct
17	Correct	176 ms	5116 KB	Output is correct
18	Correct	171 ms	5112 KB	Output is correct
19	Correct	182 ms	5112 KB	Output is correct
20	Correct	169 ms	5112 KB	Output is correct
21	Correct	841 ms	7956 KB	Output is correct
22	Correct	855 ms	8032 KB	Output is correct
23	Correct	852 ms	8056 KB	Output is correct
24	Correct	838 ms	8056 KB	Output is correct
25	Correct	849 ms	8056 KB	Output is correct
26	Correct	852 ms	7928 KB	Output is correct
27	Correct	868 ms	7928 KB	Output is correct
28	Correct	847 ms	7800 KB	Output is correct
29	Correct	841 ms	7928 KB	Output is correct
30	Correct	827 ms	8312 KB	Output is correct
31	Correct	824 ms	8312 KB	Output is correct
32	Correct	813 ms	8440 KB	Output is correct
33	Correct	795 ms	8312 KB	Output is correct
34	Correct	799 ms	8316 KB	Output is correct
35	Correct	904 ms	8440 KB	Output is correct
36	Correct	907 ms	8312 KB	Output is correct
37	Correct	896 ms	8312 KB	Output is correct
38	Correct	928 ms	8440 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	18 ms	5112 KB	Output is correct
2	Correct	18 ms	5112 KB	Output is correct
3	Correct	17 ms	5112 KB	Output is correct
4	Correct	18 ms	5112 KB	Output is correct
5	Correct	18 ms	5112 KB	Output is correct
6	Correct	18 ms	5112 KB	Output is correct
7	Correct	18 ms	5112 KB	Output is correct
8	Correct	18 ms	5112 KB	Output is correct
9	Correct	20 ms	5112 KB	Output is correct
10	Correct	17 ms	5116 KB	Output is correct
11	Correct	18 ms	5112 KB	Output is correct
12	Correct	17 ms	5112 KB	Output is correct
13	Correct	17 ms	5116 KB	Output is correct
14	Correct	16 ms	5112 KB	Output is correct
15	Correct	16 ms	5112 KB	Output is correct
16	Correct	13 ms	4728 KB	Output is correct
17	Correct	14 ms	4728 KB	Output is correct
18	Correct	13 ms	4728 KB	Output is correct
19	Correct	14 ms	4856 KB	Output is correct
20	Correct	14 ms	4732 KB	Output is correct

Subtask #4
42.0 / 42.0

#	결과	실행 시간	메모리	Grader output
1	Correct	902 ms	8312 KB	Output is correct
2	Correct	901 ms	8440 KB	Output is correct
3	Correct	913 ms	8440 KB	Output is correct
4	Correct	909 ms	8312 KB	Output is correct
5	Correct	915 ms	8460 KB	Output is correct
6	Correct	807 ms	8312 KB	Output is correct
7	Correct	795 ms	8396 KB	Output is correct
8	Correct	800 ms	8312 KB	Output is correct
9	Correct	799 ms	8312 KB	Output is correct
10	Correct	813 ms	8440 KB	Output is correct
11	Correct	806 ms	8436 KB	Output is correct
12	Correct	805 ms	8312 KB	Output is correct
13	Correct	809 ms	8568 KB	Output is correct
14	Correct	800 ms	8440 KB	Output is correct
15	Correct	811 ms	8440 KB	Output is correct
16	Correct	168 ms	5020 KB	Output is correct
17	Correct	176 ms	5116 KB	Output is correct
18	Correct	171 ms	5112 KB	Output is correct
19	Correct	182 ms	5112 KB	Output is correct
20	Correct	169 ms	5112 KB	Output is correct
21	Correct	841 ms	7956 KB	Output is correct
22	Correct	855 ms	8032 KB	Output is correct
23	Correct	852 ms	8056 KB	Output is correct
24	Correct	838 ms	8056 KB	Output is correct
25	Correct	849 ms	8056 KB	Output is correct
26	Correct	852 ms	7928 KB	Output is correct
27	Correct	868 ms	7928 KB	Output is correct
28	Correct	847 ms	7800 KB	Output is correct
29	Correct	841 ms	7928 KB	Output is correct
30	Correct	827 ms	8312 KB	Output is correct
31	Correct	824 ms	8312 KB	Output is correct
32	Correct	813 ms	8440 KB	Output is correct
33	Correct	795 ms	8312 KB	Output is correct
34	Correct	799 ms	8316 KB	Output is correct
35	Correct	904 ms	8440 KB	Output is correct
36	Correct	907 ms	8312 KB	Output is correct
37	Correct	896 ms	8312 KB	Output is correct
38	Correct	928 ms	8440 KB	Output is correct
39	Correct	18 ms	5112 KB	Output is correct
40	Correct	18 ms	5112 KB	Output is correct
41	Correct	17 ms	5112 KB	Output is correct
42	Correct	18 ms	5112 KB	Output is correct
43	Correct	18 ms	5112 KB	Output is correct
44	Correct	18 ms	5112 KB	Output is correct
45	Correct	18 ms	5112 KB	Output is correct
46	Correct	18 ms	5112 KB	Output is correct
47	Correct	20 ms	5112 KB	Output is correct
48	Correct	17 ms	5116 KB	Output is correct
49	Correct	18 ms	5112 KB	Output is correct
50	Correct	17 ms	5112 KB	Output is correct
51	Correct	17 ms	5116 KB	Output is correct
52	Correct	16 ms	5112 KB	Output is correct
53	Correct	16 ms	5112 KB	Output is correct
54	Correct	13 ms	4728 KB	Output is correct
55	Correct	14 ms	4728 KB	Output is correct
56	Correct	13 ms	4728 KB	Output is correct
57	Correct	14 ms	4856 KB	Output is correct
58	Correct	14 ms	4732 KB	Output is correct
59	Correct	925 ms	8312 KB	Output is correct
60	Correct	919 ms	8440 KB	Output is correct
61	Correct	917 ms	8444 KB	Output is correct
62	Correct	939 ms	8440 KB	Output is correct
63	Correct	924 ms	8312 KB	Output is correct
64	Correct	954 ms	8440 KB	Output is correct
65	Correct	950 ms	8440 KB	Output is correct
66	Correct	955 ms	8364 KB	Output is correct
67	Correct	941 ms	8440 KB	Output is correct
68	Correct	995 ms	8328 KB	Output is correct
69	Correct	925 ms	8440 KB	Output is correct
70	Correct	913 ms	8312 KB	Output is correct
71	Correct	906 ms	8472 KB	Output is correct
72	Correct	901 ms	8404 KB	Output is correct
73	Correct	907 ms	8312 KB	Output is correct
74	Correct	175 ms	5112 KB	Output is correct
75	Correct	187 ms	5240 KB	Output is correct
76	Correct	193 ms	5144 KB	Output is correct
77	Correct	182 ms	5112 KB	Output is correct
78	Correct	179 ms	5112 KB	Output is correct

답안 #199307

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 42.0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
42.0 / 42.0