oj.uz

답안 #153028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
153028 2019-09-11T13:58:56 Z arnold518 Boat (APIO16_boat) C++14
31 / 100
 993 ms 14588 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1000;
const ll MOD = 1e9+7;

int N, S, A[MAXN+10], B[MAXN+10];
vector<int> comp;

ll inv[MAXN+10], bino[MAXN+10][MAXN+10], comb[MAXN+10], f[MAXN+10];
ll dp[MAXN+10][MAXN+10], ans;

int getcomp(int x) { return lower_bound(comp.begin(), comp.end(), x)-comp.begin(); }

ll mypow(ll x, ll y)
{
    if(y==0) return 1;
    if(y%2) return mypow(x, y-1)*x%MOD;
    ll t=mypow(x, y/2);
    return t*t%MOD;
}

int main()
{
    int i, j, k;
    bino[0][0]=1;
    for(i=1; i<=MAXN; i++) for(j=0; j<=i; j++)
    {
        if(j==0 || j==i) bino[i][j]=1;
        else bino[i][j]=(bino[i-1][j]+bino[i-1][j-1])%MOD;
    }

    inv[0]=1;
    for(i=1; i<=MAXN; i++) inv[i]=mypow(i, MOD-2);

    scanf("%d", &N);
    for(i=1; i<=N; i++)
    {
        scanf("%d%d", &A[i], &B[i]); B[i]++;
        comp.push_back(A[i]);
        comp.push_back(B[i]);
    }
    comp.push_back(0);
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    S=comp.size()-2;

    ll a=comp[2]-comp[1];

    memset(comb, 0, sizeof(comb)); memset(f, 0, sizeof(f));
    comb[0]=1;
    for(j=1; j<=a; j++) comb[j]=comb[j-1]*(a-j+1)%MOD*inv[j]%MOD;
    for(j=1; j<=N; j++)
    {
        for(k=1; k<=j; k++)
        {
            f[j]+=comb[k]*bino[j-1][k-1]%MOD;
            f[j]%=MOD;
        }
    }

    int cnt=0;
    for(i=1; i<=N; i++)
    {
        if(!(A[i]<=comp[1] && comp[1]<B[i])) continue;
        cnt++;
        dp[i][1]=f[cnt];
    }
    dp[0][1]=1;

    for(i=2; i<=S; i++)
    {
        dp[0][i]=1;
        a=comp[i+1]-comp[i];

        memset(comb, 0, sizeof(comb)); memset(f, 0, sizeof(f));
        comb[0]=1;
        for(j=1; j<=min(600ll, a); j++) comb[j]=comb[j-1]*(a-j+1)%MOD*inv[j]%MOD;
        for(j=1; j<=N; j++)
        {
            for(k=1; k<=j; k++)
            {
                f[j]+=comb[k]*bino[j-1][k-1]%MOD;
                f[j]%=MOD;
            }
        }

        for(j=1; j<=N; j++)
        {
            if(!(A[j]<=comp[i] && comp[i]<B[j])) { dp[j][i]=dp[j][i-1]; continue; }
            int cnt=1;
            for(k=j-1; k>=0; k--)
            {
                dp[j][i]+=f[cnt]*dp[k][i-1]%MOD;
                dp[j][i]%=MOD;
                if(A[k]<=comp[i] && comp[i]<B[k]) cnt++;
            }
            dp[j][i]+=dp[j][i-1]; dp[j][i]%=MOD;
        }
    }

    //for(i=1; i<=N; i++) { for(j=1; j<=S; j++) printf("%lld ", dp[i][j]-dp[i][j-1]); printf("\n"); }
    for(i=1; i<=N; i++) ans+=dp[i][S], ans%=MOD;
    printf("%lld", ans);
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &N);
     ~~~~~^~~~~~~~~~
