QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#207196#5749. Directed Vertex Cactiyx20220802AC ✓9ms3972kbC++141.4kb2023-10-08 11:07:492023-10-08 11:07:50

Judging History

你现在查看的是最新测评结果

  • [2023-10-08 11:07:50]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:3972kb
  • [2023-10-08 11:07:49]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
namespace IO_ER{
    #define LL long long
    #define db double
    #define U unsigned
    #define ULL U LL
    #define In inline
    #define Re register
    #define f(a,b,i) for(int i=a;i<=b;i++)
    #define ff(a,b,i) for(int i=a;i<b;i++)
    #define f_(a,b,i) for(int i=a;i>=b;i--)
    #define ff_(a,b,i) for(int i=a;i>b;i--)
    typedef pair<LL,int> Pi;
    int inf=0x3f3f3f3f;
    int INF=0x7fffffff;
    LL infll=0x3f3f3f3f3f3f3f3fll;
    LL INFll=0x7fffffffffffffffll;
    template<typename T>void read(T &x){
        x=0;
        int fl=0;
        char ch=getchar();
        while(ch<'0'||'9'<ch){
            if(ch=='-')fl=1;
            ch=getchar();
        }
        while('0'<=ch&&ch<='9'){
            x=(x<<1)+(x<<3)+(ch^48);
            ch=getchar();
        }
        x=fl?-x:x;
    }
    template<typename T,typename ...Args>void read(T &x,Args &...args){
        read(x);
        read(args...);
    }
}
using namespace IO_ER;

#define mod 1000000009

LL n,m;

In LL pow_(LL a,LL b){
    LL ans=1;
    while(b){
        if(b&1)ans=ans*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}

int main(){
    read(n,m);
    LL a=1,b=1,c=n*(n-1)%mod*pow_(2,mod-2)%mod;
    f(1,n,i)a=a*i%mod;
    f(1,m,i)b=b*i%mod,a=a*((c-m+i)%mod+mod)%mod;
    printf("%lld",a*pow_(b,mod-2)%mod);
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3864kb

input:

3 1

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

4 4

output:

360

result:

ok 1 number(s): "360"

Test #3:

score: 0
Accepted
time: 2ms
memory: 3856kb

input:

39847 348708

output:

983575456

result:

ok 1 number(s): "983575456"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3968kb

input:

1 1

output:

0

result:

ok 1 number(s): "0"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

3 2

output:

18

result:

ok 1 number(s): "18"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

3 3

output:

6

result:

ok 1 number(s): "6"

Test #7:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

3 4

output:

0

result:

ok 1 number(s): "0"

Test #8:

score: 0
Accepted
time: 5ms
memory: 3704kb

input:

3 1000000

output:

0

result:

ok 1 number(s): "0"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

4 1

output:

144

result:

ok 1 number(s): "144"

Test #10:

score: 0
Accepted
time: 0ms
memory: 3724kb

input:

4 2

output:

360

result:

ok 1 number(s): "360"

Test #11:

score: 0
Accepted
time: 0ms
memory: 3776kb

input:

4 3

output:

480

result:

ok 1 number(s): "480"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

4 5

output:

144

result:

ok 1 number(s): "144"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3912kb

input:

4 6

output:

24

result:

ok 1 number(s): "24"

Test #14:

score: 0
Accepted
time: 0ms
memory: 3728kb

input:

5 1

output:

1200

result:

ok 1 number(s): "1200"

Test #15:

score: 0
Accepted
time: 0ms
memory: 3844kb

input:

5 2

output:

5400

result:

ok 1 number(s): "5400"

Test #16:

score: 0
Accepted
time: 0ms
memory: 3808kb

input:

5 3

output:

14400

result:

ok 1 number(s): "14400"

Test #17:

score: 0
Accepted
time: 0ms
memory: 3912kb

input:

5 4

output:

25200

result:

ok 1 number(s): "25200"

Test #18:

score: 0
Accepted
time: 0ms
memory: 3780kb

input:

5 5

output:

30240

result:

ok 1 number(s): "30240"

Test #19:

score: 0
Accepted
time: 0ms
memory: 3908kb

input:

5 6

output:

25200

result:

ok 1 number(s): "25200"

Test #20:

score: 0
Accepted
time: 0ms
memory: 3852kb

input:

5 7

output:

14400

result:

ok 1 number(s): "14400"

Test #21:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

5 8

output:

5400

result:

ok 1 number(s): "5400"

Test #22:

score: 0
Accepted
time: 0ms
memory: 3728kb

input:

5 9

output:

1200

result:

ok 1 number(s): "1200"

Test #23:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

5 10

output:

120

result:

ok 1 number(s): "120"

Test #24:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

1000 1

output:

533396879

result:

ok 1 number(s): "533396879"

Test #25:

score: 0
Accepted
time: 0ms
memory: 3800kb

input:

1000 100

output:

199484478

result:

ok 1 number(s): "199484478"

Test #26:

score: 0
Accepted
time: 0ms
memory: 3784kb

input:

1000 10000

output:

656650652

result:

ok 1 number(s): "656650652"

Test #27:

score: 0
Accepted
time: 5ms
memory: 3784kb

input:

1000 1000000

output:

0

result:

ok 1 number(s): "0"

Test #28:

score: 0
Accepted
time: 5ms
memory: 3724kb

input:

535164 619302

output:

721871396

result:

ok 1 number(s): "721871396"

Test #29:

score: 0
Accepted
time: 9ms
memory: 3972kb

input:

1000000 1000000

output:

580712335

result:

ok 1 number(s): "580712335"

Test #30:

score: 0
Accepted
time: 5ms
memory: 3720kb

input:

1000000 234534

output:

546630669

result:

ok 1 number(s): "546630669"

Test #31:

score: 0
Accepted
time: 6ms
memory: 3864kb

input:

234523 1000000

output:

127869098

result:

ok 1 number(s): "127869098"

Test #32:

score: 0
Accepted
time: 1ms
memory: 3836kb

input:

44722 10000

output:

0

result:

ok 1 number(s): "0"