답안 #96119 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96119	2019-02-06T07:13:10 Z	oolimry	Boat (APIO16_boat)	C++14	58 / 100	2000 ms	7328 KB

boat

#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];
static long long acc[1010];
main()
{
   //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    for(long long i = 1;i < 505;i++){
        inverse[i] = modInverse(i,mod);
    }
    int n;
    cin >> n;


    vector<long long> s;
    for(int i = 0;i < n;i++){
        cin >> a[i] >> b[i];
        s.push_back(a[i]);
        s.push_back(b[i]+1);
    }
    //cout << s.size() << endl;
    sort(s.begin(),s.end());
    s.erase(unique(s.begin(),s.end()),s.end());
    vector<long long> key;
    for(int i = 0;i < s.size();i++){
        key.push_back(s[i]);
    }
    //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++){
        dp[j][1][0] = diff[j];
    }

    for(int i = 1;i < n;i++){

        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:48:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
boat.cpp: In function 'int main()':
boat.cpp:70:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < s.size();i++){
                   ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	2424 KB	Output is correct
2	Correct	23 ms	2424 KB	Output is correct
3	Correct	25 ms	2396 KB	Output is correct
4	Correct	24 ms	2424 KB	Output is correct
5	Correct	23 ms	2480 KB	Output is correct
6	Correct	25 ms	2512 KB	Output is correct
7	Correct	23 ms	2424 KB	Output is correct
8	Correct	29 ms	2552 KB	Output is correct
9	Correct	24 ms	2424 KB	Output is correct
10	Correct	24 ms	2460 KB	Output is correct
11	Correct	25 ms	2512 KB	Output is correct
12	Correct	23 ms	2424 KB	Output is correct
13	Correct	27 ms	2480 KB	Output is correct
14	Correct	23 ms	2424 KB	Output is correct
15	Correct	25 ms	2372 KB	Output is correct
16	Correct	6 ms	760 KB	Output is correct
17	Correct	6 ms	828 KB	Output is correct
18	Correct	6 ms	760 KB	Output is correct
19	Correct	6 ms	760 KB	Output is correct
20	Correct	6 ms	760 KB	Output is correct

Subtask #2
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	2424 KB	Output is correct
2	Correct	23 ms	2424 KB	Output is correct
3	Correct	25 ms	2396 KB	Output is correct
4	Correct	24 ms	2424 KB	Output is correct
5	Correct	23 ms	2480 KB	Output is correct
6	Correct	25 ms	2512 KB	Output is correct
7	Correct	23 ms	2424 KB	Output is correct
8	Correct	29 ms	2552 KB	Output is correct
9	Correct	24 ms	2424 KB	Output is correct
10	Correct	24 ms	2460 KB	Output is correct
11	Correct	25 ms	2512 KB	Output is correct
12	Correct	23 ms	2424 KB	Output is correct
13	Correct	27 ms	2480 KB	Output is correct
14	Correct	23 ms	2424 KB	Output is correct
15	Correct	25 ms	2372 KB	Output is correct
16	Correct	6 ms	760 KB	Output is correct
17	Correct	6 ms	828 KB	Output is correct
18	Correct	6 ms	760 KB	Output is correct
19	Correct	6 ms	760 KB	Output is correct
20	Correct	6 ms	760 KB	Output is correct
21	Correct	84 ms	4088 KB	Output is correct
22	Correct	81 ms	4216 KB	Output is correct
23	Correct	82 ms	4088 KB	Output is correct
24	Correct	84 ms	4220 KB	Output is correct
25	Correct	83 ms	4088 KB	Output is correct
26	Correct	65 ms	4036 KB	Output is correct
27	Correct	69 ms	4088 KB	Output is correct
28	Correct	67 ms	3960 KB	Output is correct
29	Correct	70 ms	3960 KB	Output is correct
30	Correct	28 ms	4344 KB	Output is correct
31	Correct	28 ms	4344 KB	Output is correct
32	Correct	30 ms	4344 KB	Output is correct
33	Correct	30 ms	4472 KB	Output is correct
34	Correct	29 ms	4344 KB	Output is correct
35	Correct	28 ms	4472 KB	Output is correct
36	Correct	27 ms	4476 KB	Output is correct
37	Correct	27 ms	4344 KB	Output is correct
38	Correct	27 ms	4472 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	1272 KB	Output is correct
2	Correct	11 ms	1276 KB	Output is correct
3	Correct	13 ms	1272 KB	Output is correct
4	Correct	15 ms	1272 KB	Output is correct
5	Correct	14 ms	1272 KB	Output is correct
6	Correct	21 ms	1364 KB	Output is correct
7	Correct	20 ms	1272 KB	Output is correct
8	Correct	21 ms	1400 KB	Output is correct
9	Correct	21 ms	1400 KB	Output is correct
10	Correct	21 ms	1272 KB	Output is correct
11	Correct	15 ms	1272 KB	Output is correct
12	Correct	14 ms	1272 KB	Output is correct
13	Correct	16 ms	1272 KB	Output is correct
14	Correct	14 ms	1272 KB	Output is correct
15	Correct	15 ms	1244 KB	Output is correct
16	Correct	8 ms	892 KB	Output is correct
17	Correct	8 ms	888 KB	Output is correct
18	Correct	7 ms	888 KB	Output is correct
19	Correct	7 ms	888 KB	Output is correct
20	Correct	8 ms	888 KB	Output is correct

Subtask #4
0 / 42.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	2424 KB	Output is correct
2	Correct	23 ms	2424 KB	Output is correct
3	Correct	25 ms	2396 KB	Output is correct
4	Correct	24 ms	2424 KB	Output is correct
5	Correct	23 ms	2480 KB	Output is correct
6	Correct	25 ms	2512 KB	Output is correct
7	Correct	23 ms	2424 KB	Output is correct
8	Correct	29 ms	2552 KB	Output is correct
9	Correct	24 ms	2424 KB	Output is correct
10	Correct	24 ms	2460 KB	Output is correct
11	Correct	25 ms	2512 KB	Output is correct
12	Correct	23 ms	2424 KB	Output is correct
13	Correct	27 ms	2480 KB	Output is correct
14	Correct	23 ms	2424 KB	Output is correct
15	Correct	25 ms	2372 KB	Output is correct
16	Correct	6 ms	760 KB	Output is correct
17	Correct	6 ms	828 KB	Output is correct
18	Correct	6 ms	760 KB	Output is correct
19	Correct	6 ms	760 KB	Output is correct
20	Correct	6 ms	760 KB	Output is correct
21	Correct	84 ms	4088 KB	Output is correct
22	Correct	81 ms	4216 KB	Output is correct
23	Correct	82 ms	4088 KB	Output is correct
24	Correct	84 ms	4220 KB	Output is correct
25	Correct	83 ms	4088 KB	Output is correct
26	Correct	65 ms	4036 KB	Output is correct
27	Correct	69 ms	4088 KB	Output is correct
28	Correct	67 ms	3960 KB	Output is correct
29	Correct	70 ms	3960 KB	Output is correct
30	Correct	28 ms	4344 KB	Output is correct
31	Correct	28 ms	4344 KB	Output is correct
32	Correct	30 ms	4344 KB	Output is correct
33	Correct	30 ms	4472 KB	Output is correct
34	Correct	29 ms	4344 KB	Output is correct
35	Correct	28 ms	4472 KB	Output is correct
36	Correct	27 ms	4476 KB	Output is correct
37	Correct	27 ms	4344 KB	Output is correct
38	Correct	27 ms	4472 KB	Output is correct
39	Correct	14 ms	1272 KB	Output is correct
40	Correct	11 ms	1276 KB	Output is correct
41	Correct	13 ms	1272 KB	Output is correct
42	Correct	15 ms	1272 KB	Output is correct
43	Correct	14 ms	1272 KB	Output is correct
44	Correct	21 ms	1364 KB	Output is correct
45	Correct	20 ms	1272 KB	Output is correct
46	Correct	21 ms	1400 KB	Output is correct
47	Correct	21 ms	1400 KB	Output is correct
48	Correct	21 ms	1272 KB	Output is correct
49	Correct	15 ms	1272 KB	Output is correct
50	Correct	14 ms	1272 KB	Output is correct
51	Correct	16 ms	1272 KB	Output is correct
52	Correct	14 ms	1272 KB	Output is correct
53	Correct	15 ms	1244 KB	Output is correct
54	Correct	8 ms	892 KB	Output is correct
55	Correct	8 ms	888 KB	Output is correct
56	Correct	7 ms	888 KB	Output is correct
57	Correct	7 ms	888 KB	Output is correct
58	Correct	8 ms	888 KB	Output is correct
59	Correct	1205 ms	7196 KB	Output is correct
60	Correct	1111 ms	7016 KB	Output is correct
61	Correct	1111 ms	7024 KB	Output is correct
62	Correct	1219 ms	7032 KB	Output is correct
63	Correct	1163 ms	7160 KB	Output is correct
64	Execution timed out	2071 ms	7328 KB	Time limit exceeded
65	Halted	0 ms	0 KB	-

답안 #96119

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 22.0 / 22.0

Subtask #3 27.0 / 27.0

Subtask #4 0 / 42.0

Subtask #1
9.0 / 9.0

Subtask #2
22.0 / 22.0

Subtask #3
27.0 / 27.0

Subtask #4
0 / 42.0