結果
問題 | No.1520 Zigzag Sum |
ユーザー |
|
提出日時 | 2021-05-28 20:38:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 94 ms / 2,000 ms |
コード長 | 3,460 bytes |
コンパイル時間 | 2,029 ms |
コンパイル使用メモリ | 197,572 KB |
最終ジャッジ日時 | 2025-01-21 19:09:54 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 7 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;template<class T> using V = vector<T>;using VI = V<int>;using VL = V<ll>;using VS = V<string>;template<class T> using PQ = priority_queue<T, V<T>, greater<T>>;using graph = V<VI>;template<class T> using w_graph = V<V<pair<int, T>>>;#define FOR(i,a,n) for(int i=(a);i<(n);++i)#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))#ifdef _DEBUG#define line cout << "-----------------------------\n"#define stop system("pause")#endifconstexpr ll INF = 1000000000;constexpr ll LLINF = 1LL << 60;constexpr ll mod = 1000000007;constexpr ll MOD = 998244353;constexpr ld eps = 1e-10;template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }template<class T>inline istream& operator>>(istream& is, V<T>& v) { for (auto& a : v)is >> a; return is; }template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }template<class T>inline V<T> vec(size_t a) { return V<T>(a); }template<class T>inline V<T> defvec(T def, size_t a) { return V<T>(a, def); }template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return V<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return V<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }template<class T>inline void print(const T& a) { cout << a << "\n"; }template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }template<class T>inline void print(const V<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }template<class T>inline void print(const V<V<T>>& v) { for (auto& a : v)print(a); }template<class T>inline T sum(const V<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }template<class T>inline void END(T s) { print(s); exit(0); }void END() { exit(0); }class combination {int n;ll c_mod;VL fac, finv, inv;public:combination(int n, ll c_mod) : n(n), c_mod(c_mod), fac(n), finv(n), inv(n) {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;FOR(i, 2, n) {fac[i] = fac[i - 1] * i % c_mod;inv[i] = c_mod - inv[c_mod % i] * (c_mod / i) % c_mod;finv[i] = finv[i - 1] * inv[i] % c_mod;}}ll operator()(int n, int k) {if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % c_mod) % c_mod;}};#include <atcoder/modint>using mint = atcoder::modint1000000007;int main() {init();int t; cin >> t;combination com(500000, mod);while (t--) {int h, w; cin >> h >> w;mint ans = 0;if (h + w - 4 >= 0 && h - 2 >= 0) {ans += mint(h + w - 3) * 2 * com(h + w - 4, h - 2);}print(ans.val());}return 0;}