#397607 (C++14) No.243 出席番号(2)

提出ソース

結果

問題	No.243 出席番号(2)
ユーザー	FF256grhy
提出日時	2019-11-11 23:45:16
言語	C++14 (gcc 10.1.0 + boost 1.73.0)
結果	AC
実行時間	182 ms / 2,000 ms
コード長	4,579 Byte
コンパイル時間	1,576 ms
使用メモリ	1,736 KB
最終ジャッジ日時	2020-07-02 23:22:13

テストケース

テストケース表示

入力	結果	実行時間使用メモリ
testcase_00	AC	2 ms 1,564 KB
testcase_01	AC	2 ms 1,560 KB
testcase_02	AC	2 ms 1,560 KB
testcase_03	AC	10 ms 1,604 KB
testcase_04	AC	9 ms 1,608 KB
testcase_05	AC	10 ms 1,608 KB
testcase_06	AC	9 ms 1,604 KB
testcase_07	AC	10 ms 1,608 KB
testcase_08	AC	31 ms 1,648 KB
testcase_09	AC	32 ms 1,644 KB
testcase_10	AC	32 ms 1,644 KB
testcase_11	AC	32 ms 1,644 KB
testcase_12	AC	31 ms 1,648 KB
testcase_13	AC	67 ms 1,684 KB
testcase_14	AC	67 ms 1,688 KB
testcase_15	AC	67 ms 1,688 KB
testcase_16	AC	67 ms 1,684 KB
testcase_17	AC	67 ms 1,684 KB
testcase_18	AC	117 ms 1,692 KB
testcase_19	AC	117 ms 1,692 KB
testcase_20	AC	117 ms 1,696 KB
testcase_21	AC	117 ms 1,692 KB
testcase_22	AC	122 ms 1,696 KB
testcase_23	AC	181 ms 1,736 KB
testcase_24	AC	181 ms 1,736 KB
testcase_25	AC	180 ms 1,732 KB
testcase_26	AC	182 ms 1,736 KB
testcase_27	AC	181 ms 1,736 KB
testcase_28	AC	2 ms 1,564 KB
testcase_29	AC	2 ms 1,560 KB
testcase_30	AC	2 ms 1,564 KB
testcase_31	AC	2 ms 1,564 KB
testcase_32	AC	2 ms 1,568 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 = 0;
public:
	ModInt() { }
	ModInt(LL vv) { setval(vv); }
	ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); }
	LL getval() const { return v; }
	ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }
	ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }
	ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }
	ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }
	ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }
	ModInt   operator+ (                ) const { return ModInt(+v); }
	ModInt   operator- (                ) const { return ModInt(-v); }
	ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }
	ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }
	ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }
	ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }
	ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }
	LL inv() const {
		LL x = (ex_gcd(v, M).FI + M) % M;
		assert(v * x % M == 1);
		return x;
	}
	LL ex(LL a, LU b) const {
		LL D = 64, x[64], y = 1;
		inc(i, D) { if((b >> i) == 0) { D = i; break; } }
		inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; }
		inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } }
		return y;
	}
	pair<LL, LL> ex_gcd(LL a, LL b) const {
		if(b == 0) { return MP(1, 0); }
		auto p = ex_gcd(b, a % b);
		return MP(p.SE, p.FI - (a / b) * p.SE);
	}
};
template<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return  b + a; }
template<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; }
template<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return  b * a; }
template<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return  a * b.inv(); }
template<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; }
template<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); }

// ---- ----

typedef ModInt<1'000'000'007> MI;

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;
}

yukicoder

結果

テストケース

ソースコード