oj.uz

Submission #500515

# Submission time Handle Problem Language Result Execution time Memory
500515 2021-12-31T09:35:56 Z doowey Boat (APIO16_boat) C++14
58 / 100
 2000 ms 13356 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 505;
const int M = N * 4;
const int MOD = (int)1e9 + 7;
int L[N], R[N];

int C[M][N];
int I[N][N];

int fin[M][N];

int powr(int n, int k){
    if(k == 0) return 1;
    int p = powr(n, k / 2);
    p = (p * 1ll * p) % MOD;
    if(k % 2 == 1) p = (p * 1ll * n) % MOD;
    return p;
}

void add(int &a, int b){
    a += b;
    if(a >= MOD) a -= MOD;
    else if(a < 0) a += MOD;
}

int dp[N][M];
int dif[N];


int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    int n;
    cin >> n;
    vector<int> pp;
    for(int i = 1; i <= n; i ++ ){
        cin >> L[i] >> R[i];
        pp.push_back(L[i]);
        pp.push_back(R[i]);
    }
    sort(pp.begin(), pp.end());
    pp.resize(unique(pp.begin(), pp.end()) - pp.begin());
    vector<pii> segm;
    for(int i = 0 ; i < pp.size(); i ++ ){
        segm.push_back(mp(pp[i], pp[i]));
        if(i + 1 < pp.size() && pp[i] + 1 <= pp[i + 1] - 1){
            segm.push_back(mp(pp[i] + 1, pp[i + 1] - 1));
        }
    }
    int m = segm.size();
    for(int i = 0; i < N ;i ++ ){
        I[i][0] = 1;
    }
    for(int k = 1; k < N ; k ++ ){
        for(int i = 1; i < N ; i ++ ){
            add(I[i][k], I[i-1][k]);
            add(I[i][k], I[i-1][k-1]);
        }
    }
    int sz;
    int P, Q;
    int inv;
    int cum;
    for(int i = 0 ; i < m ; i ++ ){
        sz = segm[i].se - segm[i].fi + 1;
        P = Q = 1;
        for(int j = 1; j <= n; j ++ ){
            if(j > sz) break;
            P = (P * 1ll * (sz - j + 1)) % MOD;
            Q = (Q * 1ll * j) % MOD;
            inv = powr(Q, MOD - 2);
            C[i][j] = (P * 1ll * inv) % MOD;
        }
        if(sz == 1){
            for(int j = 1; j <= n; j ++ ){
                fin[i][j] = j;
            }
        }
        else{
            for(int j = 1; j <= n; j ++ ){
                for(int v = 1; v <= j; v ++ ){
                    add(fin[i][j], (C[i][v] * 1ll * I[j][v]) % MOD);
                }
            }
        }
        for(int j = n; j >= 1; j -- ){
            add(fin[i][j], -fin[i][j-1]);
        }
    }

    int tl, tr;
    int mm;
    int side;
    int res = 0;
    for(int i = 1; i <= n; i ++ ){
        for(int j = 0 ; j < m ; j ++ ){
            tl = segm[j].fi;
            tr = segm[j].se;
            if(L[i] <= tl && tr <= R[i]){
                mm = 0;
                for(int v = i; v >= 1; v -- ){

                    if(L[v] <= tl && tr <= R[v]) mm ++ ;
                    side = 0;
                    if(j > 0) add(side, dp[v - 1][j - 1]);
                    if(v == 1) add(side, 1);
                    add(dp[i][j], (side * 1ll * fin[j][mm]) % MOD);
                }
            }
            add(res, dp[i][j]);
            if(j)
                add(dp[i][j], dp[i][j-1]);
        }
    }

    cout << res << "\n";
    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i = 0 ; i < pp.size(); i ++ ){
      |                     ~~^~~~~~~~~~~
boat.cpp:57:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         if(i + 1 < pp.size() && pp[i] + 1 <= pp[i + 1] - 1){
      |            ~~~~~~^~~~~~~~~~~
boat.cpp:74:9: warning: unused variable 'cum' [-Wunused-variable]
   74 |     int cum;
      |         ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 9352 KB Output is correct
2 Correct 456 ms 9180 KB Output is correct
3 Correct 466 ms 9132 KB Output is correct
4 Correct 457 ms 9268 KB Output is correct
5 Correct 481 ms 9232 KB Output is correct
6 Correct 455 ms 9188 KB Output is correct
7 Correct 463 ms 9172 KB Output is correct
8 Correct 459 ms 9236 KB Output is correct
9 Correct 465 ms 9260 KB Output is correct
10 Correct 460 ms 9332 KB Output is correct
11 Correct 470 ms 9188 KB Output is correct
12 Correct 472 ms 9320 KB Output is correct
13 Correct 464 ms 9204 KB Output is correct
14 Correct 457 ms 9240 KB Output is correct
15 Correct 459 ms 9296 KB Output is correct
16 Correct 85 ms 4264 KB Output is correct
17 Correct 90 ms 4308 KB Output is correct
18 Correct 86 ms 4296 KB Output is correct
19 Correct 92 ms 4364 KB Output is correct
20 Correct 87 ms 4372 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 9352 KB Output is correct
2 Correct 456 ms 9180 KB Output is correct
3 Correct 466 ms 9132 KB Output is correct
4 Correct 457 ms 9268 KB Output is correct
5 Correct 481 ms 9232 KB Output is correct
6 Correct 455 ms 9188 KB Output is correct
7 Correct 463 ms 9172 KB Output is correct
8 Correct 459 ms 9236 KB Output is correct
9 Correct 465 ms 9260 KB Output is correct
10 Correct 460 ms 9332 KB Output is correct
11 Correct 470 ms 9188 KB Output is correct
12 Correct 472 ms 9320 KB Output is correct
13 Correct 464 ms 9204 KB Output is correct
14 Correct 457 ms 9240 KB Output is correct
15 Correct 459 ms 9296 KB Output is correct
16 Correct 85 ms 4264 KB Output is correct
17 Correct 90 ms 4308 KB Output is correct
18 Correct 86 ms 4296 KB Output is correct
19 Correct 92 ms 4364 KB Output is correct
20 Correct 87 ms 4372 KB Output is correct
21 Correct 1012 ms 11848 KB Output is correct
22 Correct 962 ms 12020 KB Output is correct
23 Correct 909 ms 11716 KB Output is correct
24 Correct 983 ms 11988 KB Output is correct
25 Correct 944 ms 11840 KB Output is correct
26 Correct 1018 ms 11468 KB Output is correct
27 Correct 1051 ms 11440 KB Output is correct
28 Correct 1016 ms 11464 KB Output is correct
29 Correct 1034 ms 11728 KB Output is correct
30 Correct 590 ms 12636 KB Output is correct
31 Correct 582 ms 12532 KB Output is correct
32 Correct 571 ms 12556 KB Output is correct
33 Correct 627 ms 12508 KB Output is correct
34 Correct 573 ms 12600 KB Output is correct
35 Correct 445 ms 9224 KB Output is correct
36 Correct 445 ms 9156 KB Output is correct
37 Correct 452 ms 9284 KB Output is correct
38 Correct 449 ms 9136 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 3376 KB Output is correct
2 Correct 21 ms 3404 KB Output is correct
3 Correct 20 ms 3372 KB Output is correct
4 Correct 22 ms 3396 KB Output is correct
5 Correct 26 ms 3404 KB Output is correct
6 Correct 24 ms 3332 KB Output is correct
7 Correct 23 ms 3396 KB Output is correct
8 Correct 24 ms 3364 KB Output is correct
9 Correct 25 ms 3396 KB Output is correct
10 Correct 24 ms 3380 KB Output is correct
11 Correct 21 ms 3332 KB Output is correct
12 Correct 19 ms 3452 KB Output is correct
13 Correct 19 ms 3336 KB Output is correct
14 Correct 20 ms 3384 KB Output is correct
15 Correct 21 ms 3384 KB Output is correct
16 Correct 11 ms 2380 KB Output is correct
17 Correct 11 ms 2380 KB Output is correct
18 Correct 12 ms 2380 KB Output is correct
19 Correct 10 ms 2380 KB Output is correct
20 Correct 11 ms 2400 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 455 ms 9352 KB Output is correct
2 Correct 456 ms 9180 KB Output is correct
3 Correct 466 ms 9132 KB Output is correct
4 Correct 457 ms 9268 KB Output is correct
5 Correct 481 ms 9232 KB Output is correct
6 Correct 455 ms 9188 KB Output is correct
7 Correct 463 ms 9172 KB Output is correct
8 Correct 459 ms 9236 KB Output is correct
9 Correct 465 ms 9260 KB Output is correct
10 Correct 460 ms 9332 KB Output is correct
11 Correct 470 ms 9188 KB Output is correct
12 Correct 472 ms 9320 KB Output is correct
13 Correct 464 ms 9204 KB Output is correct
14 Correct 457 ms 9240 KB Output is correct
15 Correct 459 ms 9296 KB Output is correct
16 Correct 85 ms 4264 KB Output is correct
17 Correct 90 ms 4308 KB Output is correct
18 Correct 86 ms 4296 KB Output is correct
19 Correct 92 ms 4364 KB Output is correct
20 Correct 87 ms 4372 KB Output is correct
21 Correct 1012 ms 11848 KB Output is correct
22 Correct 962 ms 12020 KB Output is correct
23 Correct 909 ms 11716 KB Output is correct
24 Correct 983 ms 11988 KB Output is correct
25 Correct 944 ms 11840 KB Output is correct
26 Correct 1018 ms 11468 KB Output is correct
27 Correct 1051 ms 11440 KB Output is correct
28 Correct 1016 ms 11464 KB Output is correct
29 Correct 1034 ms 11728 KB Output is correct
30 Correct 590 ms 12636 KB Output is correct
31 Correct 582 ms 12532 KB Output is correct
32 Correct 571 ms 12556 KB Output is correct
33 Correct 627 ms 12508 KB Output is correct
34 Correct 573 ms 12600 KB Output is correct
35 Correct 445 ms 9224 KB Output is correct
36 Correct 445 ms 9156 KB Output is correct
37 Correct 452 ms 9284 KB Output is correct
38 Correct 449 ms 9136 KB Output is correct
39 Correct 21 ms 3376 KB Output is correct
40 Correct 21 ms 3404 KB Output is correct
41 Correct 20 ms 3372 KB Output is correct
42 Correct 22 ms 3396 KB Output is correct
43 Correct 26 ms 3404 KB Output is correct
44 Correct 24 ms 3332 KB Output is correct
45 Correct 23 ms 3396 KB Output is correct
46 Correct 24 ms 3364 KB Output is correct
47 Correct 25 ms 3396 KB Output is correct
48 Correct 24 ms 3380 KB Output is correct
49 Correct 21 ms 3332 KB Output is correct
50 Correct 19 ms 3452 KB Output is correct
51 Correct 19 ms 3336 KB Output is correct
52 Correct 20 ms 3384 KB Output is correct
53 Correct 21 ms 3384 KB Output is correct
54 Correct 11 ms 2380 KB Output is correct
55 Correct 11 ms 2380 KB Output is correct
56 Correct 12 ms 2380 KB Output is correct
57 Correct 10 ms 2380 KB Output is correct
58 Correct 11 ms 2400 KB Output is correct
59 Correct 1859 ms 13356 KB Output is correct
60 Correct 1805 ms 13284 KB Output is correct
61 Correct 1753 ms 13320 KB Output is correct
62 Correct 1855 ms 13212 KB Output is correct
63 Correct 1910 ms 13284 KB Output is correct
64 Execution timed out 2069 ms 13120 KB Time limit exceeded
65 Halted 0 ms 0 KB -