QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#476416#2568. MountainslefyAC ✓1ms4048kbC++141.3kb2024-07-13 19:25:122024-07-13 19:25:13

Judging History

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

  • [2024-07-13 19:25:13]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:4048kb
  • [2024-07-13 19:25:12]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=110,mod=1e9+7;
ll pw(ll x,int cnt){
    ll ans=1;
    while(cnt){
        if(cnt&1)ans=ans*x%mod;
        x=x*x%mod;
        cnt>>=1;
    }
    return ans;
}
ll fac[N<<2],inv[N<<2];
void init(int n){
    fac[0]=1;
    for(int i=1;i<=n;i++)fac[i]=fac[i-1]*i%mod;
    inv[n]=pw(fac[n],mod-2);
    for(int i=n-1;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;
}
ll C(int x,int y){
    if(x<y||x<0||y<0)return 0;
    return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
ll a[N][N];
ll get(int sx,int sy,int tx,int ty){
    return C(tx-sx+ty-sy,tx-sx);
}
ll get(int n){
    for(int i=1;i<=n;i++){
        int id=0;
        for(int j=i;j<=n;j++)if(a[j][i]){
            id=j;break;
        }
        if(!id)return 0;
        swap(a[i],a[id]);
        ll tmp=pw(a[i][i],mod-2);
        for(int j=i+1;j<=n;j++){
            ll t=tmp*a[j][i]%mod;
            for(int k=i;k<=n;k++)a[j][k]=(a[j][k]-a[i][k]*t%mod+mod)%mod;
        }
    }
    ll ans=1;
    for(int i=1;i<=n;i++)ans=ans*a[i][i]%mod;
    return ans;
}
int main(){
    init(400);
    int n,m,K;
    scanf("%d%d%d",&n,&m,&K);
    for(int i=1;i<=K;i++){
        for(int j=1;j<=K;j++)a[i][j]=get(i,-i,n+j,m-j);
    }
    printf("%lld\n",get(K));
    return 0;
}

详细

Test #1:

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

input:

1 1 1

output:

2

result:

ok 1 number(s): "2"

Test #2:

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

input:

2 2 2

output:

20

result:

ok 1 number(s): "20"

Test #3:

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

input:

2 3 4

output:

490

result:

ok 1 number(s): "490"

Test #4:

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

input:

1 2 8

output:

45

result:

ok 1 number(s): "45"

Test #5:

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

input:

1 10 2

output:

66

result:

ok 1 number(s): "66"

Test #6:

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

input:

9 5 7

output:

371850968

result:

ok 1 number(s): "371850968"

Test #7:

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

input:

3 3 1

output:

20

result:

ok 1 number(s): "20"

Test #8:

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

input:

7 7 9

output:

166345303

result:

ok 1 number(s): "166345303"

Test #9:

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

input:

25 15 25

output:

850087558

result:

ok 1 number(s): "850087558"

Test #10:

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

input:

45 59 71

output:

659153227

result:

ok 1 number(s): "659153227"

Test #11:

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

input:

73 3 25

output:

683124269

result:

ok 1 number(s): "683124269"

Test #12:

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

input:

1 48 78

output:

446896916

result:

ok 1 number(s): "446896916"

Test #13:

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

input:

25 100 32

output:

966287506

result:

ok 1 number(s): "966287506"

Test #14:

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

input:

85 64 40

output:

125679545

result:

ok 1 number(s): "125679545"

Test #15:

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

input:

5 9 94

output:

620471576

result:

ok 1 number(s): "620471576"

Test #16:

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

input:

33 57 40

output:

637315057

result:

ok 1 number(s): "637315057"

Test #17:

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

input:

61 6 97

output:

362472796

result:

ok 1 number(s): "362472796"

Test #18:

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

input:

85 50 51

output:

192099209

result:

ok 1 number(s): "192099209"

Test #19:

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

input:

96 54 59

output:

714762612

result:

ok 1 number(s): "714762612"

Test #20:

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

input:

20 99 12

output:

772155662

result:

ok 1 number(s): "772155662"

Test #21:

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

input:

48 39 62

output:

670046604

result:

ok 1 number(s): "670046604"

Test #22:

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

input:

76 83 16

output:

976820079

result:

ok 1 number(s): "976820079"

Test #23:

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

input:

96 36 61

output:

20854557

result:

ok 1 number(s): "20854557"

Test #24:

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

input:

18 40 77

output:

261684871

result:

ok 1 number(s): "261684871"

Test #25:

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

input:

42 84 26

output:

458573307

result:

ok 1 number(s): "458573307"

Test #26:

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

input:

71 25 80

output:

875902815

result:

ok 1 number(s): "875902815"

Test #27:

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

input:

95 73 26

output:

922299967

result:

ok 1 number(s): "922299967"

Test #28:

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

input:

19 17 83

output:

494148696

result:

ok 1 number(s): "494148696"

Test #29:

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

input:

100 100 100

output:

192912055

result:

ok 1 number(s): "192912055"

Test #30:

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

input:

100 98 99

output:

412293529

result:

ok 1 number(s): "412293529"