結果

問題 No.603 hel__world (2)
ユーザー Sebastian KingSebastian King
提出日時 2017-12-03 15:02:21
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 3,433 bytes
コンパイル時間 1,880 ms
コンパイル使用メモリ 180,548 KB
実行使用メモリ 32,040 KB
最終ジャッジ日時 2024-11-28 13:12:20
合計ジャッジ時間 4,561 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
19,004 KB
testcase_01 AC 12 ms
18,828 KB
testcase_02 AC 13 ms
18,924 KB
testcase_03 AC 12 ms
19,032 KB
testcase_04 AC 11 ms
18,932 KB
testcase_05 AC 12 ms
18,872 KB
testcase_06 AC 12 ms
18,936 KB
testcase_07 AC 12 ms
18,836 KB
testcase_08 AC 11 ms
18,936 KB
testcase_09 AC 12 ms
18,972 KB
testcase_10 AC 13 ms
18,956 KB
testcase_11 AC 33 ms
26,084 KB
testcase_12 AC 32 ms
26,084 KB
testcase_13 AC 34 ms
26,080 KB
testcase_14 AC 14 ms
19,004 KB
testcase_15 AC 13 ms
18,936 KB
testcase_16 AC 14 ms
19,028 KB
testcase_17 AC 13 ms
18,956 KB
testcase_18 AC 13 ms
19,028 KB
testcase_19 AC 13 ms
18,832 KB
testcase_20 AC 21 ms
19,944 KB
testcase_21 AC 20 ms
19,944 KB
testcase_22 AC 12 ms
19,064 KB
testcase_23 AC 13 ms
18,956 KB
testcase_24 AC 13 ms
18,952 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 53 ms
32,040 KB
testcase_29 AC 17 ms
19,808 KB
testcase_30 AC 14 ms
19,368 KB
testcase_31 AC 13 ms
18,892 KB
testcase_32 AC 15 ms
19,812 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘ll gao(ll, std::vector<int>)’:
main.cpp:91:53: warning: narrowing conversion of ‘b.std::vector<long long int>::size()’ from ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} to ‘int’ [-Wnarrowing]
   91 |                 Q.push((node){y + 1, x.first, b.size()});
      |                                               ~~~~~~^~

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MM = 1e6 + 3;
const double eps = 1e-8;
const int MAXN = 2e6 + 10;
using int64 = long long;
using int128 = __int128;
const int N = 1e6 + 10;
const int mod = 1e6 + 3;
const int128 denom = 2e20;

int64 fac[mod], inv[mod];

int64 binom(int64 n, int64 m) {
  if (n < m) return 0;
  if (n == m || m == 0) return 1;
  int64 a = n % mod, b = m % mod;
  if (a < b) return 0;
  return fac[a] * inv[fac[b]] * inv[fac[a - b]] % mod * binom(n / mod, m / mod) % mod;
}

ll a[100];
vector<int> s[100];
string str;

int n, m;

void prework(){
  fac[0] = fac[1] = inv[1] = 1;
  for (int i = 2; i < mod; ++i) {
    fac[i] = i * fac[i - 1] % mod;
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
  }
}

void read(){}

struct node{
	__int128 y, x;
	int num;
};

bool operator < (const node & a, const node & b){
	return a.y * (b.y - b.x) < b.y * (a.y - a.x);
}

ll gao(ll S, vector<int> a){
	//cout << S << ' ' << a.size() << endl;
	ll __sm = 0;
	for (auto &x : a) __sm += x;
	sort(a.begin(), a.end());
	if (__sm > S) return 0ll;
	if (__sm == S) return 1ll;
	if (a.size() == 0) return 1ll;
	if (a.size() == 1)
		return binom(S, a[0]);
	__int128 limit = 1e20;
	__int128 l = limit + 1, r = limit * (a.back() + 2) + 1;
	vector<PII> c, ps;
	a.push_back(a.back() + 1);
	for (int i = 1, j = 0; i < a.size(); i++)
		if (a[i] != a[j]){
			c.push_back(PII(a[j], i - j));
			ps.push_back(PII(j, i));
			j = i;
		}
	a.pop_back();
	while(l + 1 < r){
		__int128 m = (r + l) / 2;
		__int128 tot = 0;
		for (auto &x : c){
			tot += x.first * m / (m - limit) * x.second;
			if (tot > S) break;
		}
		if (tot > S)
			l = m;
		else
			r = m;
	//	cout << (ll)tot << ' ' << S << endl;
	}
	vector<ll> b;
	vector<ll> finb(a.size());
	priority_queue<node> Q;
	for (auto &x : c){
		ll y = (ll)(x.first * r / (r - limit));
		Q.push((node){y + 1, x.first, b.size()});
		int l = ps[b.size()].first, r = ps[b.size()].second;
		for (int i = l; i < r; i++)
			finb[i] = y;
		S -= y * x.second;
		b.push_back(0);
	}
	assert(S >= 0);
	if (S >= a.size() * 3){
		while(!Q.empty()) Q.pop();
		for (int i = 0; i < c.size(); i++){
			b[i] += (S - a.size() * 3) / a.size();
			Q.push((node){b[i]+1, c[i].first, i});
		}
		S = (S - 3 * a.size()) % a.size() + 3 * a.size();
	}
	//cout << "!!!" << S << endl;
	while(S){
		node p = Q.top();
		Q.pop();
		if (S >= c[p.num].second){
			b[p.num]++;
			S -= c[p.num].second;
		}
		else{
			for (int l = ps[p.num].first, i = 0; i < S; i++){
				finb[l + i]++;
			}
			S = 0;
		}
		p.y++;
		Q.push(p);
	}
	for (int i = 0; i < c.size(); i++)
		for (int l = ps[i].first, r = ps[i].second, j = l; j < r; j++)
			finb[j] += b[i];
	ll ret = 1;
	for (int i = 0; i < a.size(); i++)
		ret = ret * binom(finb[i], a[i]) % mod;
	//cout << "?? " << S << ' ' << a.size() << ' ' << ret << endl;
	return ret;
}

void solve(int casi){
//	cout << "Case #" << casi << ": ";
	for (int i = 0; i < 26; i++)
		cin >> a[i];
	cin >> str;
	str += '+';
	for (int i = 1, j = 0; i < str.length(); i++){
		if (str[i] != str[j]){
			s[str[j]-'a'].push_back(i - j);
			j=i;
		}
	}
	ll ans = 1;
	for (int i = 0; i < 26; i++)
		ans = ans * gao(a[i], s[i]) % MM;
	cout << ans << endl;
}

void printans(){

}


int main(){
	std::ios::sync_with_stdio(false);
	prework();
	int T = 1;
//	cin>>T;
	for(int i = 1; i <= T; i++){
		read();
		solve(i);
		printans();
	}
	return 0;
}
0