oj.uz

Submission #624384

# Submission time Handle Problem Language Result Execution time Memory
624384 2022-08-08T05:45:13 Z socpite Boat (APIO16_boat) C++14
58 / 100
 2000 ms 8416 KB 
#include<bits/stdc++.h>
using namespace std;

#define f first
#define s second

typedef long long ll;

const int maxn = 505;
const int mod = 1e9+7;

int n;

pair<int, int> A[maxn];
vector<int> cp;

ll dp[maxn][2*maxn], pc[2*maxn][maxn], inv[2*maxn];


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    inv[0] = inv[1] = 1;
    for(int i = 2; i < 2*maxn; i++)inv[i]=mod - inv[mod%i]*(mod/i)%mod;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> A[i].f >> A[i].s;
        cp.push_back(A[i].f-1);
        cp.push_back(A[i].s);
    }
    cp.push_back(0);
    sort(cp.begin(), cp.end());
    cp.erase(unique(cp.begin(), cp.end()), cp.end());
    for(int i = 1; i < cp.size(); i++){
        ll len = cp[i]-cp[i-1];
        pc[i][1] = len;
        for(int j = 2; j <= n; j++){
            ll crr = len*(len-1)/2;
          	ll sum = 0;
            crr%=mod;
            for(int k = 2; k <= min({n, int(len), j}); k++){
                sum += crr;
                // C(k-2, j-2)*C(k, len)
                if(sum >= mod)sum-=mod;
                crr=crr*(j-k)%mod*inv[k-1]%mod*(len-k)%mod*inv[k+1]%mod;
            }
          	pc[i][j]=sum;
        }
    }
    for(int i = 0; i < cp.size(); i++)dp[0][i]=1;
    for(int i = 0; i <= n; i++)dp[i][0]=1;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j < cp.size(); j++){
            if(A[i].f > cp[j] || A[i].s <= cp[j-1])dp[i][j]=0;
            else{
                int cnt = 0;
                for(int k = i; k > 0; k--){
                    if(A[k].s >= cp[j] && A[k].f <= cp[j-1]+1){
                        cnt++;
                        dp[i][j]+=dp[k-1][j-1]*pc[j][cnt]%mod;
                        if(dp[i][j] >= mod)dp[i][j]-=mod;
                      	if(dp[i][j] < 0)dp[i][j]+=mod;
                    }
                }
            }
            //cout << i << " " << j << " " << dp[i][j] << endl;
            dp[i][j]+=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
            dp[i][j]%=mod;
        }
    }
    ll ans = dp[n][cp.size()-1]-1;
    ans%=mod;
    if(ans < 0)ans+=mod;
    cout << ans;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:35:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 1; i < cp.size(); i++){
      |                    ~~^~~~~~~~~~~
boat.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0; i < cp.size(); i++)dp[0][i]=1;
      |                    ~~^~~~~~~~~~~
