QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#320550#8211. Enumerating Substringsucup-team1516#AC ✓35ms37988kbC++202.1kb2024-02-03 17:53:442024-02-03 17:53:44

Judging History

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

  • [2024-02-03 17:53:44]
  • 评测
  • 测评结果:AC
  • 用时:35ms
  • 内存:37988kb
  • [2024-02-03 17:53:44]
  • 提交

answer

#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

constexpr int mod = 1000000007;

void mpl(int &x,int y) {
    x += y;
    if(x >= mod) x -= mod;
}

int dp[2020][2020];
int f[2020202],f2[2020][2020];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m,k;
    cin >> n >> m >> k;
    f[0] = 1;
    for(int i = 1; i <= n; i++) {
        f[i] = 1ll*f[i-1]*k%mod;
    }
    for(int i = 0; i <= m; i++) {
        if(k-i < 0) break;
        f2[i][0] = 1;
        for(int j = 1; j <= m; j++) {
            f2[i][j] = 1ll*f2[i][j-1]*(k-i-j+1)%mod;
        }
    }
    dp[0][0] = 1;
    for(int i = 0; i <= m; i++) {
        for(int j = 0; j <= m; j++) {
            if(!dp[i][j]) continue;
            mpl(dp[i+1][j+1],1ll*dp[i][j]*(k-j)%mod);
            int a = j*2-i;
            mpl(dp[i+1][j],1ll*dp[i][j]*a%mod);
        }
    }
    int res = 0;
    for(int i = 0; i <= m; i++) {
        mpl(res,dp[m][i]);
    }
    int ans = 0;
    for(int i = 1; i <= m/2; i++) {
        int sum = 0;
        for(int j = 0; j <= m; j++) {
            mpl(sum,1ll*dp[m-2*i][j]*f2[j][i]%mod);
            mpl(res,mod-1ll*dp[m-2*i][j]*f2[j][i]%mod);
        }
        for(int j = 1; j <= n; j += 2) {
            if(m+(j-1)*(m-i) > n) break;
            int a = m+(j-1)*(m-i),b = m-i;
            int mi = min(b,n-a+1);
            mpl(ans,1ll*sum*mi%mod*f[n-a]%mod);
            if(n >= a+b) {
                mpl(ans,1ll*sum*(n-a-b+1)%mod*f[n-a-b]%mod*(f[b]+mod-1)%mod);
            }
        }
    }
    mpl(ans,1ll*res*(n-m+1)%mod*f[n-m]%mod);
    cout << ans << "\n";
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 2 3

output:

228

result:

ok 1 number(s): "228"

Test #2:

score: 0
Accepted
time: 35ms
memory: 37988kb

input:

999999 1999 12345678

output:

52352722

result:

ok 1 number(s): "52352722"

Test #3:

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

input:

7 4 2

output:

182

result:

ok 1 number(s): "182"

Test #4:

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

input:

4 3 4

output:

480

result:

ok 1 number(s): "480"

Test #5:

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

input:

3 1 1

output:

3

result:

ok 1 number(s): "3"

Test #6:

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

input:

5 5 1

output:

0

result:

ok 1 number(s): "0"

Test #7:

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

input:

7 4 3

output:

5784

result:

ok 1 number(s): "5784"

Test #8:

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

input:

5 2 4

output:

3932

result:

ok 1 number(s): "3932"

Test #9:

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

input:

8 2 2

output:

1522

result:

ok 1 number(s): "1522"

Test #10:

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

input:

8 1 2

output:

2048

result:

ok 1 number(s): "2048"

Test #11:

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

input:

7 5 3

output:

2430

result:

ok 1 number(s): "2430"

Test #12:

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

input:

10 4 3

output:

272004

result:

ok 1 number(s): "272004"

Test #13:

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

input:

675978 614 2

output:

0

result:

ok 1 number(s): "0"

Test #14:

score: 0
Accepted
time: 3ms
memory: 7756kb

input:

244613 38 1

output:

0

result:

ok 1 number(s): "0"

Test #15:

score: 0
Accepted
time: 3ms
memory: 9744kb

input:

186293 1462 1

output:

0

result:

ok 1 number(s): "0"

Test #16:

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

input:

24867 886 1

output:

0

result:

ok 1 number(s): "0"

Test #17:

score: 0
Accepted
time: 8ms
memory: 11868kb

input:

976164 1014 2

output:

0

result:

ok 1 number(s): "0"

Test #18:

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

input:

179356 2 716844809

output:

577866092

result:

ok 1 number(s): "577866092"

Test #19:

score: 0
Accepted
time: 3ms
memory: 12060kb

input:

621001 130 310625363

output:

892869197

result:

ok 1 number(s): "892869197"

Test #20:

score: 0
Accepted
time: 7ms
memory: 19944kb

input:

678862 850 754662812

output:

582264789

result:

ok 1 number(s): "582264789"

Test #21:

score: 0
Accepted
time: 13ms
memory: 22736kb

input:

650845 978 348443366

output:

825425732

result:

ok 1 number(s): "825425732"

Test #22:

score: 0
Accepted
time: 3ms
memory: 15372kb

input:

669914 402 87448112

output:

318098088

result:

ok 1 number(s): "318098088"

Test #23:

score: 0
Accepted
time: 15ms
memory: 19516kb

input:

998593 530 681228665

output:

408255654

result:

ok 1 number(s): "408255654"

Test #24:

score: 0
Accepted
time: 33ms
memory: 35016kb

input:

369361 1954 125266115

output:

509912384

result:

ok 1 number(s): "509912384"

Test #25:

score: 0
Accepted
time: 26ms
memory: 29388kb

input:

900226 1378 424079373

output:

406320917

result:

ok 1 number(s): "406320917"

Test #26:

score: 0
Accepted
time: 27ms
memory: 29800kb

input:

334887 1506 17859926

output:

503264679

result:

ok 1 number(s): "503264679"

Test #27:

score: 0
Accepted
time: 10ms
memory: 17300kb

input:

936048 544 53978328

output:

548647866

result:

ok 1 number(s): "548647866"

Test #28:

score: 0
Accepted
time: 14ms
memory: 24420kb

input:

152789 1264 792983073

output:

839541707

result:

ok 1 number(s): "839541707"

Test #29:

score: 0
Accepted
time: 18ms
memory: 29376kb

input:

714493 1392 91796331

output:

721071046

result:

ok 1 number(s): "721071046"

Test #30:

score: 0
Accepted
time: 7ms
memory: 17668kb

input:

269571 816 830801077

output:

330064211

result:

ok 1 number(s): "330064211"

Test #31:

score: 0
Accepted
time: 15ms
memory: 22696kb

input:

845120 944 424581630

output:

348960190

result:

ok 1 number(s): "348960190"

Test #32:

score: 0
Accepted
time: 4ms
memory: 13180kb

input:

533990 368 163586376

output:

522092095

result:

ok 1 number(s): "522092095"

Test #33:

score: 0
Accepted
time: 26ms
memory: 32364kb

input:

181707 1792 462399634

output:

373795106

result:

ok 1 number(s): "373795106"

Test #34:

score: 0
Accepted
time: 32ms
memory: 33492kb

input:

417349 1920 761212891

output:

587051329

result:

ok 1 number(s): "587051329"

Test #35:

score: 0
Accepted
time: 26ms
memory: 29060kb

input:

526583 1344 500217637

output:

108767800

result:

ok 1 number(s): "108767800"

Test #36:

score: 0
Accepted
time: 12ms
memory: 21252kb

input:

867054 769 93998191

output:

239123369

result:

ok 1 number(s): "239123369"

Extra Test:

score: 0
Extra Test Passed