Submission #123302

---

Source Code Expand

#include <stdio.h>

long long dp[2][120][120][16];
long long comb[1000][1000];

int main()
{
    int r, c, x, y, d, l, z, mod = 1000000007, i, j, k, p;
    long long ans = 0;
    
    scanf("%d %d", &r, &c);
    scanf("%d %d", &x, &y);
    scanf("%d %d", &d, &l);
    
    for (i = 0; i < 1000; i++) {
        comb[i][0] = comb[i][i] = 1;
        
        for (j = 1; j < i; j++) comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % mod;
    }
    
    if (x == 1 && y == 1) {
        printf("%d\n", r * c);
        
        return 0;
    } else if (x == 1 || y == 1) {
        if (d >= 2) ans = (ans + comb[x + y - 3][d - 2] * comb[x + y - d - 1][l] % mod) % mod;
        
        if (l >= 2) ans = (ans + comb[x + y - 3][l - 2] * comb[x + y - l - 1][d] % mod) % mod;
        
        if (d >= 1 && l >= 1) ans = (ans + comb[x + y - 3][d - 1] * comb[x + y - d - 2][l - 1] * 2 % mod) % mod;
        
        ans = ans * (r - x + 1) * (c - y + 1) % mod;
        
        printf("%lld\n", ans);
        
        return 0;
    }
    
    dp[0][0][0][0] = 1;
    
    for (i = 0; i < x * 2 + y * 2 - 4; i++) {
        for (j = 0; j <= d && j <= i; j++) {
            for (k = 0; k <= l && k <= i; k++) {
                for (p = 0; p < 16; p++) {
                    int c = 0;
                    
                    if (dp[i & 1][j][k][p] == 0) continue;
                    
                    if (i <= x - 1) c |= 1;
                    if (i >= x - 1 && i <= x + y - 2) c |= 2;
                    if (i >= x + y - 2 && i <= x * 2 + y - 3) c |= 4;
                    if (i >= x * 2 + y - 3 || i == 0) c |= 8;
                    
                    dp[(i + 1) & 1][j][k][p] = (dp[(i + 1) & 1][j][k][p] + dp[i & 1][j][k][p]) % mod;
                    
                    if (j < d) dp[(i + 1) & 1][j + 1][k][p | c] = (dp[(i + 1) & 1][j + 1][k][p | c] + dp[i & 1][j][k][p]) % mod;
                    if (k < l) dp[(i + 1) & 1][j][k + 1][p | c] = (dp[(i + 1) & 1][j][k + 1][p | c] + dp[i & 1][j][k][p]) % mod;
                    
                    dp[i & 1][j][k][p] = 0;
                }
            }
        }
    }
    
    z = x * y - x * 2 - y * 2 + 4;
    
    for (i = 0; i <= d && i <= x * 2 + y * 2 - 4; i++) {
        for (j = 0; j <= l && j <= x * 2 + y * 2 - 4; j++) {
            if (dp[(x * 2 + y * 2 - 4) & 1][i][j][15] == 0) continue;
            
            if (d - i + l - j > z) continue;
            
            ans = (ans + dp[(x * 2 + y * 2 - 4) & 1][i][j][15] * comb[z][d - i] % mod * comb[z - d + i][l - j] % mod) % mod;
        }
    }
    
    ans = ans * (r - x + 1) * (c - y + 1) % mod;
    
    printf("%lld\n", ans);
    
    return 0;
}

Submission Info

Compile Error

./Main.c: In function ‘main’:
./Main.c:11:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:12:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
./Main.c:13:10: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result