boat.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for(int j = 1; j < cp.size(); j++){
      |                        ~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1185 ms 8260 KB Output is correct
2 Correct 1165 ms 8288 KB Output is correct
3 Correct 1166 ms 8196 KB Output is correct
4 Correct 1173 ms 8208 KB Output is correct
5 Correct 1163 ms 8416 KB Output is correct
6 Correct 1174 ms 8172 KB Output is correct
7 Correct 1152 ms 8248 KB Output is correct
8 Correct 1162 ms 8208 KB Output is correct
9 Correct 1152 ms 8256 KB Output is correct
10 Correct 1169 ms 8144 KB Output is correct
11 Correct 1160 ms 8200 KB Output is correct
12 Correct 1149 ms 8260 KB Output is correct
13 Correct 1159 ms 8140 KB Output is correct
14 Correct 1167 ms 8184 KB Output is correct
15 Correct 1163 ms 8192 KB Output is correct
16 Correct 205 ms 3676 KB Output is correct
17 Correct 224 ms 3724 KB Output is correct
18 Correct 218 ms 3776 KB Output is correct
19 Correct 220 ms 3788 KB Output is correct
20 Correct 212 ms 3732 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1185 ms 8260 KB Output is correct
2 Correct 1165 ms 8288 KB Output is correct
3 Correct 1166 ms 8196 KB Output is correct
4 Correct 1173 ms 8208 KB Output is correct
5 Correct 1163 ms 8416 KB Output is correct
6 Correct 1174 ms 8172 KB Output is correct
7 Correct 1152 ms 8248 KB Output is correct
8 Correct 1162 ms 8208 KB Output is correct
9 Correct 1152 ms 8256 KB Output is correct
10 Correct 1169 ms 8144 KB Output is correct
11 Correct 1160 ms 8200 KB Output is correct
12 Correct 1149 ms 8260 KB Output is correct
13 Correct 1159 ms 8140 KB Output is correct
14 Correct 1167 ms 8184 KB Output is correct
15 Correct 1163 ms 8192 KB Output is correct
16 Correct 205 ms 3676 KB Output is correct
17 Correct 224 ms 3724 KB Output is correct
18 Correct 218 ms 3776 KB Output is correct
19 Correct 220 ms 3788 KB Output is correct
20 Correct 212 ms 3732 KB Output is correct
21 Correct 350 ms 7984 KB Output is correct
22 Correct 296 ms 7876 KB Output is correct
23 Correct 279 ms 7856 KB Output is correct
24 Correct 348 ms 7840 KB Output is correct
25 Correct 322 ms 7860 KB Output is correct
26 Correct 332 ms 7728 KB Output is correct
27 Correct 308 ms 7796 KB Output is correct
28 Correct 321 ms 7804 KB Output is correct
29 Correct 331 ms 7744 KB Output is correct
30 Correct 1130 ms 8152 KB Output is correct
31 Correct 1121 ms 8272 KB Output is correct
32 Correct 1102 ms 8168 KB Output is correct
33 Correct 1136 ms 8264 KB Output is correct
34 Correct 1121 ms 8256 KB Output is correct
35 Correct 1096 ms 8232 KB Output is correct
36 Correct 1116 ms 8204 KB Output is correct
37 Correct 1102 ms 8136 KB Output is correct
38 Correct 1140 ms 8236 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1620 KB Output is correct
2 Correct 21 ms 1660 KB Output is correct
3 Correct 22 ms 1604 KB Output is correct
4 Correct 22 ms 1644 KB Output is correct
5 Correct 22 ms 1612 KB Output is correct
6 Correct 24 ms 1556 KB Output is correct
7 Correct 24 ms 1648 KB Output is correct
8 Correct 23 ms 1620 KB Output is correct
9 Correct 22 ms 1592 KB Output is correct
10 Correct 22 ms 1612 KB Output is correct
11 Correct 22 ms 1712 KB Output is correct
12 Correct 21 ms 1596 KB Output is correct
13 Correct 23 ms 1616 KB Output is correct
14 Correct 22 ms 1612 KB Output is correct
15 Correct 23 ms 1564 KB Output is correct
16 Correct 11 ms 1236 KB Output is correct
17 Correct 10 ms 1236 KB Output is correct
18 Correct 10 ms 1260 KB Output is correct
19 Correct 10 ms 1236 KB Output is correct
20 Correct 10 ms 1248 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1185 ms 8260 KB Output is correct
2 Correct 1165 ms 8288 KB Output is correct
3 Correct 1166 ms 8196 KB Output is correct
4 Correct 1173 ms 8208 KB Output is correct
5 Correct 1163 ms 8416 KB Output is correct
6 Correct 1174 ms 8172 KB Output is correct
7 Correct 1152 ms 8248 KB Output is correct
8 Correct 1162 ms 8208 KB Output is correct
9 Correct 1152 ms 8256 KB Output is correct
10 Correct 1169 ms 8144 KB Output is correct
11 Correct 1160 ms 8200 KB Output is correct
12 Correct 1149 ms 8260 KB Output is correct
13 Correct 1159 ms 8140 KB Output is correct
14 Correct 1167 ms 8184 KB Output is correct
15 Correct 1163 ms 8192 KB Output is correct
16 Correct 205 ms 3676 KB Output is correct
17 Correct 224 ms 3724 KB Output is correct
18 Correct 218 ms 3776 KB Output is correct
19 Correct 220 ms 3788 KB Output is correct
20 Correct 212 ms 3732 KB Output is correct
21 Correct 350 ms 7984 KB Output is correct
22 Correct 296 ms 7876 KB Output is correct
23 Correct 279 ms 7856 KB Output is correct
24 Correct 348 ms 7840 KB Output is correct
25 Correct 322 ms 7860 KB Output is correct
26 Correct 332 ms 7728 KB Output is correct
27 Correct 308 ms 7796 KB Output is correct
28 Correct 321 ms 7804 KB Output is correct
29 Correct 331 ms 7744 KB Output is correct
30 Correct 1130 ms 8152 KB Output is correct
31 Correct 1121 ms 8272 KB Output is correct
32 Correct 1102 ms 8168 KB Output is correct
33 Correct 1136 ms 8264 KB Output is correct
34 Correct 1121 ms 8256 KB Output is correct
35 Correct 1096 ms 8232 KB Output is correct
36 Correct 1116 ms 8204 KB Output is correct
37 Correct 1102 ms 8136 KB Output is correct
38 Correct 1140 ms 8236 KB Output is correct
39 Correct 22 ms 1620 KB Output is correct
40 Correct 21 ms 1660 KB Output is correct
41 Correct 22 ms 1604 KB Output is correct
42 Correct 22 ms 1644 KB Output is correct
43 Correct 22 ms 1612 KB Output is correct
44 Correct 24 ms 1556 KB Output is correct
45 Correct 24 ms 1648 KB Output is correct
46 Correct 23 ms 1620 KB Output is correct
47 Correct 22 ms 1592 KB Output is correct
48 Correct 22 ms 1612 KB Output is correct
49 Correct 22 ms 1712 KB Output is correct
50 Correct 21 ms 1596 KB Output is correct
51 Correct 23 ms 1616 KB Output is correct
52 Correct 22 ms 1612 KB Output is correct
53 Correct 23 ms 1564 KB Output is correct
54 Correct 11 ms 1236 KB Output is correct
55 Correct 10 ms 1236 KB Output is correct
56 Correct 10 ms 1260 KB Output is correct
57 Correct 10 ms 1236 KB Output is correct
58 Correct 10 ms 1248 KB Output is correct
59 Execution timed out 2081 ms 3852 KB Time limit exceeded
60 Halted 0 ms 0 KB -