oj.uz

Submission #96117

# Submission time Handle Problem Language Result Execution time Memory
96117 2019-02-06T06:37:10 Z oolimry Boat (APIO16_boat) C++14
58 / 100
 2000 ms 8488 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<long long, long long> ii;
long long mod = 1000000007;
//long long dp[505][2005];
//static long long dp[505][2005][505];
#define int long long
long long modInverse(long long a, long long m)
{
    long long m0 = m;
    long long y = 0, x = 1;

    if (m == 1)
      return 0;

    while (a > 1)
    {
        // q is quotient
        long long q = a / m;
        long long t = m;

        // m is remainder now, process same as
        // Euclid's algo
        m = a % m, a = t;
        t = y;

        // Update y and x
        y = x - q * y;
        x = t;
    }

    // Make x positive
    if (x < 0)
       x += m0;

    return x;
}
main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    long long inverse[505];
    for(long long i = 1;i < 505;i++){
        inverse[i] = modInverse(i,mod);
    }
    int n;
    cin >> n;
    long long a[n];
    long long b[n];

    set<long long> s;
    for(int i = 0;i < n;i++){
        cin >> a[i] >> b[i];
        s.insert(a[i]);
        s.insert(b[i]+1);
    }
    //cout << s.size() << endl;
    vector<long long> key;
    for(set<long long>::iterator it = s.begin();it != s.end();it++){
        key.push_back(*it);
    }
    //cout << k.size() << endl;
    int m = key.size() - 1;
    ii ranges[m];
    for(int i = 0;i < m;i++){
        ranges[i] = (ii(key[i],key[i+1]-1));
    }
    sort(ranges,ranges + m);

    //cout << m << "\n";
    long long diff[m];
    for(int i = 0;i < m;i++){
        diff[i] = ranges[i].second - ranges[i].first + 1;
        diff[i] %= mod;
        //cout << ranges[i].first << " " << ranges[i].second << "\n";
    }
    long long posa[n];
    long long posb[n];
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            if(ranges[j].first == a[i]) posa[i] = j;
            if(ranges[j].second == b[i]) posb[i] = j;
        }
    }



    static long long dp[2][2005][505];
    //boat no, range, number taken b4;

    for(int i = 0;i < 2;i++){
        for(int j = 0;j < m;j++){
            for(int k = 0;k < 505;k++){
                dp[i][j][k] = 0ll;
            }
        }
    }


    for(int j = posa[0];j <= posb[0];j++){
        if(a[0] <= ranges[j].first && b[0] >= ranges[j].second){
            dp[0][j][1] = diff[j];
            //cout << a[0] << " " << ranges[j].first << " " << ranges[j].second << " " << b[0] << endl;
        }
    }

    for(int i = 1;i < n;i++){
        long long acc[m];
        fill(acc,acc+m,0);
        ///take nothing for this school
        int ii = i % 2;
        for(int j = 0;j < m;j++){
            for(int k = 1;k < 505;k++){
                if(dp[ii^1][j][k] == 0) break;
                dp[ii][j][k] = dp[ii^1][j][k];
                dp[ii][j][k] %= mod;
                acc[j] += dp[ii][j][k];
                acc[j] %= mod;
            }
            if(j!=0){
                acc[j] += acc[j-1];
                acc[j] %= mod;
            }
        }


        ///take same as previous school
        for(int j = posa[i];j <= posb[i];j++){
            if(a[i] <= ranges[j].first && b[i] >= ranges[j].second){
                for(int k = 2;k < 505;k++){
                    long long x = dp[ii^1][j][k-1];
                    if(diff[j] - k + 1 <= 0) break;
                    x *= (diff[j] - k + 1);
                    x %= mod;
                    x *= inverse[k];
                    x %= mod;
                    dp[ii][j][k] += x;
                    //dp[ii][j][k] %= mod;
                }
            }
        }

        ///take for the first time
        //long long acc = 0ll;
        for(int j = posa[i];j <= posb[i];j++){
            if(a[i] <= ranges[j].first && b[i] >= ranges[j].second){
                long long x;
                if(j == 0) x = 0;
                else x = acc[j-1];
                x += 1;
                x *= diff[j];
                dp[ii][j][1] += x;
                dp[ii][j][1] %= mod;
            }
        }

    }

