oj.uz

Submission #96118

# Submission time Handle Problem Language Result Execution time Memory
96118 2019-02-06T06:58:38 Z oolimry Boat (APIO16_boat) C++14
58 / 100
 2000 ms 8512 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;
}
static long long a[505];
static long long b[505];
static long long inverse[505];
static ii ranges[1010];
static long long diff[1010];
static long long posa[505];
static long long posb[505];
static long long dp[2005][505][2];
main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);

    for(long long i = 1;i < 505;i++){
        inverse[i] = modInverse(i,mod);
    }
    int n;
    cin >> 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;

    for(int i = 0;i < m;i++){
        ranges[i] = (ii(key[i],key[i+1]-1));
    }
    sort(ranges,ranges + m);

    //cout << m << "\n";

    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";
    }

    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;
        }
    }




    //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[j][k][i] = 0ll;
            }
        }
    }


    for(int j = posa[0];j <= posb[0];j++){
        if(a[0] <= ranges[j].first && b[0] >= ranges[j].second){
            dp[j][1][0] = 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++){
                long long y = dp[j][k][ii^1];

                if(y == 0) break;
                dp[j][k][ii] = y;
                //dp[ii][j][k] %= mod;
                acc[j] += y;
                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[j][k-1][ii^1];
                    if(x == 0) break;
                    if(diff[j] - k + 1 <= 0) break;
                    x *= (diff[j] - k + 1);
                    x %= mod;
                    x *= inverse[k];
                    x %= mod;
                    dp[j][k][ii] += 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[j][1][ii] += x;
                dp[j][1][ii] %= 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[j][k][(n-1)%2];
            ans %= mod;
        }
    }
    cout << ans;

    return 0;
}

Compilation message

