oj.uz

답안 #310017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310017 2020-10-05T10:27:13 Z vipghn2003 Boat (APIO16_boat) C++14
58 / 100
 2000 ms 11808 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N=505;
const int mod=1e9+7;
int n,l[N],r[N],dp[N][N*2],sum[N][N*2],igt[N],gt[N],ways[N*2][N];

int Power(int x,int n)
{
    if(!n) return 1;
    if(n%2) return Power(x,n-1)*x%mod;
    int tmp=Power(x,n/2);
    return tmp*tmp%mod;
}

void init()
{
    gt[0]=1;
    for(int i=1;i<=N-5;i++) gt[i]=gt[i-1]*i%mod;
    igt[N-5]=Power(gt[N-5],mod-2);
    for(int i=N-5-1;i>=0;i--) igt[i]=igt[i+1]*(i+1)%mod;
}

int C(int k,int n)
{
    if(k<0||k>n) return 0;
    if(n<=500) return gt[n]*igt[n-k]%mod*igt[k]%mod;
    int res=igt[k];
    for(int i=n-k+1;i<=n;i++) res=res*i%mod;
    return res%mod;
}

main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    init();
    vector<int>val;
    for(int i=1;i<=n;i++)
    {
        cin>>l[i]>>r[i];
        r[i]++;
        val.push_back(l[i]);
        val.push_back(r[i]);
    }
    val.push_back(0);
    sort(val.begin(),val.end());
    val.erase(unique(val.begin(),val.end()),val.end());
    for(int i=1;i<=n;i++)
    {
        l[i]=lower_bound(val.begin(),val.end(),l[i])-val.begin();
        r[i]=lower_bound(val.begin(),val.end(),r[i])-val.begin();
    }
    int sz=val.size()-1;
    for(int i=1;i<=sz-1;i++)
    {
        for(int k=1;k<=n;k++)
        {
            int cur=C(k,val[i+1]-val[i]);
            for(int j=k;j<=n;j++) ways[i][j]=(ways[i][j]+cur*C(k-1,j-1)%mod)%mod;
        }
    }
    int res=0;
    dp[0][0]=1;
    for(int j=0;j<=sz-1;j++) sum[0][j]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=l[i];j<r[i];j++)
        {
            int cnt=0;
            for(int k=i;k>=1;k--)
            {
                if(val[l[k]]<=val[j]&&val[j+1]<=val[r[k]]);
                else cnt++;
                dp[i][j]=(dp[i][j]+sum[k-1][j-1]*ways[j][i-k+1-cnt]%mod)%mod;
            }
        }
        for(int j=1;j<=sz-1;j++)
        {
            sum[i][j]=(sum[i][j-1]+dp[i][j])%mod;
        }
        res=(res+sum[i][sz-1])%mod;
    }
    cout<<res;
}

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1729 ms 10616 KB Output is correct
2 Correct 1723 ms 10512 KB Output is correct
3 Correct 1741 ms 10320 KB Output is correct
4 Correct 1733 ms 10376 KB Output is correct
5 Correct 1727 ms 10360 KB Output is correct
6 Correct 1727 ms 10488 KB Output is correct
7 Correct 1730 ms 10608 KB Output is correct
8 Correct 1730 ms 10524 KB Output is correct
9 Correct 1735 ms 10744 KB Output is correct
10 Correct 1744 ms 10488 KB Output is correct
11 Correct 1726 ms 10360 KB Output is correct
12 Correct 1736 ms 10380 KB Output is correct
13 Correct 1720 ms 10484 KB Output is correct
14 Correct 1728 ms 10472 KB Output is correct
15 Correct 1729 ms 10424 KB Output is correct
16 Correct 304 ms 5752 KB Output is correct
17 Correct 330 ms 6008 KB Output is correct
18 Correct 324 ms 5884 KB Output is correct
19 Correct 329 ms 5912 KB Output is correct
20 Correct 322 ms 6008 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1729 ms 10616 KB Output is correct
2 Correct 1723 ms 10512 KB Output is correct
3 Correct 1741 ms 10320 KB Output is correct
4 Correct 1733 ms 10376 KB Output is correct
5 Correct 1727 ms 10360 KB Output is correct
6 Correct 1727 ms 10488 KB Output is correct
7 Correct 1730 ms 10608 KB Output is correct
8 Correct 1730 ms 10524 KB Output is correct
9 Correct 1735 ms 10744 KB Output is correct
10 Correct 1744 ms 10488 KB Output is correct
11 Correct 1726 ms 10360 KB Output is correct
12 Correct 1736 ms 10380 KB Output is correct
13 Correct 1720 ms 10484 KB Output is correct
14 Correct 1728 ms 10472 KB Output is correct
15 Correct 1729 ms 10424 KB Output is correct
16 Correct 304 ms 5752 KB Output is correct
17 Correct 330 ms 6008 KB Output is correct
18 Correct 324 ms 5884 KB Output is correct
19 Correct 329 ms 5912 KB Output is correct
20 Correct 322 ms 6008 KB Output is correct
21 Correct 1578 ms 11088 KB Output is correct
22 Correct 1598 ms 11180 KB Output is correct
23 Correct 1545 ms 11128 KB Output is correct
24 Correct 1531 ms 11140 KB Output is correct
25 Correct 1539 ms 10972 KB Output is correct
26 Correct 1601 ms 11556 KB Output is correct
27 Correct 1609 ms 11808 KB Output is correct
28 Correct 1582 ms 11592 KB Output is correct
29 Correct 1564 ms 11720 KB Output is correct
30 Correct 1669 ms 10432 KB Output is correct
31 Correct 1662 ms 10616 KB Output is correct
32 Correct 1671 ms 10360 KB Output is correct
33 Correct 1666 ms 10400 KB Output is correct
34 Correct 1659 ms 10488 KB Output is correct
35 Correct 1652 ms 10324 KB Output is correct
36 Correct 1669 ms 10376 KB Output is correct
37 Correct 1686 ms 10164 KB Output is correct
38 Correct 1682 ms 10344 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2296 KB Output is correct
2 Correct 21 ms 2176 KB Output is correct
3 Correct 21 ms 2176 KB Output is correct
4 Correct 22 ms 2304 KB Output is correct
5 Correct 21 ms 2176 KB Output is correct
6 Correct 23 ms 2176 KB Output is correct
7 Correct 23 ms 2296 KB Output is correct
8 Correct 22 ms 2176 KB Output is correct
9 Correct 22 ms 2176 KB Output is correct
10 Correct 22 ms 2176 KB Output is correct
11 Correct 20 ms 2176 KB Output is correct
12 Correct 20 ms 2176 KB Output is correct
13 Correct 21 ms 2176 KB Output is correct
14 Correct 20 ms 2176 KB Output is correct
15 Correct 20 ms 2176 KB Output is correct
16 Correct 12 ms 1792 KB Output is correct
17 Correct 11 ms 1792 KB Output is correct
18 Correct 12 ms 1792 KB Output is correct
19 Correct 12 ms 1792 KB Output is correct
20 Correct 12 ms 1664 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1729 ms 10616 KB Output is correct
2 Correct 1723 ms 10512 KB Output is correct
3 Correct 1741 ms 10320 KB Output is correct
4 Correct 1733 ms 10376 KB Output is correct
5 Correct 1727 ms 10360 KB Output is correct
6 Correct 1727 ms 10488 KB Output is correct
7 Correct 1730 ms 10608 KB Output is correct
8 Correct 1730 ms 10524 KB Output is correct
9 Correct 1735 ms 10744 KB Output is correct
10 Correct 1744 ms 10488 KB Output is correct
11 Correct 1726 ms 10360 KB Output is correct
12 Correct 1736 ms 10380 KB Output is correct
13 Correct 1720 ms 10484 KB Output is correct
14 Correct 1728 ms 10472 KB Output is correct
15 Correct 1729 ms 10424 KB Output is correct
16 Correct 304 ms 5752 KB Output is correct
17 Correct 330 ms 6008 KB Output is correct
18 Correct 324 ms 5884 KB Output is correct
19 Correct 329 ms 5912 KB Output is correct
20 Correct 322 ms 6008 KB Output is correct
21 Correct 1578 ms 11088 KB Output is correct
22 Correct 1598 ms 11180 KB Output is correct
23 Correct 1545 ms 11128 KB Output is correct
24 Correct 1531 ms 11140 KB Output is correct
25 Correct 1539 ms 10972 KB Output is correct
26 Correct 1601 ms 11556 KB Output is correct
27 Correct 1609 ms 11808 KB Output is correct
28 Correct 1582 ms 11592 KB Output is correct
29 Correct 1564 ms 11720 KB Output is correct
30 Correct 1669 ms 10432 KB Output is correct
31 Correct 1662 ms 10616 KB Output is correct
32 Correct 1671 ms 10360 KB Output is correct
33 Correct 1666 ms 10400 KB Output is correct
34 Correct 1659 ms 10488 KB Output is correct
35 Correct 1652 ms 10324 KB Output is correct
36 Correct 1669 ms 10376 KB Output is correct
37 Correct 1686 ms 10164 KB Output is correct
38 Correct 1682 ms 10344 KB Output is correct
39 Correct 21 ms 2296 KB Output is correct
40 Correct 21 ms 2176 KB Output is correct
41 Correct 21 ms 2176 KB Output is correct
42 Correct 22 ms 2304 KB Output is correct
43 Correct 21 ms 2176 KB Output is correct
44 Correct 23 ms 2176 KB Output is correct
45 Correct 23 ms 2296 KB Output is correct
46 Correct 22 ms 2176 KB Output is correct
47 Correct 22 ms 2176 KB Output is correct
48 Correct 22 ms 2176 KB Output is correct
49 Correct 20 ms 2176 KB Output is correct
50 Correct 20 ms 2176 KB Output is correct
51 Correct 21 ms 2176 KB Output is correct
52 Correct 20 ms 2176 KB Output is correct
53 Correct 20 ms 2176 KB Output is correct
54 Correct 12 ms 1792 KB Output is correct
55 Correct 11 ms 1792 KB Output is correct
56 Correct 12 ms 1792 KB Output is correct
57 Correct 12 ms 1792 KB Output is correct
58 Correct 12 ms 1664 KB Output is correct
59 Execution timed out 2084 ms 7304 KB Time limit exceeded
60 Halted 0 ms 0 KB -