oj.uz

Submission #259001

# Submission time Handle Problem Language Result Execution time Memory
259001 2020-08-07T01:16:55 Z daniel920712 Boat (APIO16_boat) C++14
9 / 100
 2000 ms 7460 KB 
#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];
long long xxx[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<y;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*=xxx[k];
                    aa%=MOD;
                    if(aa==0) break;
                    DP[x][y]+=aa*C(ttt-2,k-2)%MOD*F(j-1,i)%MOD;
                    DP[x][y]%=MOD;
                }
            }
        }

    }
    return DP[x][y];
}

int main()
{
    long long N,M,i;
    scanf("%lld",&N);
    CCon[0]=1;
    Con2[0]=1;
    //xxx[0]
    for(i=1;i<=N;i++)
    {
        CCon[i]=CCon[i-1]*i%MOD;
        Con2[i]=Pow(CCon[i],MOD-2);
        xxx[i]=Pow(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

boat.cpp: In function 'long long int F(long long int, long long int)':
boat.cpp:37: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:74:17: warning: unused variable 'M' [-Wunused-variable]
     long long N,M,i;
                 ^
boat.cpp:75: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.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 7416 KB Output is correct
2 Correct 100 ms 7416 KB Output is correct
3 Correct 110 ms 7460 KB Output is correct
4 Correct 99 ms 7416 KB Output is correct
5 Correct 101 ms 7416 KB Output is correct
6 Correct 135 ms 6400 KB Output is correct
7 Correct 157 ms 6264 KB Output is correct
8 Correct 117 ms 6776 KB Output is correct
9 Correct 117 ms 6648 KB Output is correct
10 Correct 120 ms 7032 KB Output is correct
11 Correct 134 ms 6776 KB Output is correct
12 Correct 117 ms 7160 KB Output is correct
13 Correct 117 ms 6776 KB Output is correct
14 Correct 115 ms 6392 KB Output is correct
15 Correct 116 ms 6904 KB Output is correct
16 Correct 20 ms 4096 KB Output is correct
17 Correct 21 ms 4188 KB Output is correct
18 Correct 20 ms 4176 KB Output is correct
19 Correct 20 ms 4224 KB Output is correct
20 Correct 21 ms 4088 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 7416 KB Output is correct
2 Correct 100 ms 7416 KB Output is correct
3 Correct 110 ms 7460 KB Output is correct
4 Correct 99 ms 7416 KB Output is correct
5 Correct 101 ms 7416 KB Output is correct
6 Correct 135 ms 6400 KB Output is correct
7 Correct 157 ms 6264 KB Output is correct
8 Correct 117 ms 6776 KB Output is correct
9 Correct 117 ms 6648 KB Output is correct
10 Correct 120 ms 7032 KB Output is correct
11 Correct 134 ms 6776 KB Output is correct
12 Correct 117 ms 7160 KB Output is correct
13 Correct 117 ms 6776 KB Output is correct
14 Correct 115 ms 6392 KB Output is correct
15 Correct 116 ms 6904 KB Output is correct
16 Correct 20 ms 4096 KB Output is correct
17 Correct 21 ms 4188 KB Output is correct
18 Correct 20 ms 4176 KB Output is correct
19 Correct 20 ms 4224 KB Output is correct
20 Correct 21 ms 4088 KB Output is correct
21 Execution timed out 2083 ms 2296 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2079 ms 1188 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 7416 KB Output is correct
2 Correct 100 ms 7416 KB Output is correct
3 Correct 110 ms 7460 KB Output is correct
4 Correct 99 ms 7416 KB Output is correct
5 Correct 101 ms 7416 KB Output is correct
6 Correct 135 ms 6400 KB Output is correct
7 Correct 157 ms 6264 KB Output is correct
8 Correct 117 ms 6776 KB Output is correct
9 Correct 117 ms 6648 KB Output is correct
10 Correct 120 ms 7032 KB Output is correct
11 Correct 134 ms 6776 KB Output is correct
12 Correct 117 ms 7160 KB Output is correct
13 Correct 117 ms 6776 KB Output is correct
14 Correct 115 ms 6392 KB Output is correct
15 Correct 116 ms 6904 KB Output is correct
16 Correct 20 ms 4096 KB Output is correct
17 Correct 21 ms 4188 KB Output is correct
18 Correct 20 ms 4176 KB Output is correct
19 Correct 20 ms 4224 KB Output is correct
20 Correct 21 ms 4088 KB Output is correct
21 Execution timed out 2083 ms 2296 KB Time limit exceeded
22 Halted 0 ms 0 KB -