boat.cpp:47:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8312 KB Output is correct
2 Correct 27 ms 8312 KB Output is correct
3 Correct 29 ms 8312 KB Output is correct
4 Correct 27 ms 8312 KB Output is correct
5 Correct 30 ms 8312 KB Output is correct
6 Correct 27 ms 8312 KB Output is correct
7 Correct 26 ms 8312 KB Output is correct
8 Correct 26 ms 8312 KB Output is correct
9 Correct 29 ms 8312 KB Output is correct
10 Correct 27 ms 8312 KB Output is correct
11 Correct 26 ms 8312 KB Output is correct
12 Correct 27 ms 8440 KB Output is correct
13 Correct 28 ms 8312 KB Output is correct
14 Correct 26 ms 8312 KB Output is correct
15 Correct 32 ms 8312 KB Output is correct
16 Correct 6 ms 1784 KB Output is correct
17 Correct 6 ms 1912 KB Output is correct
18 Correct 8 ms 1784 KB Output is correct
19 Correct 7 ms 1912 KB Output is correct
20 Correct 8 ms 1912 KB Output is correct
21 Correct 90 ms 7672 KB Output is correct
22 Correct 83 ms 7676 KB Output is correct
23 Correct 84 ms 7676 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Correct 87 ms 7544 KB Output is correct
26 Correct 68 ms 7416 KB Output is correct
27 Correct 69 ms 7544 KB Output is correct
28 Correct 83 ms 7416 KB Output is correct
29 Correct 70 ms 7288 KB Output is correct
30 Correct 31 ms 8312 KB Output is correct
31 Correct 29 ms 8312 KB Output is correct
32 Correct 31 ms 8312 KB Output is correct
33 Correct 30 ms 8312 KB Output is correct
34 Correct 30 ms 8312 KB Output is correct
35 Correct 29 ms 8308 KB Output is correct
36 Correct 28 ms 8312 KB Output is correct
37 Correct 30 ms 8312 KB Output is correct
38 Correct 28 ms 8316 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2040 KB Output is correct
2 Correct 12 ms 2040 KB Output is correct
3 Correct 16 ms 2040 KB Output is correct
4 Correct 14 ms 2040 KB Output is correct
5 Correct 16 ms 1912 KB Output is correct
6 Correct 21 ms 2040 KB Output is correct
7 Correct 21 ms 1912 KB Output is correct
8 Correct 21 ms 2036 KB Output is correct
9 Correct 21 ms 1916 KB Output is correct
10 Correct 21 ms 1916 KB Output is correct
11 Correct 15 ms 2040 KB Output is correct
12 Correct 14 ms 1912 KB Output is correct
13 Correct 15 ms 1912 KB Output is correct
14 Correct 15 ms 2040 KB Output is correct
15 Correct 18 ms 2040 KB Output is correct
16 Correct 8 ms 1336 KB Output is correct
17 Correct 8 ms 1272 KB Output is correct
18 Correct 8 ms 1272 KB Output is correct
19 Correct 9 ms 1272 KB Output is correct
20 Correct 10 ms 1272 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8312 KB Output is correct
2 Correct 27 ms 8312 KB Output is correct
3 Correct 29 ms 8312 KB Output is correct
4 Correct 27 ms 8312 KB Output is correct
5 Correct 30 ms 8312 KB Output is correct
6 Correct 27 ms 8312 KB Output is correct
7 Correct 26 ms 8312 KB Output is correct
8 Correct 26 ms 8312 KB Output is correct
9 Correct 29 ms 8312 KB Output is correct
10 Correct 27 ms 8312 KB Output is correct
11 Correct 26 ms 8312 KB Output is correct
12 Correct 27 ms 8440 KB Output is correct
13 Correct 28 ms 8312 KB Output is correct
14 Correct 26 ms 8312 KB Output is correct
15 Correct 32 ms 8312 KB Output is correct
16 Correct 6 ms 1784 KB Output is correct
17 Correct 6 ms 1912 KB Output is correct
18 Correct 8 ms 1784 KB Output is correct
19 Correct 7 ms 1912 KB Output is correct
20 Correct 8 ms 1912 KB Output is correct
21 Correct 90 ms 7672 KB Output is correct
22 Correct 83 ms 7676 KB Output is correct
23 Correct 84 ms 7676 KB Output is correct
24 Correct 84 ms 7544 KB Output is correct
25 Correct 87 ms 7544 KB Output is correct
26 Correct 68 ms 7416 KB Output is correct
27 Correct 69 ms 7544 KB Output is correct
28 Correct 83 ms 7416 KB Output is correct
29 Correct 70 ms 7288 KB Output is correct
30 Correct 31 ms 8312 KB Output is correct
31 Correct 29 ms 8312 KB Output is correct
32 Correct 31 ms 8312 KB Output is correct
33 Correct 30 ms 8312 KB Output is correct
34 Correct 30 ms 8312 KB Output is correct
35 Correct 29 ms 8308 KB Output is correct
36 Correct 28 ms 8312 KB Output is correct
37 Correct 30 ms 8312 KB Output is correct
38 Correct 28 ms 8316 KB Output is correct
39 Correct 17 ms 2040 KB Output is correct
40 Correct 12 ms 2040 KB Output is correct
41 Correct 16 ms 2040 KB Output is correct
42 Correct 14 ms 2040 KB Output is correct
43 Correct 16 ms 1912 KB Output is correct
44 Correct 21 ms 2040 KB Output is correct
45 Correct 21 ms 1912 KB Output is correct
46 Correct 21 ms 2036 KB Output is correct
47 Correct 21 ms 1916 KB Output is correct
48 Correct 21 ms 1916 KB Output is correct
49 Correct 15 ms 2040 KB Output is correct
50 Correct 14 ms 1912 KB Output is correct
51 Correct 15 ms 1912 KB Output is correct
52 Correct 15 ms 2040 KB Output is correct
53 Correct 18 ms 2040 KB Output is correct
54 Correct 8 ms 1336 KB Output is correct
55 Correct 8 ms 1272 KB Output is correct
56 Correct 8 ms 1272 KB Output is correct
57 Correct 9 ms 1272 KB Output is correct
58 Correct 10 ms 1272 KB Output is correct
59 Correct 1195 ms 8396 KB Output is correct
60 Correct 1112 ms 8512 KB Output is correct
61 Correct 1087 ms 8440 KB Output is correct
62 Correct 1229 ms 8444 KB Output is correct
63 Correct 1158 ms 8440 KB Output is correct
64 Execution timed out 2064 ms 8440 KB Time limit exceeded
65 Halted 0 ms 0 KB -