boat.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i], &B[i]); B[i]++;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 732 ms 11472 KB Output is correct
2 Correct 726 ms 11340 KB Output is correct
3 Correct 727 ms 11400 KB Output is correct
4 Correct 726 ms 11384 KB Output is correct
5 Correct 731 ms 11356 KB Output is correct
6 Correct 741 ms 11392 KB Output is correct
7 Correct 734 ms 11356 KB Output is correct
8 Correct 728 ms 11392 KB Output is correct
9 Correct 728 ms 11296 KB Output is correct
10 Correct 726 ms 11396 KB Output is correct
11 Correct 725 ms 11312 KB Output is correct
12 Correct 725 ms 11256 KB Output is correct
13 Correct 742 ms 11256 KB Output is correct
14 Correct 730 ms 11324 KB Output is correct
15 Correct 728 ms 11324 KB Output is correct
16 Correct 138 ms 9976 KB Output is correct
17 Correct 148 ms 10104 KB Output is correct
18 Correct 142 ms 9976 KB Output is correct
19 Correct 152 ms 10032 KB Output is correct
20 Correct 148 ms 10132 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 732 ms 11472 KB Output is correct
2 Correct 726 ms 11340 KB Output is correct
3 Correct 727 ms 11400 KB Output is correct
4 Correct 726 ms 11384 KB Output is correct
5 Correct 731 ms 11356 KB Output is correct
6 Correct 741 ms 11392 KB Output is correct
7 Correct 734 ms 11356 KB Output is correct
8 Correct 728 ms 11392 KB Output is correct
9 Correct 728 ms 11296 KB Output is correct
10 Correct 726 ms 11396 KB Output is correct
11 Correct 725 ms 11312 KB Output is correct
12 Correct 725 ms 11256 KB Output is correct
13 Correct 742 ms 11256 KB Output is correct
14 Correct 730 ms 11324 KB Output is correct
15 Correct 728 ms 11324 KB Output is correct
16 Correct 138 ms 9976 KB Output is correct
17 Correct 148 ms 10104 KB Output is correct
18 Correct 142 ms 9976 KB Output is correct
19 Correct 152 ms 10032 KB Output is correct
20 Correct 148 ms 10132 KB Output is correct
21 Correct 897 ms 11260 KB Output is correct
22 Correct 903 ms 11528 KB Output is correct
23 Correct 868 ms 11516 KB Output is correct
24 Correct 876 ms 11312 KB Output is correct
25 Correct 876 ms 11328 KB Output is correct
26 Correct 977 ms 11384 KB Output is correct
27 Correct 993 ms 11432 KB Output is correct
28 Correct 967 ms 11312 KB Output is correct
29 Correct 959 ms 11484 KB Output is correct
30 Correct 727 ms 11320 KB Output is correct
31 Correct 728 ms 11372 KB Output is correct
32 Correct 726 ms 11440 KB Output is correct
33 Correct 733 ms 11392 KB Output is correct
34 Correct 753 ms 11360 KB Output is correct
35 Correct 729 ms 11228 KB Output is correct
36 Correct 727 ms 11312 KB Output is correct
37 Correct 732 ms 11404 KB Output is correct
38 Correct 752 ms 11380 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 21 ms 14588 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 732 ms 11472 KB Output is correct
2 Correct 726 ms 11340 KB Output is correct
3 Correct 727 ms 11400 KB Output is correct
4 Correct 726 ms 11384 KB Output is correct
5 Correct 731 ms 11356 KB Output is correct
6 Correct 741 ms 11392 KB Output is correct
7 Correct 734 ms 11356 KB Output is correct
8 Correct 728 ms 11392 KB Output is correct
9 Correct 728 ms 11296 KB Output is correct
10 Correct 726 ms 11396 KB Output is correct
11 Correct 725 ms 11312 KB Output is correct
12 Correct 725 ms 11256 KB Output is correct
13 Correct 742 ms 11256 KB Output is correct
14 Correct 730 ms 11324 KB Output is correct
15 Correct 728 ms 11324 KB Output is correct
16 Correct 138 ms 9976 KB Output is correct
17 Correct 148 ms 10104 KB Output is correct
18 Correct 142 ms 9976 KB Output is correct
19 Correct 152 ms 10032 KB Output is correct
20 Correct 148 ms 10132 KB Output is correct
21 Correct 897 ms 11260 KB Output is correct
22 Correct 903 ms 11528 KB Output is correct
23 Correct 868 ms 11516 KB Output is correct
24 Correct 876 ms 11312 KB Output is correct
25 Correct 876 ms 11328 KB Output is correct
26 Correct 977 ms 11384 KB Output is correct
27 Correct 993 ms 11432 KB Output is correct
28 Correct 967 ms 11312 KB Output is correct
29 Correct 959 ms 11484 KB Output is correct
30 Correct 727 ms 11320 KB Output is correct
31 Correct 728 ms 11372 KB Output is correct
32 Correct 726 ms 11440 KB Output is correct
33 Correct 733 ms 11392 KB Output is correct
34 Correct 753 ms 11360 KB Output is correct
35 Correct 729 ms 11228 KB Output is correct
36 Correct 727 ms 11312 KB Output is correct
37 Correct 732 ms 11404 KB Output is correct
38 Correct 752 ms 11380 KB Output is correct
39 Runtime error 21 ms 14588 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Halted 0 ms 0 KB -