oj.uz

Submission #163335

# Submission time Handle Problem Language Result Execution time Memory
163335 2019-11-12T17:26:16 Z Akashi Boat (APIO16_boat) C++14
58 / 100
 2000 ms 13816 KB 
#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

struct interv{
    int x, y;
};
interv a[501];

int n, sz;
int dif[2001];
int inv_mod[2001];
int d[501][2001];
int C[2001][2001], C2[501][501];
vector <int> v;

int lgput(int x, int p){
    int aux = x, ans = 1;
    for(int i = 1; i <= p ; i = i << 1){
        if(i & p) ans = (1LL * ans * aux) % MOD;
        aux = (1LL * aux * aux) % MOD;
    }
    return ans;
}

void calc_comb(int lin, int n, int k){
    int prod = 1;
    C[lin][0] = 1;
    for(int i = 1; i <= k ; ++i){
        prod = (1LL * prod * (n - i + 1)) % MOD;
        prod = (1LL * prod * inv_mod[i]) % MOD;
        C[lin][i] = prod;
    }
}

void prec(){
    C2[0][0] = 1;
    for(int i = 1; i <= n ; ++i){
        C2[i][0] = 1;
        for(int j = 1; j <= i ; ++j){
            C2[i][j] = C2[i - 1][j] + C2[i - 1][j - 1];
            if(C2[i][j] >= MOD) C2[i][j] -= MOD;
        }
    }

    for(int i = 1; i <= n ; ++i)
        inv_mod[i] = lgput(i, MOD - 2);

    for(int k = 2; k <= sz ; ++k)
        calc_comb(k, dif[k], min(n, dif[k]));
}

int main()
{
//    freopen("1.in", "r", stdin);

    scanf("%d", &n);
    for(int i = 1; i <= n ; ++i){
        scanf("%d%d", &a[i].x, &a[i].y);
        v.push_back(a[i].x);
        v.push_back(a[i].x - 1);
        v.push_back(a[i].y);
        v.push_back(a[i].y - 1);
    }

    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());

    sz = v.size();
    for(int i = 2; i <= sz ; ++i) dif[i] = v[i - 1] - v[i - 2];

    for(int i = 1; i <= n ; ++i){
        a[i].x = lower_bound(v.begin(), v.end(), a[i].x) - v.begin() + 1;
        a[i].y = lower_bound(v.begin(), v.end(), a[i].y) - v.begin() + 1;
    }

    prec();

    for(int j = 0; j <= sz ; ++j) d[0][j] = 1;
    for(int j = a[1].x; j <= a[1].y ; ++j) d[1][j] = dif[j];

    d[1][0] += 1;
    for(int j = 1; j <= sz ; ++j){
        d[1][j] += d[1][j - 1];
        if(d[1][j] >= MOD) d[1][j] -= MOD;
    }

    for(int i = 2; i <= n ; ++i){
        for(int j = a[i].x; j <= a[i].y ; ++j){
            int nr = 0;

            ++nr;
            d[i][j] = d[i][j] + (1LL * d[i - 1][j - 1] * dif[j]) % MOD;
            if(d[i][j] >= MOD) d[i][j] -= MOD;

            for(int k = i - 1; k >= 1 ; --k){
                if(a[k].y < j || a[k].x > j) continue ;
                ++nr;
                for(int t = 2; t <= nr && t <= dif[j] ; ++t){
                    d[i][j] = d[i][j] + (1LL * d[k - 1][j - 1] * (1LL * C[j][t] * C2[nr - 2][t - 2] % MOD) % MOD) % MOD;
                    if(d[i][j] >= MOD) d[i][j] -= MOD;
                }
            }
        }

        for(int j = 1; j <= sz ; ++j){
            d[i][j] += d[i][j - 1];
            if(d[i][j] >= MOD) d[i][j] -= MOD;
        }

        for(int j = 0; j <= sz ; ++j){
            d[i][j] += d[i - 1][j];
            if(d[i][j] >= MOD) d[i][j] -= MOD;
        }
    }

    --d[n][sz];
    if(d[n][sz] < 0) d[n][sz] += MOD;
    printf("%d", d[n][sz]);

    return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
