Submission #3771320


Source Code Expand

N,A,B,C,D=map(int,input().split())
mod=10**9+7

F=[1]*(N+1)
for i in range(1,N+1):
  F[i]=F[i-1]*(i)%mod
def power(x,y):
  if y==0:
    return 1
  elif y==1:
    return x%mod
  elif y%2==0:
    return power(x,y//2)**2%mod
  else:
    return (power(x,y//2)**2)*x%mod

invF=[1]*(N+1)
invF[N]=power(F[N],mod-2)
for i in range(0,N)[::-1]:
  invF[i]=(invF[i+1]*(i+1))%mod
  
dp=[[0]*(N+1) for i in range(B-A+2)]
dp[0][0]=1
for i in range(A,B+1):
  for j in range(N+1):
    dp[i-A+1][j]=(dp[i-A][j]+sum([dp[i-A][j-k*i]*F[N-j+k*i]*invF[N-j]*power(invF[i],k)*invF[k] for k in range(C,min(D,j//i)+1)]))%mod
    
print((dp[B-A+1][N])%mod)


        
  


    
                                      

Submission Info

Submission Time
Task E - Grouping
User Chanyuh
Language PyPy3 (2.4.0)
Score 0
Code Size 723 Byte
Status TLE
Exec Time 2114 ms
Memory 166124 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 3
TLE × 1
AC × 10
TLE × 5
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_many_01.txt, subtask_1_many_02.txt, subtask_1_many_03.txt, subtask_1_many_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_randa_01.txt, subtask_1_randa_02.txt, subtask_1_randb_01.txt, subtask_1_randb_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 167 ms 38256 KB
sample_02.txt AC 167 ms 38256 KB
sample_03.txt TLE 2114 ms 166124 KB
sample_04.txt AC 166 ms 38256 KB
subtask_1_many_01.txt TLE 2114 ms 160360 KB
subtask_1_many_02.txt TLE 2112 ms 131992 KB
subtask_1_many_03.txt TLE 2112 ms 129900 KB
subtask_1_many_04.txt TLE 2112 ms 132888 KB
subtask_1_max_01.txt AC 233 ms 48348 KB
subtask_1_max_02.txt AC 243 ms 45276 KB
subtask_1_min_01.txt AC 166 ms 38256 KB
subtask_1_randa_01.txt AC 193 ms 40432 KB
subtask_1_randa_02.txt AC 177 ms 39024 KB
subtask_1_randb_01.txt AC 234 ms 49244 KB
subtask_1_randb_02.txt AC 253 ms 46428 KB