#220482 (C++14) No.603 hel__world (2)

• 問題: No.603 hel__world (2)
• ユーザー: okaduki
• 提出日時: 2017-12-03 04:16:44
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,327 bytes
• コンパイル時間: 1,897 ms
• コンパイル使用メモリ: 180,412 KB
• 実行使用メモリ: 18,396 KB
• 最終ジャッジ日時: 2024-11-28 08:23:40
• 合計ジャッジ時間: 3,807 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	WA	-
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	46 ms; 18,396 KB
testcase_12	AC	45 ms; 17,948 KB
testcase_13	AC	46 ms; 18,020 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	AC	150 ms; 5,248 KB
testcase_20	AC	8 ms; 5,248 KB
testcase_21	AC	7 ms; 5,248 KB
testcase_22	AC	2 ms; 5,248 KB
testcase_23	AC	9 ms; 5,248 KB
testcase_24	AC	12 ms; 5,248 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	7 ms; 5,248 KB
testcase_30	AC	303 ms; 5,248 KB
testcase_31	AC	2 ms; 5,248 KB
testcase_32	WA	-

ソースコード

#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e6+3;

using LLL = __int128;

LLL powm(LLL a, LLL b){
  return (b==0? 1: powm(a*a%MOD,b/2) * (b%2?a:1) % MOD);
}
LLL inv(LLL x){
  return powm(x, MOD-2);
}

LLL solve(LLL rest, LLL sum, VL& vs){
  if(rest == 0 || vs.empty()) return 1;

  LLL n = SZ(vs);
  if(rest >= n*(MOD-1)+1)
	return 0;
  
  using FRAC = pair<LLL,LLL>; // (first / second)
  auto lt = [](const FRAC& l, const FRAC& r){
	return l.first * r.second < r.first * l.second;
  };
  priority_queue<FRAC,vector<FRAC>,decltype(lt)> pq(lt);
  for(LL v: vs)
	pq.push(MP(v+1, 1));
  rest -= sum;

  LLL res = 1;
  while(rest){
	--rest;
	auto p = pq.top();
	pq.pop();

	if(p.FF >= MOD || res == 0) return 0;
	(res = res * p.first % MOD * inv(p.second)) %= MOD;

	pq.push(MP(p.first+1, p.second+1));
  }
  
  return res;
}

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  VL S(26);
  REP(i,26) cin >> S[i];

  string T;
  cin >> T;
  VL sum(26);
  VVL vs(26);

  REP(i,SZ(T)){
	int c = T[i] - 'a';
	sum[c]++;
	if(!i || T[i] != T[i-1])
	  vs[c].PB(1);
	else
	  vs[c].back()++;
  }

  REP(i,26) if(S[i] < sum[i]){
	cout << 0 << endl;
	return 0;
  }

  LLL ans = 1;
  REP(c,26){
	LLL res = solve(S[c], sum[c], vs[c]);
	(ans *= res) %= MOD;
  }
  cout << (LL)(ans) << endl;

  return 0;
}