Submission #835103

---

Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
 
class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }
 
    long mod = 1000000007;
    void calc()
    {
        string[] st;
        st = splitLine(2, 2);
        int R = getInt(st[0], 1, 30);
        int C = getInt(st[1], 1, 30);
        st = splitLine(2, 2);
        int X = getInt(st[0], 1, R);
        int Y = getInt(st[1], 1, C);
        st = splitLine(2, 2);
        int D = getInt(st[0], 0, X * Y);
        int L = getInt(st[1], 0, X * Y);
        int DL = D + L;
        if (DL > X * Y) myon("over DL");
 
        setC(1000);
 
        long ret = 0;
        long[,] need = new long[X + 1, Y + 1];
        need[X, Y] = 1;
 
        for (int i = X; i >= 0; i--)
        {
            for (int j = Y; j >= 0; j--)
            {
                long mul = need[i, j];
                long tret = mul;
                while (tret < 0) tret += mod;
 
                //Console.WriteLine(i + " " + j + " " + check(tret));
 
                tret *= getC(i * j, DL);
                tret %= mod;
                tret *= getC(DL, D);
                tret %= mod;
 
                ret = (tret + ret) % mod;
 
                for (int k = 1; k <= i; k++)
                {
                    for (int l = 1; l <= j; l++)
                    {
                        if (k == i && l == j) continue;
                        need[k, l] -= (i - k + 1) * (j - l + 1) * mul;
                        need[k, l] %= mod;
                    }
                }
            }
        }
        ret *= (R - X + 1) * (C - Y + 1);
        ret %= mod;
 
        Console.WriteLine(ret);
    }
 
 
    long check(long a)
    {
        if (a < mod / 2) return a;
        return a - mod;
    }
 
    long[,] C;
 
    void setC(int N)
    {
        C = new long[N, N];
        for (int i = 0; i < N; i++)
        {
            C[i, 0] = 1;
            for (int j = 1; j <= i; j++)
            {
                C[i, j] = (C[i - 1, j] + C[i - 1, j - 1]) % mod;
            }
        }
    }
 
    long getC(int a, int b)
    {
        return C[a, b];
    }
 
    //swap
    void swap<T>(ref T a, ref T b)
    {
        T c = a;
        a = b;
        b = c;
    }
 
    void myon(string s)
    {
        throw new Exception(s);
    }
 
    int getInt(string s, int min, int max)
    {
        int ret = int.Parse(s);
        if (ret < min) throw new Exception("low");
        if (ret > max) throw new Exception("high");
        return ret;
    }
 
    int getIntLine(int min, int max)
    {
        int ret = int.Parse(Console.ReadLine());
        if (ret < min) throw new Exception("low");
        if (ret > max) throw new Exception("high");
        return ret;
    }
 
    double getDouble(string s, double min, double max)
    {
        double ret = double.Parse(s);
        if (ret < min) throw new Exception("low");
        if (ret > max) throw new Exception("high");
        return ret;
    }
 
    double getDoubleLine(double min, double max)
    {
        double ret = double.Parse(Console.ReadLine());
        if (ret < min) throw new Exception("low");
        if (ret > max) throw new Exception("high");
        return ret;
    }
 
    string getString(string s, int min, int max)
    {
        if (s.Length < min) throw new Exception("low");
        if (s.Length > max) throw new Exception("high");
        return s;
    }
 
    string getStringLine(int min, int max)
    {
        string s = Console.ReadLine();
        if (s.Length < min) throw new Exception("low");
        if (s.Length > max) throw new Exception("high");
        return s;
    }
 
    string[] splitLine(int min, int max)
    {
        string[] ret = Console.ReadLine().Split(' ');
        if (ret.Length < min || ret.Length > max) throw new Exception("wrong length");
        return ret;
    }
}

Submission Info

Judge Result