oj.uz

답안 #624382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624382 2022-08-08T05:43:17 Z socpite Boat (APIO16_boat) C++14
58 / 100
 2000 ms 14352 KB 
#include<bits/stdc++.h>
using namespace std;

#define f first
#define s second

typedef long long ll;

const int maxn = 1005;
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[maxn];


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    inv[0] = inv[1] = 1;
    for(int i = 2; i < 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1140 ms 14172 KB Output is correct
2 Correct 1155 ms 14092 KB Output is correct
3 Correct 1153 ms 14100 KB Output is correct
4 Correct 1168 ms 14176 KB Output is correct
5 Correct 1149 ms 14092 KB Output is correct
6 Correct 1153 ms 14352 KB Output is correct
7 Correct 1167 ms 14088 KB Output is correct
8 Correct 1173 ms 14092 KB Output is correct
9 Correct 1151 ms 14136 KB Output is correct
10 Correct 1151 ms 14136 KB Output is correct
11 Correct 1168 ms 14268 KB Output is correct
12 Correct 1145 ms 14176 KB Output is correct
13 Correct 1140 ms 14076 KB Output is correct
14 Correct 1158 ms 14176 KB Output is correct
15 Correct 1149 ms 14172 KB Output is correct
16 Correct 204 ms 4384 KB Output is correct
17 Correct 225 ms 4560 KB Output is correct
18 Correct 212 ms 4468 KB Output is correct
19 Correct 222 ms 4560 KB Output is correct
20 Correct 217 ms 4520 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1140 ms 14172 KB Output is correct
2 Correct 1155 ms 14092 KB Output is correct
3 Correct 1153 ms 14100 KB Output is correct
4 Correct 1168 ms 14176 KB Output is correct
5 Correct 1149 ms 14092 KB Output is correct
6 Correct 1153 ms 14352 KB Output is correct
7 Correct 1167 ms 14088 KB Output is correct
8 Correct 1173 ms 14092 KB Output is correct
9 Correct 1151 ms 14136 KB Output is correct
10 Correct 1151 ms 14136 KB Output is correct
11 Correct 1168 ms 14268 KB Output is correct
12 Correct 1145 ms 14176 KB Output is correct
13 Correct 1140 ms 14076 KB Output is correct
14 Correct 1158 ms 14176 KB Output is correct
15 Correct 1149 ms 14172 KB Output is correct
16 Correct 204 ms 4384 KB Output is correct
17 Correct 225 ms 4560 KB Output is correct
18 Correct 212 ms 4468 KB Output is correct
19 Correct 222 ms 4560 KB Output is correct
20 Correct 217 ms 4520 KB Output is correct
21 Correct 316 ms 13092 KB Output is correct
22 Correct 301 ms 13116 KB Output is correct
23 Correct 294 ms 13000 KB Output is correct
24 Correct 302 ms 12880 KB Output is correct
25 Correct 310 ms 12904 KB Output is correct
26 Correct 334 ms 12636 KB Output is correct
27 Correct 329 ms 12784 KB Output is correct
28 Correct 331 ms 12596 KB Output is correct
29 Correct 324 ms 12620 KB Output is correct
30 Correct 1084 ms 14088 KB Output is correct
31 Correct 1082 ms 14124 KB Output is correct
32 Correct 1087 ms 14152 KB Output is correct
33 Correct 1105 ms 14052 KB Output is correct
34 Correct 1088 ms 14060 KB Output is correct
35 Correct 1071 ms 14092 KB Output is correct
36 Correct 1089 ms 14040 KB Output is correct
37 Correct 1092 ms 14088 KB Output is correct
38 Correct 1074 ms 14140 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 1832 KB Output is correct
2 Correct 21 ms 1764 KB Output is correct
3 Correct 21 ms 1848 KB Output is correct
4 Correct 23 ms 1876 KB Output is correct
5 Correct 22 ms 1844 KB Output is correct
6 Correct 22 ms 1824 KB Output is correct
7 Correct 22 ms 1876 KB Output is correct
8 Correct 22 ms 1876 KB Output is correct
9 Correct 22 ms 1796 KB Output is correct
10 Correct 23 ms 2000 KB Output is correct
11 Correct 23 ms 1748 KB Output is correct
12 Correct 21 ms 1788 KB Output is correct
13 Correct 21 ms 1768 KB Output is correct
14 Correct 20 ms 1776 KB Output is correct
15 Correct 21 ms 1748 KB Output is correct
16 Correct 10 ms 1364 KB Output is correct
17 Correct 10 ms 1320 KB Output is correct
18 Correct 10 ms 1264 KB Output is correct
19 Correct 9 ms 1492 KB Output is correct
20 Correct 10 ms 1364 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1140 ms 14172 KB Output is correct
2 Correct 1155 ms 14092 KB Output is correct
3 Correct 1153 ms 14100 KB Output is correct
4 Correct 1168 ms 14176 KB Output is correct
5 Correct 1149 ms 14092 KB Output is correct
6 Correct 1153 ms 14352 KB Output is correct
7 Correct 1167 ms 14088 KB Output is correct
8 Correct 1173 ms 14092 KB Output is correct
9 Correct 1151 ms 14136 KB Output is correct
10 Correct 1151 ms 14136 KB Output is correct
11 Correct 1168 ms 14268 KB Output is correct
12 Correct 1145 ms 14176 KB Output is correct
13 Correct 1140 ms 14076 KB Output is correct
14 Correct 1158 ms 14176 KB Output is correct
15 Correct 1149 ms 14172 KB Output is correct
16 Correct 204 ms 4384 KB Output is correct
17 Correct 225 ms 4560 KB Output is correct
18 Correct 212 ms 4468 KB Output is correct
19 Correct 222 ms 4560 KB Output is correct
20 Correct 217 ms 4520 KB Output is correct
21 Correct 316 ms 13092 KB Output is correct
22 Correct 301 ms 13116 KB Output is correct
23 Correct 294 ms 13000 KB Output is correct
24 Correct 302 ms 12880 KB Output is correct
25 Correct 310 ms 12904 KB Output is correct
26 Correct 334 ms 12636 KB Output is correct
27 Correct 329 ms 12784 KB Output is correct
28 Correct 331 ms 12596 KB Output is correct
29 Correct 324 ms 12620 KB Output is correct
30 Correct 1084 ms 14088 KB Output is correct
31 Correct 1082 ms 14124 KB Output is correct
32 Correct 1087 ms 14152 KB Output is correct
33 Correct 1105 ms 14052 KB Output is correct
34 Correct 1088 ms 14060 KB Output is correct
35 Correct 1071 ms 14092 KB Output is correct
36 Correct 1089 ms 14040 KB Output is correct
37 Correct 1092 ms 14088 KB Output is correct
38 Correct 1074 ms 14140 KB Output is correct
39 Correct 21 ms 1832 KB Output is correct
40 Correct 21 ms 1764 KB Output is correct
41 Correct 21 ms 1848 KB Output is correct
42 Correct 23 ms 1876 KB Output is correct
43 Correct 22 ms 1844 KB Output is correct
44 Correct 22 ms 1824 KB Output is correct
45 Correct 22 ms 1876 KB Output is correct
46 Correct 22 ms 1876 KB Output is correct
47 Correct 22 ms 1796 KB Output is correct
48 Correct 23 ms 2000 KB Output is correct
49 Correct 23 ms 1748 KB Output is correct
50 Correct 21 ms 1788 KB Output is correct
51 Correct 21 ms 1768 KB Output is correct
52 Correct 20 ms 1776 KB Output is correct
53 Correct 21 ms 1748 KB Output is correct
54 Correct 10 ms 1364 KB Output is correct
55 Correct 10 ms 1320 KB Output is correct
56 Correct 10 ms 1264 KB Output is correct
57 Correct 9 ms 1492 KB Output is correct
58 Correct 10 ms 1364 KB Output is correct
59 Execution timed out 2091 ms 7532 KB Time limit exceeded
60 Halted 0 ms 0 KB -