提出 #123359

---

ソースコード 拡げる

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>
#include<cstdlib>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<utility>
#include<cstring>
#include<queue>
#include<stack>
#include<climits>
using namespace std;

#define rrepp(i, from, to) for (int i = from; i <= to; ++i)
#define rrep(i, from, to) for (int i = from; i < to; ++i)
#define repp(i, from, to) for (i = from; i <= to; ++i)
#define rep(i, from, to) for (i = from; i < to; ++i)

const long long mod = 1000000007;

long long _combi[1000][1000];

long long combi(int n, int r)
{
	if (_combi[n][r] >= 0) {
		return _combi[n][r];
	} else if (r == 0 || n == r) {
		return _combi[n][r] = 1;
	} else if (n < r) {
		return _combi[n][r] = 0;
	} else {
		return _combi[n][r] = (combi(n - 1, r) + combi(n - 1, r - 1)) % mod;
	}
}

long long pattern(int x, int y, int cnt)
{
	if (x < 0 || y < 0) {
		return 0;
	} else {
		return combi(x * y, cnt);
	}
}

int main()
{
	memset(_combi, -1, sizeof(_combi));

	int r, c;
	int x, y;
	int d, l;
	cin >> r >> c;
	cin >> x >> y;
	cin >> d >> l;

	long long p1 = pattern(x    , y    , d + l);
	long long p2 = pattern(x    , y - 1, d + l);
	long long p3 = pattern(x - 1, y    , d + l);
	long long p4 = pattern(x - 1, y - 1, d + l);
	long long p5 = pattern(x    , y - 2, d + l);
	long long p6 = pattern(x - 2, y    , d + l);
	long long p7 = pattern(x - 1, y - 2, d + l);
	long long p8 = pattern(x - 2, y - 1, d + l);
	long long p9 = pattern(x - 2, y - 2, d + l);
	long long p = p1 - 2 * p2 - 2 * p3 + 4 * p4 + p5 + p6 - 2 * p7 - 2 * p8 + p9;
	p = (p + 8 * mod) % mod;
	p = p * combi(d + l, d) % mod;
	long long result = p * (r - x + 1) * (c - y + 1) % mod;
	cout << result << "\n";
	return 0;
}

提出情報

ジャッジ結果