/*
    for(int j = 0;j < m;j++){
        cout << ranges[j].first << " " << ranges[j].second << ": ";
        for(int i = 0;i < n;i++){
            cout << dp[i][j] << " ";
        }
        cout << "\n";
    }
*/
    long long ans = 0ll;
    for(int j = 0;j < m;j++){
        for(int k = 1;k < 505;k++){
            ans += dp[(n-1)%2][j][k];
            ans %= mod;
            if(dp[(n-1)%2][j][k] != 0){
                //cout << j << " " << k << " " << dp[(n-1)%2][j][k] << "\n";
            }
        }
    }
    cout << ans;

    return 0;
}

Compilation message

boat.cpp:39:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
boat.cpp: In function 'int main()':
boat.cpp:65:8: warning: argument 1 value '18446744073709551600' exceeds maximum object size 9223372036854775807 [-Walloc-size-larger-than=]
     ii ranges[m];
        ^~~~~~
boat.cpp:65:8: note: in a call to built-in allocation function 'void* __builtin_alloca_with_align(long unsigned int, long unsigned int)'

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 8440 KB Output is correct
2 Correct 28 ms 8312 KB Output is correct
3 Correct 30 ms 8328 KB Output is correct
4 Correct 29 ms 8440 KB Output is correct
5 Correct 28 ms 8312 KB Output is correct
6 Correct 30 ms 8404 KB Output is correct
7 Correct 30 ms 8396 KB Output is correct
8 Correct 29 ms 8440 KB Output is correct
9 Correct 29 ms 8312 KB Output is correct
10 Correct 28 ms 8440 KB Output is correct
11 Correct 28 ms 8440 KB Output is correct
12 Correct 29 ms 8440 KB Output is correct
13 Correct 29 ms 8440 KB Output is correct
14 Correct 28 ms 8440 KB Output is correct
15 Correct 29 ms 8312 KB Output is correct
16 Correct 7 ms 1784 KB Output is correct
17 Correct 7 ms 1912 KB Output is correct
18 Correct 7 ms 1784 KB Output is correct
19 Correct 7 ms 1912 KB Output is correct
20 Correct 7 ms 1912 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 8440 KB Output is correct
2 Correct 28 ms 8312 KB Output is correct
3 Correct 30 ms 8328 KB Output is correct
4 Correct 29 ms 8440 KB Output is correct
5 Correct 28 ms 8312 KB Output is correct
6 Correct 30 ms 8404 KB Output is correct
7 Correct 30 ms 8396 KB Output is correct
8 Correct 29 ms 8440 KB Output is correct
9 Correct 29 ms 8312 KB Output is correct
10 Correct 28 ms 8440 KB Output is correct
11 Correct 28 ms 8440 KB Output is correct
12 Correct 29 ms 8440 KB Output is correct
13 Correct 29 ms 8440 KB Output is correct
14 Correct 28 ms 8440 KB Output is correct
15 Correct 29 ms 8312 KB Output is correct
16 Correct 7 ms 1784 KB Output is correct
17 Correct 7 ms 1912 KB Output is correct
18 Correct 7 ms 1784 KB Output is correct
19 Correct 7 ms 1912 KB Output is correct
20 Correct 7 ms 1912 KB Output is correct
21 Correct 129 ms 7700 KB Output is correct
22 Correct 106 ms 7800 KB Output is correct
23 Correct 103 ms 7688 KB Output is correct
24 Correct 104 ms 7544 KB Output is correct
25 Correct 106 ms 7560 KB Output is correct
26 Correct 82 ms 7488 KB Output is correct
27 Correct 86 ms 7696 KB Output is correct
28 Correct 82 ms 7416 KB Output is correct
29 Correct 85 ms 7492 KB Output is correct
30 Correct 42 ms 8312 KB Output is correct
31 Correct 42 ms 8440 KB Output is correct
32 Correct 44 ms 8488 KB Output is correct
33 Correct 39 ms 8312 KB Output is correct
34 Correct 39 ms 8312 KB Output is correct
35 Correct 40 ms 8312 KB Output is correct
36 Correct 42 ms 8440 KB Output is correct
37 Correct 40 ms 8312 KB Output is correct
38 Correct 39 ms 8312 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 2012 KB Output is correct
2 Correct 69 ms 1912 KB Output is correct
3 Correct 94 ms 1916 KB Output is correct
4 Correct 83 ms 2084 KB Output is correct
5 Correct 98 ms 1996 KB Output is correct
6 Correct 122 ms 1912 KB Output is correct
7 Correct 122 ms 2028 KB Output is correct
8 Correct 120 ms 2036 KB Output is correct
9 Correct 125 ms 1992 KB Output is correct
10 Correct 119 ms 1912 KB Output is correct
11 Correct 89 ms 2012 KB Output is correct
12 Correct 74 ms 2040 KB Output is correct
13 Correct 84 ms 1912 KB Output is correct
14 Correct 81 ms 2012 KB Output is correct
15 Correct 89 ms 2040 KB Output is correct
16 Correct 43 ms 1272 KB Output is correct
17 Correct 35 ms 1272 KB Output is correct
18 Correct 36 ms 1272 KB Output is correct
19 Correct 35 ms 1344 KB Output is correct
20 Correct 40 ms 1276 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 8440 KB Output is correct
2 Correct 28 ms 8312 KB Output is correct
3 Correct 30 ms 8328 KB Output is correct
4 Correct 29 ms 8440 KB Output is correct
5 Correct 28 ms 8312 KB Output is correct
6 Correct 30 ms 8404 KB Output is correct
7 Correct 30 ms 8396 KB Output is correct
8 Correct 29 ms 8440 KB Output is correct
9 Correct 29 ms 8312 KB Output is correct
10 Correct 28 ms 8440 KB Output is correct
11 Correct 28 ms 8440 KB Output is correct
12 Correct 29 ms 8440 KB Output is correct
13 Correct 29 ms 8440 KB Output is correct
14 Correct 28 ms 8440 KB Output is correct
15 Correct 29 ms 8312 KB Output is correct
16 Correct 7 ms 1784 KB Output is correct
17 Correct 7 ms 1912 KB Output is correct
18 Correct 7 ms 1784 KB Output is correct
19 Correct 7 ms 1912 KB Output is correct
20 Correct 7 ms 1912 KB Output is correct
21 Correct 129 ms 7700 KB Output is correct
22 Correct 106 ms 7800 KB Output is correct
23 Correct 103 ms 7688 KB Output is correct
24 Correct 104 ms 7544 KB Output is correct
25 Correct 106 ms 7560 KB Output is correct
26 Correct 82 ms 7488 KB Output is correct
27 Correct 86 ms 7696 KB Output is correct
28 Correct 82 ms 7416 KB Output is correct
29 Correct 85 ms 7492 KB Output is correct
30 Correct 42 ms 8312 KB Output is correct
31 Correct 42 ms 8440 KB Output is correct
32 Correct 44 ms 8488 KB Output is correct
33 Correct 39 ms 8312 KB Output is correct
34 Correct 39 ms 8312 KB Output is correct
35 Correct 40 ms 8312 KB Output is correct
36 Correct 42 ms 8440 KB Output is correct
37 Correct 40 ms 8312 KB Output is correct
38 Correct 39 ms 8312 KB Output is correct
39 Correct 86 ms 2012 KB Output is correct
40 Correct 69 ms 1912 KB Output is correct
41 Correct 94 ms 1916 KB Output is correct
42 Correct 83 ms 2084 KB Output is correct
43 Correct 98 ms 1996 KB Output is correct
44 Correct 122 ms 1912 KB Output is correct
45 Correct 122 ms 2028 KB Output is correct
46 Correct 120 ms 2036 KB Output is correct
47 Correct 125 ms 1992 KB Output is correct
48 Correct 119 ms 1912 KB Output is correct
49 Correct 89 ms 2012 KB Output is correct
50 Correct 74 ms 2040 KB Output is correct
51 Correct 84 ms 1912 KB Output is correct
52 Correct 81 ms 2012 KB Output is correct
53 Correct 89 ms 2040 KB Output is correct
54 Correct 43 ms 1272 KB Output is correct
55 Correct 35 ms 1272 KB Output is correct
56 Correct 36 ms 1272 KB Output is correct
57 Correct 35 ms 1344 KB Output is correct
58 Correct 40 ms 1276 KB Output is correct
59 Execution timed out 2067 ms 8312 KB Time limit exceeded
60 Halted 0 ms 0 KB -