#668002 (C++11) No.1554 array_and_me

提出ソース

結果

問題	No.1554 array_and_me
ユーザー	leaf_1415
提出日時	2021-06-18 22:59:54
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	81 ms / 2,000 ms
コード長	6,961 bytes
コンパイル時間	1,144 ms
コンパイル使用メモリ	95,300 KB
実行使用メモリ	11,712 KB
最終ジャッジ日時	2024-06-22 21:14:47
合計ジャッジ時間	4,848 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 6,816 KB
testcase_01	AC	38 ms 7,664 KB
testcase_02	AC	36 ms 7,008 KB
testcase_03	AC	38 ms 7,696 KB
testcase_04	AC	39 ms 6,940 KB
testcase_05	AC	38 ms 6,940 KB
testcase_06	AC	79 ms 11,068 KB
testcase_07	AC	79 ms 10,940 KB
testcase_08	AC	77 ms 11,052 KB
testcase_09	AC	79 ms 11,452 KB
testcase_10	AC	81 ms 11,104 KB
testcase_11	AC	75 ms 11,064 KB
testcase_12	AC	76 ms 11,708 KB
testcase_13	AC	77 ms 11,064 KB
testcase_14	AC	79 ms 11,064 KB
testcase_15	AC	76 ms 11,712 KB
testcase_16	AC	5 ms 6,940 KB
testcase_17	AC	4 ms 6,944 KB
testcase_18	AC	5 ms 6,940 KB
testcase_19	AC	4 ms 6,940 KB
testcase_20	AC	4 ms 6,976 KB
testcase_21	AC	76 ms 6,940 KB
testcase_22	AC	75 ms 7,140 KB
testcase_23	AC	77 ms 6,940 KB
testcase_24	AC	76 ms 6,944 KB
testcase_25	AC	73 ms 6,940 KB
testcase_26	AC	79 ms 7,188 KB
testcase_27	AC	78 ms 7,108 KB
testcase_28	AC	77 ms 7,108 KB
testcase_29	AC	78 ms 8,028 KB
testcase_30	AC	78 ms 6,980 KB
testcase_31	AC	78 ms 7,252 KB
testcase_32	AC	78 ms 7,800 KB
testcase_33	AC	78 ms 6,976 KB
testcase_34	AC	77 ms 7,800 KB
testcase_35	AC	79 ms 7,132 KB
testcase_36	AC	75 ms 7,276 KB
testcase_37	AC	76 ms 7,108 KB
testcase_38	AC	76 ms 7,284 KB
testcase_39	AC	74 ms 6,988 KB
testcase_40	AC	74 ms 7,100 KB
testcase_41	AC	39 ms 6,940 KB

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

ソースコード

raw source code

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const ll mod = 1000000007;
const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<class S, class T> pair<S,T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
	s.first += t.first, s.second += t.second;
	return s;
}
template<class S, class T> pair<S,T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
	s.first -= t.first, s.second -= t.second;
	return s;
}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


const int FACT_MAX = 200005;
mint fact[FACT_MAX], fact_inv[FACT_MAX];

void make_fact()
{
	mint val = 1;
	fact[0] = 1;
	for(int i = 1; i < FACT_MAX; i++){
		val *= i;
		fact[i] = val;
	}
	fact_inv[FACT_MAX-1] = fact[FACT_MAX-1].inverse();
	for(int i = FACT_MAX-2; i >= 0; i--){
		fact_inv[i] = fact_inv[i+1] * (i+1);
	}
}

mint comb(ll n, ll k)
{
	mint ret = 1;
	ret *= fact[n];
	ret *= fact_inv[k];
	ret *= fact_inv[n-k];
	return ret;
}

typedef pair<P, ll> Q;

ll T;
ll n, k, sum;
ll a[100005], b[100005];

bool check(ll x)
{
	ll ret = 0;
	rep(i, 1, n) ret += x*a[i]/sum;
	return ret >= k;
}

bool comp(Q &a, Q &b)
{
	return a.first.first * b.first.second < a.first.second * b.first.first;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	make_fact();
	
	cin >> T;
	while(T--){
		cin >> n >> k;
		rep(i, 1, n) cin >> a[i];
		
		sum = 0;
		rep(i, 1, n) sum += a[i];
		
		ll ub = 1e14, lb = 0, mid;
		while(ub-lb>1){
			mid = (ub+lb)/2;
			if(check(mid)) ub = mid;
			else lb = mid;
		}
		
		ll cnt = -k;
		rep(i, 1, n) b[i] = ub*a[i]/sum, cnt += b[i];
		
		vector<Q> vec;
		rep(i, 1, n) vec.push_back(Q(P(b[i], a[i]), i));
		sort(all(vec), comp), reverse(all(vec));
		rep(i, 0, cnt-1) b[vec[i].second]--;
		
		mint ans = fact[k];
		rep(i, 1, n) ans /= fact[b[i]], ans *= modpow(mint(a[i]), b[i]);
		ans /= modpow(mint(sum), k);
		outl(ans);
	}
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード