Submission #258576

#	Time	Username	Problem	Language	Result	Execution time	Memory
258576		daniel920712	Boat (APIO16_boat)	C++14	9 / 100	2090 ms	7672 KiB

boat

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <time.h>

using namespace std;
long long MOD=1e9+7;
long long DP[505][2005];
long long CCon[505];
long long Con2[505];
bool use[505][2005]={0};
long long cha[2005],Con[2005],R[2005];
map < long long , long long > all;
long long N,now=0;
long long a[505],b[505];
map < long long , long long > con,r;
set < long long > have;

long long Pow(long long a,long long b)
{
    if(b==0) return 1;
    long long t=Pow(a,b/2);
    t*=t;
    t%=MOD;
    if(b%2) t*=a;
    return t%MOD;
}
long long C(long long x,long long y)
{
    return CCon[x]*Con2[y]%MOD*Con2[x-y]%MOD;
}
long long F(long long x,long long y)
{
    long long i,j,k,tt,ttt=0,aa=1;
    if(x==0) return y!=(now);
    if(use[x][y]) return DP[x][y];
    use[x][y]=1;
    DP[x][y]=F(x-1,y);
    for(i=0;i<now;i++)
    {
        ttt=0;
        if(!(cha[i]>=a[x]&&R[i]<cha[y]&&R[i]<=b[x])) continue;
        ttt=0;
        DP[x][y]+=Con[i]*F(x-1,i)%MOD;
        DP[x][y]%=MOD;
        for(j=x;j>=1;j--)
        {
            if(cha[i]>=a[j]&&R[i]<cha[y]&&R[i]<=b[j])
            {
                ttt++;
                aa=Con[i];
                for(k=2;k<=ttt;k++)
                {
                    aa*=(Con[i]-k+1);
                    aa%=MOD;
                    aa*=Pow(k,MOD-2);
                    aa%=MOD;
                    aa*=C(ttt-2,k-2);
                    aa%=MOD;
                    if(aa==0) break;
                    DP[x][y]+=aa*F(j-1,i)%MOD;
                    DP[x][y]%=MOD;

                }
            }
        }
    }
    return DP[x][y];
}

int main()
{
    //freopen("3_01.in","rt",stdin);
    long long N,M,i;
    scanf("%lld",&N);
    CCon[0]=1;
    Con2[0]=1;
    for(i=1;i<=N;i++)
    {
        CCon[i]=CCon[i-1]*i%MOD;
        Con2[i]=Pow(CCon[i],MOD-2);
    }
    for(i=1;i<=N;i++)
    {
        scanf("%lld %lld",&a[i],&b[i]);
        have.insert(a[i]);
        have.insert(a[i]+1);
        have.insert(b[i]);
        have.insert(b[i]+1);
    }
    for(auto i:have)
    {
        if(i==*prev(have.end()))
        {
            con[i]=1;
            r[i]=i;
        }
        if(have.lower_bound(i)!=have.begin())
        {
            con[*prev(have.lower_bound(i))]=i-*prev(have.lower_bound(i));
            r[*prev(have.lower_bound(i))]=i-1;
        }
    }
    for(auto i:con)
    {
        cha[now]=i.first;
        Con[now]=i.second;
        R[now]=r[i.first];
        now++;
    }
    cha[now]=1e9+5;
    Con[now]=0;
    R[now]=2e9;
    printf("%lld\n",F(N,now));


    return 0;
}
/*
2
32 47
18 78
*/

Compilation message (stderr)

boat.cpp: In function 'long long int F(long long int, long long int)':
boat.cpp:36:21: warning: unused variable 'tt' [-Wunused-variable]
     long long i,j,k,tt,ttt=0,aa=1;
                     ^~
boat.cpp: In function 'int main()':
boat.cpp:76:17: warning: unused variable 'M' [-Wunused-variable]
     long long N,M,i;
                 ^
boat.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld",&N);
     ~~~~~^~~~~~~~~~~
boat.cpp:87:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld",&a[i],&b[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42