QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#216953	#5749. Directed Vertex Cacti	CharlieVinnie	AC ✓	13ms	3652kb	C++17	1.2kb	2023-10-16 09:52:15	2023-10-16 09:52:15

Judging History

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

[2023-10-16 09:52:15]
评测

测评结果：AC
用时：13ms
内存：3652kb

查看

[2023-10-16 09:52:15]
提交

answer

#include "bits/stdc++.h"
#ifdef DEBUG
#if __cplusplus >= 201700
#include "PrettyDebug.hpp"
#else
#define debug(a) cerr<<"(Line "<<__LINE__<<"): "<<#a<<" = "<<a<<'\n'
#endif
#else
#define debug(...) [](auto...){}(__VA_ARGS__)
#endif
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
#define range basic_string_view
using namespace std; typedef long long ll;
constexpr int mod=1e9+9;
int qpow(int x,int y){int res=1;while(y){if(y&1)res=1ll*res*x%mod;x=1ll*x*x%mod;y>>=1;}return res;}
signed main(){
    atexit([](){cerr<<"Time = "<<clock()<<" ms"<<endl;});
    int n,m; cin>>n>>m; int x=1ll*n*(n-1)/2%mod;
    int ans=1; For(i,1,m) ans=1ll*ans*i%mod;
    ans=qpow(ans,mod-2); For(i,1,n) ans=1ll*ans*i%mod;
    For(i,0,m-1) ans=1ll*ans*(x-i+mod)%mod;
    cout<<ans<<'\n';
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE

// Started Coding On: October 16 Mon, 09 : 44 : 21

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3440kb

input:

3 1

output:

result:

ok 1 number(s): "18"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3476kb

input:

4 4

output:

result:

ok 1 number(s): "360"

Test #3:

score: 0

Accepted

time: 4ms

memory: 3540kb

input:

39847 348708

output:

983575456

result:

ok 1 number(s): "983575456"

Test #4:

score: 0

Accepted

time: 0ms

memory: 3492kb

input:

1 1

output:

result:

ok 1 number(s): "0"

Test #5:

score: 0

Accepted

time: 1ms

memory: 3596kb

input:

3 2

output:

result:

ok 1 number(s): "18"

Test #6:

score: 0

Accepted

time: 1ms

memory: 3544kb

input:

3 3

output:

result:

ok 1 number(s): "6"

Test #7:

score: 0

Accepted

time: 0ms

memory: 3536kb

input:

3 4

output:

result:

ok 1 number(s): "0"

Test #8:

score: 0

Accepted

time: 6ms

memory: 3416kb

input:

3 1000000

output:

result:

ok 1 number(s): "0"

Test #9:

score: 0

Accepted

time: 0ms

memory: 3576kb

input:

4 1

output:

result:

ok 1 number(s): "144"

Test #10:

score: 0

Accepted

time: 0ms

memory: 3500kb

input:

4 2

output:

result:

ok 1 number(s): "360"

Test #11:

score: 0

Accepted

time: 1ms

memory: 3472kb

input:

4 3

output:

result:

ok 1 number(s): "480"

Test #12:

score: 0

Accepted

time: 0ms

memory: 3496kb

input:

4 5

output:

result:

ok 1 number(s): "144"

Test #13:

score: 0

Accepted

time: 0ms

memory: 3644kb

input:

4 6

output:

result:

ok 1 number(s): "24"

Test #14:

score: 0

Accepted

time: 1ms

memory: 3544kb

input:

5 1

output:

result:

ok 1 number(s): "1200"

Test #15:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

5 2

output:

result:

ok 1 number(s): "5400"

Test #16:

score: 0

Accepted

time: 0ms

memory: 3420kb

input:

5 3

output:

result:

ok 1 number(s): "14400"

Test #17:

score: 0

Accepted

time: 1ms

memory: 3652kb

input:

5 4

output:

result:

ok 1 number(s): "25200"

Test #18:

score: 0

Accepted

time: 1ms

memory: 3544kb

input:

5 5

output:

result:

ok 1 number(s): "30240"

Test #19:

score: 0

Accepted

time: 0ms

memory: 3644kb

input:

5 6

output:

result:

ok 1 number(s): "25200"

Test #20:

score: 0

Accepted

time: 1ms

memory: 3468kb

input:

5 7

output:

result:

ok 1 number(s): "14400"

Test #21:

score: 0

Accepted

time: 0ms

memory: 3492kb

input:

5 8

output:

result:

ok 1 number(s): "5400"

Test #22:

score: 0

Accepted

time: 0ms

memory: 3544kb

input:

5 9

output:

result:

ok 1 number(s): "1200"

Test #23:

score: 0

Accepted

time: 1ms

memory: 3644kb

input:

5 10

output:

result:

ok 1 number(s): "120"

Test #24:

score: 0

Accepted

time: 1ms

memory: 3480kb

input:

1000 1

output:

533396879

result:

ok 1 number(s): "533396879"

Test #25:

score: 0

Accepted

time: 1ms

memory: 3416kb

input:

1000 100

output:

199484478

result:

ok 1 number(s): "199484478"

Test #26:

score: 0

Accepted

time: 1ms

memory: 3496kb

input:

1000 10000

output:

656650652

result:

ok 1 number(s): "656650652"

Test #27:

score: 0

Accepted

time: 9ms

memory: 3504kb

input:

1000 1000000

output:

result:

ok 1 number(s): "0"

Test #28:

score: 0

Accepted

time: 8ms

memory: 3648kb

input:

535164 619302

output:

721871396

result:

ok 1 number(s): "721871396"

Test #29:

score: 0

Accepted

time: 13ms

memory: 3472kb

input:

1000000 1000000

output:

580712335

result:

ok 1 number(s): "580712335"

Test #30:

score: 0

Accepted

time: 7ms

memory: 3476kb

input:

1000000 234534

output:

546630669

result:

ok 1 number(s): "546630669"

Test #31:

score: 0

Accepted

time: 10ms

memory: 3440kb

input:

234523 1000000

output:

127869098

result:

ok 1 number(s): "127869098"

Test #32:

score: 0

Accepted

time: 1ms

memory: 3648kb

input:

44722 10000

output:

result:

ok 1 number(s): "0"