Submission #826768


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

int mod, ans, N, K, dp[2009][2009], s[2009][2009];
int fac[4000009], inv[4000009];

int pow (int a, int b, int mod)
{
    int p = 1;
    for (int i=0; (1<<i) <= b; i++)
    {
        if (b & (1 << i)) p = (1LL * p * a) % mod;
        a = (1LL * a * a) % mod;
    }
    return p;
}

int comb (int n, int k)
{
    if (k > n || k < 0) return 0;
    int ans = (1LL * fac[n] * inv[k]) % mod;
    ans = (1LL * ans * inv[n - k]) % mod;
    return ans;
}

void PreProc ()
{
    fac[0] = 1;
    for (int i=1; i<=N * K; i++)
        fac[i] = (1LL * fac[i - 1] * i) % mod;
    inv[N * K] = pow (fac[N * K], mod - 2, mod);
    for (int i=N * K - 1; i>=0; i--)
        inv[i] = (1LL * inv[i + 1] * (i + 1)) % mod;
}

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

scanf ("%d %d", &N, &K), mod = 1e9 + 7;
if (K == 1)
{
    printf ("1\n");
    return 0;
}
PreProc ();
dp[0][0] = s[0][0] = 1;
for (int i=1; i<=N; i++)
    for (int j=1; j<=i; j++)
    {
        int coef = comb (i * K - j - 1, K - 2), sum = s[i - 1][i - 1];
        if (j > 1)
        {
            sum -= s[i - 1][j - 2];
            if (sum < 0) sum += mod;
        }
/*        for (int k=j - 1; k<i; k++)
            sum += dp[i - 1][k];
        dp[i][j] = sum * coef;*/
        dp[i][j] = (1LL * sum * coef) % mod;
        s[i][j] = s[i][j - 1] + dp[i][j];
        if (s[i][j] >= mod) s[i][j] -= mod;
    }
printf ("%d\n", (1LL * fac[N] * s[N][N]) % mod);
return 0;
}

Submission Info

Submission Time
Task F - Leftmost Ball
User geniucos
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 1573 Byte
Status AC
Exec Time 471 ms
Memory 59136 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:66:47: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
 printf ("%d\n", (1LL * fac[N] * s[N][N]) % mod);
                                               ^
./Main.cpp:42:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d %d", &N, &K), mod = 1e9 + 7;
                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 4
AC × 24
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt
Case Name Status Exec Time Memory
0_00.txt AC 4 ms 256 KB
0_01.txt AC 4 ms 256 KB
0_02.txt AC 4 ms 256 KB
0_03.txt AC 459 ms 59136 KB
1_00.txt AC 4 ms 256 KB
1_01.txt AC 4 ms 256 KB
1_02.txt AC 4 ms 256 KB
1_03.txt AC 471 ms 59136 KB
1_04.txt AC 446 ms 56320 KB
1_05.txt AC 460 ms 57856 KB
1_06.txt AC 447 ms 57984 KB
1_07.txt AC 437 ms 55296 KB
1_08.txt AC 439 ms 55552 KB
1_09.txt AC 438 ms 56704 KB
1_10.txt AC 428 ms 55680 KB
1_11.txt AC 448 ms 57984 KB
1_12.txt AC 89 ms 13312 KB
1_13.txt AC 382 ms 50816 KB
1_14.txt AC 14 ms 2176 KB
1_15.txt AC 118 ms 18304 KB
1_16.txt AC 201 ms 29312 KB
1_17.txt AC 328 ms 44160 KB
1_18.txt AC 22 ms 4224 KB
1_19.txt AC 452 ms 58368 KB