oj.uz

Submission #199302

# Submission time Handle Problem Language Result Execution time Memory
199302 2020-01-30T22:54:27 Z osaaateiasavtnl Boat (APIO16_boat) C++14
58 / 100
 2000 ms 8568 KB 
#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 mod(ll n) {
    if (n < MOD)
        return n;
    else if (n < 2 * MOD)
        return n - MOD;
    else    
        return n % MOD;
}   
int fp(int a, int p) {
    ll 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;
}   
void addmod(int &a, int b) {
    a = mod(a + b);
}   
int f[N], inv[N];
int C(int n, int k) {
    if (n < k)
        return 0;
    ll a = 1;
    for (int i = n; i > n - k; --i)
        a = mod(a * i);
    return mod(a * inv[k]);
}   
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] = mod((ll)f[i - 1] * i);
        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] = 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], mod((ll)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], mod((ll)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 1397 ms 8496 KB Output is correct
2 Correct 1393 ms 8444 KB Output is correct
3 Correct 1404 ms 8440 KB Output is correct
4 Correct 1411 ms 8396 KB Output is correct
5 Correct 1389 ms 8416 KB Output is correct
6 Correct 1310 ms 8520 KB Output is correct
7 Correct 1294 ms 8440 KB Output is correct
8 Correct 1294 ms 8568 KB Output is correct
9 Correct 1286 ms 8568 KB Output is correct
10 Correct 1293 ms 8568 KB Output is correct
11 Correct 1313 ms 8312 KB Output is correct
12 Correct 1311 ms 8452 KB Output is correct
13 Correct 1319 ms 8404 KB Output is correct
14 Correct 1314 ms 8524 KB Output is correct
15 Correct 1301 ms 8360 KB Output is correct
16 Correct 253 ms 5112 KB Output is correct
17 Correct 277 ms 5116 KB Output is correct
18 Correct 266 ms 5112 KB Output is correct
19 Correct 271 ms 5152 KB Output is correct
20 Correct 260 ms 5112 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1397 ms 8496 KB Output is correct
2 Correct 1393 ms 8444 KB Output is correct
3 Correct 1404 ms 8440 KB Output is correct
4 Correct 1411 ms 8396 KB Output is correct
5 Correct 1389 ms 8416 KB Output is correct
6 Correct 1310 ms 8520 KB Output is correct
7 Correct 1294 ms 8440 KB Output is correct
8 Correct 1294 ms 8568 KB Output is correct
9 Correct 1286 ms 8568 KB Output is correct
10 Correct 1293 ms 8568 KB Output is correct
11 Correct 1313 ms 8312 KB Output is correct
12 Correct 1311 ms 8452 KB Output is correct
13 Correct 1319 ms 8404 KB Output is correct
14 Correct 1314 ms 8524 KB Output is correct
15 Correct 1301 ms 8360 KB Output is correct
16 Correct 253 ms 5112 KB Output is correct
17 Correct 277 ms 5116 KB Output is correct
18 Correct 266 ms 5112 KB Output is correct
19 Correct 271 ms 5152 KB Output is correct
20 Correct 260 ms 5112 KB Output is correct
21 Correct 946 ms 8184 KB Output is correct
22 Correct 919 ms 8056 KB Output is correct
23 Correct 890 ms 8140 KB Output is correct
24 Correct 918 ms 8056 KB Output is correct
25 Correct 920 ms 7928 KB Output is correct
26 Correct 900 ms 7924 KB Output is correct
27 Correct 943 ms 7932 KB Output is correct
28 Correct 925 ms 7888 KB Output is correct
29 Correct 924 ms 7800 KB Output is correct
30 Correct 1218 ms 8440 KB Output is correct
31 Correct 1226 ms 8344 KB Output is correct
32 Correct 1234 ms 8308 KB Output is correct
33 Correct 1227 ms 8312 KB Output is correct
34 Correct 1212 ms 8312 KB Output is correct
35 Correct 1304 ms 8312 KB Output is correct
36 Correct 1335 ms 8224 KB Output is correct
37 Correct 1339 ms 8264 KB Output is correct
38 Correct 1317 ms 8372 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5112 KB Output is correct
2 Correct 33 ms 5116 KB Output is correct
3 Correct 34 ms 5112 KB Output is correct
4 Correct 34 ms 5112 KB Output is correct
5 Correct 34 ms 5112 KB Output is correct
6 Correct 36 ms 5112 KB Output is correct
7 Correct 35 ms 5112 KB Output is correct
8 Correct 36 ms 5112 KB Output is correct
9 Correct 36 ms 5112 KB Output is correct
10 Correct 36 ms 5112 KB Output is correct
11 Correct 33 ms 5112 KB Output is correct
12 Correct 33 ms 5112 KB Output is correct
13 Correct 32 ms 5112 KB Output is correct
14 Correct 32 ms 5112 KB Output is correct
15 Correct 33 ms 5112 KB Output is correct
16 Correct 22 ms 4856 KB Output is correct
17 Correct 21 ms 4728 KB Output is correct
18 Correct 23 ms 4728 KB Output is correct
19 Correct 22 ms 4728 KB Output is correct
20 Correct 22 ms 4728 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1397 ms 8496 KB Output is correct
2 Correct 1393 ms 8444 KB Output is correct
3 Correct 1404 ms 8440 KB Output is correct
4 Correct 1411 ms 8396 KB Output is correct
5 Correct 1389 ms 8416 KB Output is correct
6 Correct 1310 ms 8520 KB Output is correct
7 Correct 1294 ms 8440 KB Output is correct
8 Correct 1294 ms 8568 KB Output is correct
9 Correct 1286 ms 8568 KB Output is correct
10 Correct 1293 ms 8568 KB Output is correct
11 Correct 1313 ms 8312 KB Output is correct
12 Correct 1311 ms 8452 KB Output is correct
13 Correct 1319 ms 8404 KB Output is correct
14 Correct 1314 ms 8524 KB Output is correct
15 Correct 1301 ms 8360 KB Output is correct
16 Correct 253 ms 5112 KB Output is correct
17 Correct 277 ms 5116 KB Output is correct
18 Correct 266 ms 5112 KB Output is correct
19 Correct 271 ms 5152 KB Output is correct
20 Correct 260 ms 5112 KB Output is correct
21 Correct 946 ms 8184 KB Output is correct
22 Correct 919 ms 8056 KB Output is correct
23 Correct 890 ms 8140 KB Output is correct
24 Correct 918 ms 8056 KB Output is correct
25 Correct 920 ms 7928 KB Output is correct
26 Correct 900 ms 7924 KB Output is correct
27 Correct 943 ms 7932 KB Output is correct
28 Correct 925 ms 7888 KB Output is correct
29 Correct 924 ms 7800 KB Output is correct
30 Correct 1218 ms 8440 KB Output is correct
31 Correct 1226 ms 8344 KB Output is correct
32 Correct 1234 ms 8308 KB Output is correct
33 Correct 1227 ms 8312 KB Output is correct
34 Correct 1212 ms 8312 KB Output is correct
35 Correct 1304 ms 8312 KB Output is correct
36 Correct 1335 ms 8224 KB Output is correct
37 Correct 1339 ms 8264 KB Output is correct
38 Correct 1317 ms 8372 KB Output is correct
39 Correct 34 ms 5112 KB Output is correct
40 Correct 33 ms 5116 KB Output is correct
41 Correct 34 ms 5112 KB Output is correct
42 Correct 34 ms 5112 KB Output is correct
43 Correct 34 ms 5112 KB Output is correct
44 Correct 36 ms 5112 KB Output is correct
45 Correct 35 ms 5112 KB Output is correct
46 Correct 36 ms 5112 KB Output is correct
47 Correct 36 ms 5112 KB Output is correct
48 Correct 36 ms 5112 KB Output is correct
49 Correct 33 ms 5112 KB Output is correct
50 Correct 33 ms 5112 KB Output is correct
51 Correct 32 ms 5112 KB Output is correct
52 Correct 32 ms 5112 KB Output is correct
53 Correct 33 ms 5112 KB Output is correct
54 Correct 22 ms 4856 KB Output is correct
55 Correct 21 ms 4728 KB Output is correct
56 Correct 23 ms 4728 KB Output is correct
57 Correct 22 ms 4728 KB Output is correct
58 Correct 22 ms 4728 KB Output is correct
59 Execution timed out 2067 ms 7236 KB Time limit exceeded
60 Halted 0 ms 0 KB -