結果

問題 No.243 出席番号(2)
ユーザー FF256grhy
提出日時 2019-11-13 22:41:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 4,574 bytes
コンパイル時間 1,665 ms
コンパイル使用メモリ 172,664 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-21 21:17:31
合計ジャッジ時間 4,365 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)
// ---- ----
template<LL M> class ModInt {
private:
    LL v;
public:
    ModInt(LL vv = 0) { v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }
    LL get_v() { return v; }
    ModInt exp(LL b) {
        ModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }
        while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }
        return p;
    }
    ModInt inv() { return ext_gcd(M, v).SE; }
    pair<LL, LL> ext_gcd(LL a, LL b) {
        if(b == 0) { assert(a == 1); return { 1, 0 }; }
        auto p = ext_gcd(b, a % b);
        return { p.SE, p.FI - (a / b) * p.SE };
    }
    friend bool      operator< (ModInt    a, ModInt   b) { return (a.v <  b.v); }
    friend bool      operator> (ModInt    a, ModInt   b) { return (a.v >  b.v); }
    friend bool      operator<=(ModInt    a, ModInt   b) { return (a.v <= b.v); }
    friend bool      operator>=(ModInt    a, ModInt   b) { return (a.v >= b.v); }
    friend bool      operator==(ModInt    a, ModInt   b) { return (a.v == b.v); }
    friend bool      operator!=(ModInt    a, ModInt   b) { return (a.v != b.v); }
    friend ModInt    operator+ (ModInt    a            ) { return ModInt(+a.v); }
    friend ModInt    operator- (ModInt    a            ) { return ModInt(-a.v); }
    friend ModInt    operator+ (ModInt    a, ModInt   b) { return ModInt(a.v + b.v); }
    friend ModInt    operator- (ModInt    a, ModInt   b) { return ModInt(a.v - b.v); }
    friend ModInt    operator* (ModInt    a, ModInt   b) { return ModInt(a.v * b.v); }
    friend ModInt    operator^ (ModInt    a, LL       b) { return a.exp(b); }
    friend ModInt    operator/ (ModInt    a, ModInt   b) { return a * b.inv(); }
    friend ModInt  & operator+=(ModInt  & a, ModInt   b) { return (a = a + b); }
    friend ModInt  & operator-=(ModInt  & a, ModInt   b) { return (a = a - b); }
    friend ModInt  & operator*=(ModInt  & a, ModInt   b) { return (a = a * b); }
    friend ModInt  & operator^=(ModInt  & a, LL       b) { return (a = a ^ b); }
    friend ModInt  & operator/=(ModInt  & a, ModInt   b) { return (a = a / b); }
    friend istream & operator>>(istream & s, ModInt & b) { s >> b.v; b = ModInt(b.v); return s; }
    friend ostream & operator<<(ostream & s, ModInt   b) { return (s << b.v); }
};
// ----
using MI = ModInt< 1'000'000'007 >;
int main() {
    int n;
    cin >> n;
    vector<MI> b(n);
    inc(i, n) {
        int a;
        cin >> a;
        if(a < n) { b[a] += 1; }
    }
    
    vector<MI> f(n + 1), r(n + 1), x(n + 1), y(n + 1);
    
    inc(i, n + 1) { f[i] = (i == 0 ? 1        : f[i - 1] * i      ); }
    dec(i, n + 1) { r[i] = (i == n ? 1 / f[n] : r[i + 1] * (i + 1)); }
    auto comb = [&](auto a, auto b) { return f[a] * r[b] * r[a - b]; };
    
    x[0] = 1;
    inc(i, n) {
    dec(j, i + 1) {
        x[j + 1] += x[j] * b[i];
    }
    }
    
    dec(i, n + 1) {
        y[i] = f[n - i] * x[i];
        incII(j, i + 1, n) { y[i] -= comb(j, i) * y[j]; }
    }
    
    cout << y[0] << endl;
    
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0