結果
問題 | No.794 チーム戦 (2) |
ユーザー |
![]() |
提出日時 | 2019-02-23 10:30:05 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 59 ms / 1,500 ms |
コード長 | 4,360 bytes |
コンパイル時間 | 1,926 ms |
コンパイル使用メモリ | 175,388 KB |
実行使用メモリ | 12,736 KB |
最終ジャッジ日時 | 2024-11-28 22:26:27 |
合計ジャッジ時間 | 4,638 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
#include<bits/stdc++.h>#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()//#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------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> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };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;ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}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); }}; // nHk = (n+k-1)Ck : n is separatortypedef ModInt<1000000007> mint;/*---------------------------------------------------------------------------------------------------∧_∧∧_∧ (´<_` ) Welcome to My Coding Space!( ´_ゝ`) / ⌒i/ \ | |/ / ̄ ̄ ̄ ̄/ |__(__ニつ/ _/ .| .|____\/____/ (u ⊃---------------------------------------------------------------------------------------------------*/int N, K, A[201010];mint dp[201010];Comb<mint, 1010101> com;//---------------------------------------------------------------------------------------------------mint solve() {if (K <= A[N - 1]) return 0;if (A[N - 1] <= K / 2) return com.fac[N] / com.fac[N/2] / (mint(2)^(N/2));mint ans = 1;int L = 0;int used = 0;rrep(R, N - 1, 0) if (K / 2 < A[R]) {while (A[L] + A[R] <= K) L++;int cand = L;if (cand - used <= 0) return 0;ans *= mint(cand - used);used++;}int rest = N - used * 2;ans *= com.fac[rest] / com.fac[rest / 2] / (mint(2) ^ (rest / 2));return ans;}//---------------------------------------------------------------------------------------------------void _main() {cin >> N >> K;rep(i, 0, N) cin >> A[i];sort(A, A + N);cout << solve() << endl;}