oj.uz

Submission #199293

# Submission time Handle Problem Language Result Execution time Memory
199293 2020-01-30T22:44:44 Z osaaateiasavtnl Boat (APIO16_boat) C++14
58 / 100
 2000 ms 16712 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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 mod(int n) {
    n %= MOD;
    if (n < 0) return n + MOD;
    else return n;
}   
int fp(int a, int p) {
    int ans = 1, c = a;
    for (int i = 0; (1ll << i) <= p; ++i) {
        if ((p >> i) & 1) ans = mod(ans * c);
        c = mod(c * c);
    }   
    return ans;
}   
int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); }
void addmod(int &a, int b) {
    a = mod(a + b);
}   
int C(int n, int k) {
    if (n < k)
        return 0;
    int a = 1;
    for (int i = n; i > n - k; --i)
        a = mod(a * i);
    int b = 1;
    for (int i = 1; i <= k; ++i)
        b = mod(b * i);
    return dv(a, b);
}   
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
    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] = mod(mem[i - 1][j] + mem[i - 1][j - 1]);
    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) {
        for (int j = 0; j <= n; ++j)
            cur[j] = C(c[i + 1] - c[i], j);
        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)
                addmod(lmao[mx], mem[mx - 1][cnt - 1] * cur[cnt]);
        }
        for (int j = 0; j <= n; ++j) {
            addmod(dp[i + 1][j], dp[i][j]);
            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];
                    addmod(dp[i + 1][k], dp[i][j] * lmao[mx]);
                }   
            }
        }   
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i)
        addmod(ans, dp[c.size() - 1][i]);
    cout << ans << '\n';
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1855 ms 16424 KB Output is correct
2 Correct 1857 ms 16168 KB Output is correct
3 Correct 1836 ms 16376 KB Output is correct
4 Correct 1815 ms 16132 KB Output is correct
5 Correct 1855 ms 16376 KB Output is correct
6 Correct 1728 ms 16504 KB Output is correct
7 Correct 1762 ms 16236 KB Output is correct
8 Correct 1725 ms 16332 KB Output is correct
9 Correct 1763 ms 16376 KB Output is correct
10 Correct 1757 ms 16248 KB Output is correct
11 Correct 1742 ms 16380 KB Output is correct
12 Correct 1764 ms 16376 KB Output is correct
13 Correct 1710 ms 16248 KB Output is correct
14 Correct 1692 ms 16252 KB Output is correct
15 Correct 1715 ms 16308 KB Output is correct
16 Correct 330 ms 9720 KB Output is correct
17 Correct 357 ms 9976 KB Output is correct
18 Correct 339 ms 9720 KB Output is correct
19 Correct 358 ms 9848 KB Output is correct
20 Correct 338 ms 9720 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1855 ms 16424 KB Output is correct
2 Correct 1857 ms 16168 KB Output is correct
3 Correct 1836 ms 16376 KB Output is correct
4 Correct 1815 ms 16132 KB Output is correct
5 Correct 1855 ms 16376 KB Output is correct
6 Correct 1728 ms 16504 KB Output is correct
7 Correct 1762 ms 16236 KB Output is correct
8 Correct 1725 ms 16332 KB Output is correct
9 Correct 1763 ms 16376 KB Output is correct
10 Correct 1757 ms 16248 KB Output is correct
11 Correct 1742 ms 16380 KB Output is correct
12 Correct 1764 ms 16376 KB Output is correct
13 Correct 1710 ms 16248 KB Output is correct
14 Correct 1692 ms 16252 KB Output is correct
15 Correct 1715 ms 16308 KB Output is correct
16 Correct 330 ms 9720 KB Output is correct
17 Correct 357 ms 9976 KB Output is correct
18 Correct 339 ms 9720 KB Output is correct
19 Correct 358 ms 9848 KB Output is correct
20 Correct 338 ms 9720 KB Output is correct
21 Correct 918 ms 15560 KB Output is correct
22 Correct 988 ms 15864 KB Output is correct
23 Correct 914 ms 15480 KB Output is correct
24 Correct 934 ms 15480 KB Output is correct
25 Correct 917 ms 15480 KB Output is correct
26 Correct 923 ms 15356 KB Output is correct
27 Correct 929 ms 15352 KB Output is correct
28 Correct 936 ms 15224 KB Output is correct
29 Correct 932 ms 15384 KB Output is correct
30 Correct 1669 ms 16248 KB Output is correct
31 Correct 1623 ms 16508 KB Output is correct
32 Correct 1624 ms 16316 KB Output is correct
33 Correct 1619 ms 16376 KB Output is correct
34 Correct 1630 ms 16376 KB Output is correct
35 Correct 1722 ms 16376 KB Output is correct
36 Correct 1734 ms 16712 KB Output is correct
37 Correct 1774 ms 16232 KB Output is correct
38 Correct 1722 ms 16504 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 9336 KB Output is correct
2 Correct 38 ms 9208 KB Output is correct
3 Correct 37 ms 9208 KB Output is correct
4 Correct 36 ms 9208 KB Output is correct
5 Correct 36 ms 9336 KB Output is correct
6 Correct 37 ms 9212 KB Output is correct
7 Correct 38 ms 9208 KB Output is correct
8 Correct 36 ms 9208 KB Output is correct
9 Correct 37 ms 9208 KB Output is correct
10 Correct 35 ms 9208 KB Output is correct
11 Correct 37 ms 9208 KB Output is correct
12 Correct 37 ms 9208 KB Output is correct
13 Correct 35 ms 9208 KB Output is correct
14 Correct 36 ms 9336 KB Output is correct
15 Correct 35 ms 9208 KB Output is correct
16 Correct 24 ms 8824 KB Output is correct
17 Correct 24 ms 8824 KB Output is correct
18 Correct 23 ms 8824 KB Output is correct
19 Correct 23 ms 8824 KB Output is correct
20 Correct 24 ms 8824 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1855 ms 16424 KB Output is correct
2 Correct 1857 ms 16168 KB Output is correct
3 Correct 1836 ms 16376 KB Output is correct
4 Correct 1815 ms 16132 KB Output is correct
5 Correct 1855 ms 16376 KB Output is correct
6 Correct 1728 ms 16504 KB Output is correct
7 Correct 1762 ms 16236 KB Output is correct
8 Correct 1725 ms 16332 KB Output is correct
9 Correct 1763 ms 16376 KB Output is correct
10 Correct 1757 ms 16248 KB Output is correct
11 Correct 1742 ms 16380 KB Output is correct
12 Correct 1764 ms 16376 KB Output is correct
13 Correct 1710 ms 16248 KB Output is correct
14 Correct 1692 ms 16252 KB Output is correct
15 Correct 1715 ms 16308 KB Output is correct
16 Correct 330 ms 9720 KB Output is correct
17 Correct 357 ms 9976 KB Output is correct
18 Correct 339 ms 9720 KB Output is correct
19 Correct 358 ms 9848 KB Output is correct
20 Correct 338 ms 9720 KB Output is correct
21 Correct 918 ms 15560 KB Output is correct
22 Correct 988 ms 15864 KB Output is correct
23 Correct 914 ms 15480 KB Output is correct
24 Correct 934 ms 15480 KB Output is correct
25 Correct 917 ms 15480 KB Output is correct
26 Correct 923 ms 15356 KB Output is correct
27 Correct 929 ms 15352 KB Output is correct
28 Correct 936 ms 15224 KB Output is correct
29 Correct 932 ms 15384 KB Output is correct
30 Correct 1669 ms 16248 KB Output is correct
31 Correct 1623 ms 16508 KB Output is correct
32 Correct 1624 ms 16316 KB Output is correct
33 Correct 1619 ms 16376 KB Output is correct
34 Correct 1630 ms 16376 KB Output is correct
35 Correct 1722 ms 16376 KB Output is correct
36 Correct 1734 ms 16712 KB Output is correct
37 Correct 1774 ms 16232 KB Output is correct
38 Correct 1722 ms 16504 KB Output is correct
39 Correct 37 ms 9336 KB Output is correct
40 Correct 38 ms 9208 KB Output is correct
41 Correct 37 ms 9208 KB Output is correct
42 Correct 36 ms 9208 KB Output is correct
43 Correct 36 ms 9336 KB Output is correct
44 Correct 37 ms 9212 KB Output is correct
45 Correct 38 ms 9208 KB Output is correct
46 Correct 36 ms 9208 KB Output is correct
47 Correct 37 ms 9208 KB Output is correct
48 Correct 35 ms 9208 KB Output is correct
49 Correct 37 ms 9208 KB Output is correct
50 Correct 37 ms 9208 KB Output is correct
51 Correct 35 ms 9208 KB Output is correct
52 Correct 36 ms 9336 KB Output is correct
53 Correct 35 ms 9208 KB Output is correct
54 Correct 24 ms 8824 KB Output is correct
55 Correct 24 ms 8824 KB Output is correct
56 Correct 23 ms 8824 KB Output is correct
57 Correct 23 ms 8824 KB Output is correct
58 Correct 24 ms 8824 KB Output is correct
59 Execution timed out 2065 ms 14456 KB Time limit exceeded
60 Halted 0 ms 0 KB -