Submission #1379791
Source Code Expand
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
Comb() {fac.resize(FAC_MAX, 1); ifac.resize(FAC_MAX, 1);rep(i, 1, FAC_MAX) fac[i] = fac[i - 1] * i;
rep(i, 1, FAC_MAX) ifac[i] = T(1) / fac[i];}
T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
return aCb(n + k - 1, k); }
};
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
∧_∧
∧_∧ (´<_` ) Welcome to My Coding Space!
( ´_ゝ`) / ⌒i
/ \ | |
/ / ̄ ̄ ̄ ̄/ |
__(__ニつ/ _/ .| .|____
\/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/
Comb<mint, 201010> com;
int N, M;
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> M;
mint ans = 0;
if (M == N) ans = com.aPb(N, N) * com.aPb(M, M) * 2;
else if (abs(N - M) == 1) ans = com.aPb(N, N) * com.aPb(M, M);
else ans = 0;
cout << ans.get() << endl;
}
Submission Info
Submission Time |
|
Task |
C - Reconciled? |
User |
hamayanhamayan |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
3374 Byte |
Status |
AC |
Exec Time |
63 ms |
Memory |
1792 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt, s4.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
63 ms |
1792 KB |
02.txt |
AC |
63 ms |
1792 KB |
03.txt |
AC |
63 ms |
1792 KB |
04.txt |
AC |
63 ms |
1792 KB |
05.txt |
AC |
63 ms |
1792 KB |
06.txt |
AC |
63 ms |
1792 KB |
07.txt |
AC |
63 ms |
1792 KB |
08.txt |
AC |
63 ms |
1792 KB |
09.txt |
AC |
63 ms |
1792 KB |
10.txt |
AC |
63 ms |
1792 KB |
11.txt |
AC |
63 ms |
1792 KB |
12.txt |
AC |
63 ms |
1792 KB |
s1.txt |
AC |
63 ms |
1792 KB |
s2.txt |
AC |
63 ms |
1792 KB |
s3.txt |
AC |
63 ms |
1792 KB |
s4.txt |
AC |
63 ms |
1792 KB |