boat.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i].x, &a[i].y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10232 KB Output is correct
2 Correct 19 ms 10232 KB Output is correct
3 Correct 19 ms 10232 KB Output is correct
4 Correct 19 ms 10232 KB Output is correct
5 Correct 18 ms 10232 KB Output is correct
6 Correct 18 ms 10232 KB Output is correct
7 Correct 18 ms 10232 KB Output is correct
8 Correct 18 ms 10232 KB Output is correct
9 Correct 19 ms 10232 KB Output is correct
10 Correct 18 ms 10232 KB Output is correct
11 Correct 18 ms 10232 KB Output is correct
12 Correct 18 ms 10232 KB Output is correct
13 Correct 18 ms 10232 KB Output is correct
14 Correct 31 ms 10232 KB Output is correct
15 Correct 18 ms 10164 KB Output is correct
16 Correct 9 ms 4532 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4728 KB Output is correct
20 Correct 9 ms 4672 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10232 KB Output is correct
2 Correct 19 ms 10232 KB Output is correct
3 Correct 19 ms 10232 KB Output is correct
4 Correct 19 ms 10232 KB Output is correct
5 Correct 18 ms 10232 KB Output is correct
6 Correct 18 ms 10232 KB Output is correct
7 Correct 18 ms 10232 KB Output is correct
8 Correct 18 ms 10232 KB Output is correct
9 Correct 19 ms 10232 KB Output is correct
10 Correct 18 ms 10232 KB Output is correct
11 Correct 18 ms 10232 KB Output is correct
12 Correct 18 ms 10232 KB Output is correct
13 Correct 18 ms 10232 KB Output is correct
14 Correct 31 ms 10232 KB Output is correct
15 Correct 18 ms 10164 KB Output is correct
16 Correct 9 ms 4532 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4728 KB Output is correct
20 Correct 9 ms 4672 KB Output is correct
21 Correct 770 ms 12088 KB Output is correct
22 Correct 741 ms 12280 KB Output is correct
23 Correct 674 ms 11932 KB Output is correct
24 Correct 787 ms 12136 KB Output is correct
25 Correct 766 ms 11980 KB Output is correct
26 Correct 769 ms 11640 KB Output is correct
27 Correct 790 ms 11640 KB Output is correct
28 Correct 785 ms 11652 KB Output is correct
29 Correct 817 ms 11704 KB Output is correct
30 Correct 23 ms 13560 KB Output is correct
31 Correct 23 ms 13560 KB Output is correct
32 Correct 23 ms 13560 KB Output is correct
33 Correct 24 ms 13564 KB Output is correct
34 Correct 24 ms 13560 KB Output is correct
35 Correct 19 ms 10104 KB Output is correct
36 Correct 19 ms 10104 KB Output is correct
37 Correct 20 ms 10104 KB Output is correct
38 Correct 19 ms 10232 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2752 KB Output is correct
2 Correct 13 ms 2808 KB Output is correct
3 Correct 17 ms 2812 KB Output is correct
4 Correct 19 ms 2808 KB Output is correct
5 Correct 21 ms 2808 KB Output is correct
6 Correct 54 ms 2808 KB Output is correct
7 Correct 52 ms 2808 KB Output is correct
8 Correct 54 ms 2764 KB Output is correct
9 Correct 53 ms 2796 KB Output is correct
10 Correct 53 ms 2836 KB Output is correct
11 Correct 21 ms 2808 KB Output is correct
12 Correct 12 ms 2808 KB Output is correct
13 Correct 17 ms 2808 KB Output is correct
14 Correct 16 ms 2808 KB Output is correct
15 Correct 19 ms 2808 KB Output is correct
16 Correct 10 ms 1784 KB Output is correct
17 Correct 9 ms 1656 KB Output is correct
18 Correct 10 ms 1788 KB Output is correct
19 Correct 9 ms 1784 KB Output is correct
20 Correct 11 ms 1784 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 10232 KB Output is correct
2 Correct 19 ms 10232 KB Output is correct
3 Correct 19 ms 10232 KB Output is correct
4 Correct 19 ms 10232 KB Output is correct
5 Correct 18 ms 10232 KB Output is correct
6 Correct 18 ms 10232 KB Output is correct
7 Correct 18 ms 10232 KB Output is correct
8 Correct 18 ms 10232 KB Output is correct
9 Correct 19 ms 10232 KB Output is correct
10 Correct 18 ms 10232 KB Output is correct
11 Correct 18 ms 10232 KB Output is correct
12 Correct 18 ms 10232 KB Output is correct
13 Correct 18 ms 10232 KB Output is correct
14 Correct 31 ms 10232 KB Output is correct
15 Correct 18 ms 10164 KB Output is correct
16 Correct 9 ms 4532 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4728 KB Output is correct
20 Correct 9 ms 4672 KB Output is correct
21 Correct 770 ms 12088 KB Output is correct
22 Correct 741 ms 12280 KB Output is correct
23 Correct 674 ms 11932 KB Output is correct
24 Correct 787 ms 12136 KB Output is correct
25 Correct 766 ms 11980 KB Output is correct
26 Correct 769 ms 11640 KB Output is correct
27 Correct 790 ms 11640 KB Output is correct
28 Correct 785 ms 11652 KB Output is correct
29 Correct 817 ms 11704 KB Output is correct
30 Correct 23 ms 13560 KB Output is correct
31 Correct 23 ms 13560 KB Output is correct
32 Correct 23 ms 13560 KB Output is correct
33 Correct 24 ms 13564 KB Output is correct
34 Correct 24 ms 13560 KB Output is correct
35 Correct 19 ms 10104 KB Output is correct
36 Correct 19 ms 10104 KB Output is correct
37 Correct 20 ms 10104 KB Output is correct
38 Correct 19 ms 10232 KB Output is correct
39 Correct 18 ms 2752 KB Output is correct
40 Correct 13 ms 2808 KB Output is correct
41 Correct 17 ms 2812 KB Output is correct
42 Correct 19 ms 2808 KB Output is correct
43 Correct 21 ms 2808 KB Output is correct
44 Correct 54 ms 2808 KB Output is correct
45 Correct 52 ms 2808 KB Output is correct
46 Correct 54 ms 2764 KB Output is correct
47 Correct 53 ms 2796 KB Output is correct
48 Correct 53 ms 2836 KB Output is correct
49 Correct 21 ms 2808 KB Output is correct
50 Correct 12 ms 2808 KB Output is correct
51 Correct 17 ms 2808 KB Output is correct
52 Correct 16 ms 2808 KB Output is correct
53 Correct 19 ms 2808 KB Output is correct
54 Correct 10 ms 1784 KB Output is correct
55 Correct 9 ms 1656 KB Output is correct
56 Correct 10 ms 1788 KB Output is correct
57 Correct 9 ms 1784 KB Output is correct
58 Correct 11 ms 1784 KB Output is correct
59 Execution timed out 2041 ms 13816 KB Time limit exceeded
60 Halted 0 ms 0 KB -