Submission #48627418
Source Code Expand
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#define N 20000005
#define ll long long
#define p 1000000007
using namespace std;
inline int power(int a,int t){
int res = 1;
while(t){
if(t&1) res = (ll)res*a%p;
a = (ll)a*a%p;
t >>= 1;
}
return res;
}
int fac[N],ifac[N],inv[N];
void init(int n){
fac[0] = fac[1] = ifac[0] = ifac[1] = 1;
for(int i=2;i<=n;++i) fac[i] = (ll)fac[i-1]*i%p;
ifac[n] = power(fac[n],p-2);
for(int i=n-1;i;--i) ifac[i] = (ll)ifac[i+1]*(i+1)%p;
}
inline int binom(int n,int m){
if(n<m||m<0) return 0;
return (ll)fac[n]*ifac[m]%p*ifac[n-m]%p;
}
int n,m,ans,bm;
ll _m;
int main(){
scanf("%d%lld",&n,&_m);
if(n==1||_m==0){
puts("1");
return 0;
}
init(n<<1);
--n,bm = 1,m = _m%p;
for(int i=1;i<=n;++i){
ans = (ans+(ll)binom(n,i)*bm%p*binom(n+i,n-m-1+i))%p;
bm = (ll)bm*(m-i)%p*fac[i-1]%p*ifac[i]%p;
}
printf("%lld",(ll)(ans+p)*fac[n-1]%p*ifac[n]%p);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Not Intersect |
| User | NaCly_Fish |
| Language | C++ 20 (gcc 12.2) |
| Score | 900 |
| Code Size | 1098 Byte |
| Status | AC |
| Exec Time | 370 ms |
| Memory | 160116 KiB |
Compile Error
Main.cpp: In function ‘int main()’:
Main.cpp:38:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
38 | scanf("%d%lld",&n,&_m);
| ~~~~~^~~~~~~~~~~~~~~~~
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 900 / 900 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | example_00.txt, example_01.txt, example_02.txt, example_03.txt |
| All | example_00.txt, example_01.txt, example_02.txt, example_03.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| example_00.txt | AC | 1 ms | 3752 KiB |
| example_01.txt | AC | 1 ms | 3688 KiB |
| example_02.txt | AC | 1 ms | 3612 KiB |
| example_03.txt | AC | 46 ms | 22952 KiB |
| test_00.txt | AC | 1 ms | 3700 KiB |
| test_01.txt | AC | 1 ms | 3652 KiB |
| test_02.txt | AC | 1 ms | 3884 KiB |
| test_03.txt | AC | 1 ms | 3504 KiB |
| test_04.txt | AC | 1 ms | 3760 KiB |
| test_05.txt | AC | 1 ms | 3604 KiB |
| test_06.txt | AC | 1 ms | 3884 KiB |
| test_07.txt | AC | 115 ms | 52928 KiB |
| test_08.txt | AC | 244 ms | 109336 KiB |
| test_09.txt | AC | 13 ms | 8688 KiB |
| test_10.txt | AC | 1 ms | 3616 KiB |
| test_11.txt | AC | 359 ms | 159876 KiB |
| test_12.txt | AC | 360 ms | 160008 KiB |
| test_13.txt | AC | 115 ms | 51512 KiB |
| test_14.txt | AC | 51 ms | 24752 KiB |
| test_15.txt | AC | 361 ms | 159872 KiB |
| test_16.txt | AC | 370 ms | 160108 KiB |
| test_17.txt | AC | 360 ms | 160048 KiB |
| test_18.txt | AC | 360 ms | 160116 KiB |
| test_19.txt | AC | 348 ms | 154572 KiB |
| test_20.txt | AC | 104 ms | 48020 KiB |
| test_21.txt | AC | 360 ms | 159992 KiB |
| test_22.txt | AC | 360 ms | 160004 KiB |
| test_23.txt | AC | 359 ms | 159984 KiB |
| test_24.txt | AC | 360 ms | 159996 KiB |
| test_25.txt | AC | 361 ms | 160004 KiB |
| test_26.txt | AC | 358 ms | 159908 KiB |
| test_27.txt | AC | 358 ms | 159872 KiB |
| test_28.txt | AC | 363 ms | 160004 KiB |