#421387 (C++14) No.766 金魚すくい

提出ソース

結果

問題	No.766 金魚すくい
ユーザー	ningenMe
提出日時	2020-01-25 16:44:07
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	72 ms / 1,500 ms
コード長	6,336 bytes
コンパイル時間	1,639 ms
コンパイル使用メモリ	176,364 KB
実行使用メモリ	10,596 KB
最終ジャッジ日時	2023-10-12 04:37:36
合計ジャッジ時間	6,727 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,352 KB
testcase_01	AC	2 ms 4,348 KB
testcase_02	AC	2 ms 4,348 KB
testcase_03	AC	1 ms 4,348 KB
testcase_04	AC	2 ms 4,352 KB
testcase_05	AC	2 ms 4,352 KB
testcase_06	AC	2 ms 4,348 KB
testcase_07	AC	1 ms 4,352 KB
testcase_08	AC	2 ms 4,348 KB
testcase_09	AC	2 ms 4,352 KB
testcase_10	AC	2 ms 4,352 KB
testcase_11	AC	1 ms 4,348 KB
testcase_12	AC	2 ms 4,352 KB
testcase_13	AC	2 ms 4,352 KB
testcase_14	AC	3 ms 4,348 KB
testcase_15	AC	2 ms 4,352 KB
testcase_16	AC	2 ms 4,348 KB
testcase_17	AC	3 ms 4,348 KB
testcase_18	AC	2 ms 4,348 KB
testcase_19	AC	3 ms 4,352 KB
testcase_20	AC	2 ms 4,348 KB
testcase_21	AC	2 ms 4,348 KB
testcase_22	AC	2 ms 4,348 KB
testcase_23	AC	68 ms 10,168 KB
testcase_24	AC	68 ms 10,184 KB
testcase_25	AC	72 ms 10,400 KB
testcase_26	AC	67 ms 10,244 KB
testcase_27	AC	72 ms 10,596 KB
testcase_28	AC	67 ms 9,980 KB
testcase_29	AC	68 ms 9,856 KB
testcase_30	AC	67 ms 10,284 KB
testcase_31	AC	72 ms 10,384 KB
testcase_32	AC	67 ms 9,956 KB
testcase_33	AC	56 ms 6,948 KB
testcase_34	AC	57 ms 7,004 KB
testcase_35	AC	14 ms 6,280 KB
testcase_36	AC	14 ms 6,052 KB
testcase_37	AC	68 ms 10,144 KB
testcase_38	AC	68 ms 10,184 KB
testcase_39	AC	70 ms 10,164 KB
testcase_40	AC	66 ms 10,288 KB
testcase_41	AC	47 ms 10,220 KB
testcase_42	AC	46 ms 10,184 KB
testcase_43	AC	1 ms 4,348 KB
testcase_44	AC	2 ms 4,348 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}


template<long long mod> class ModInt {
public:
	long long x;
	ModInt():x(0) {
		// do nothing
	}
	ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {
		// do nothing
	}
	ModInt &operator+=(const ModInt &p) {
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator+=(const long long y) {
        ModInt p(y);
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator+=(const int y) {
        ModInt p(y);
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const ModInt &p) {
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const long long y) {
        ModInt p(y);
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator-=(const int y) {
        ModInt p(y);
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}
	ModInt &operator*=(const ModInt &p) {
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator*=(const long long y) {
        ModInt p(y);
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator*=(const int y) {
        ModInt p(y);
		x = (x * p.x % mod);
		return *this;
	}
	ModInt &operator/=(const ModInt &p) {
		*this *= p.inv();
		return *this;
	}
	ModInt &operator/=(const long long y) {
        ModInt p(y);
		*this *= p.inv();
		return *this;
	}
	ModInt &operator/=(const int y) {
        ModInt p(y);
		*this *= p.inv();
		return *this;
	}
	ModInt operator=(const int y) {
        ModInt p(y);
        *this = p;
        return *this;
    }
    ModInt operator=(const long long y) {
        ModInt p(y);
		*this = p;
        return *this;
    }
	ModInt operator-() const { return ModInt(-x); }
	ModInt operator++() { 
        x++;
        if(x>=mod) x-=mod;
        return *this; 
    }
	ModInt operator--() { 
        x--;
        if(x<0) x+=mod;
        return *this; 
    }
	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
	bool operator==(const ModInt &p) const { return x == p.x; }
	bool operator!=(const ModInt &p) const { return x != p.x; }
	ModInt inv() const {
		int a = x, b = mod, u = 1, v = 0, t;
		while(b > 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}
	ModInt pow(long long n) const {
		ModInt ret(1), mul(x);
		while(n > 0) {
			if(n & 1) ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}
	friend ostream &operator<<(ostream &os, const ModInt &p) {
		return os << p.x;
	}
	friend istream &operator>>(istream &is, ModInt &a) {
		long long t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}
};
using modint = ModInt<MOD>;


//Combination Mod
class CombinationMod {
public:
	vector<long long> fac,finv,inv;
	long long mod;

	CombinationMod(int N,long long mod) : fac(N + 1), finv(N + 1), inv(N + 1), mod(mod) {
		fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
		for (int i = 2; i <= N; ++i) {
			fac[i] = fac[i - 1] * i % mod;
			inv[i] = mod - inv[mod%i] * (mod / i) % mod;
			finv[i] = finv[i - 1] * inv[i] % mod;
		}
	}
	
	long long num(int n, int k) {
		return ((n < 0 || k < 0 || n < k) ? 0 : fac[n] * (finv[k] * finv[n - k] % mod) % mod);
	}
};

//verify https://atcoder.jp/contests/abc021/tasks/abc021_d

int main() {
	int N,M,P; cin >> N >> M >> P;
	CombinationMod CM(N+M,MOD);
	modint p = P, q = 100 - P;
	p /= 100;
	q /= 100;
	vector<int> V(N+1,1000000001);
	vector<modint> C(N+1,0),A(N+1,1),B(M+1,1);
	for(int i = 0; i < N; ++i) cin >> V[i];
	sort(ALL(V),greater<>());
	for(int i = 1; i <= N; ++i) C[i] = V[i];
	for(int i = 1; i <= N; ++i) C[i] += C[i-1];
	for(int i = 1; i <= N; ++i) A[i] = A[i-1]*q;
	for(int i = 1; i <= M; ++i) B[i] = B[i-1]*p;
	modint ans = 0;
	for(int i = 1; i < N; ++i) {
		ans += C[i]*A[i]*B[M]*CM.num(i+M-1,i);
	}
	for(int i = 1; i <=M; ++i) {
		ans += C[N]*A[N]*B[i-1]*CM.num(N+i-2,N-1);
	}
	cout << ans << endl;


    return 0;
}

yukicoder

結果

テストケース

ソースコード