結果
問題 | No.295 hel__world |
ユーザー |
![]() |
提出日時 | 2020-08-22 22:48:42 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 36 ms / 5,000 ms |
コード長 | 5,393 bytes |
コンパイル時間 | 1,603 ms |
コンパイル使用メモリ | 132,568 KB |
実行使用メモリ | 21,444 KB |
最終ジャッジ日時 | 2024-10-15 12:24:55 |
合計ジャッジ時間 | 3,424 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 53 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 18;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}ul gcd(ul a, ul b) {if (a < b)swap(a, b);while (b) {ul r = a % b; a = b; b = r;}return a;}using UP = pair<ul, ul>;using speP = pair<UP, int>;ul sup = (ul)1 << 62;ul multi(ul a, ul b) {if (a == 0)return 0;if (sup / a < b)return sup;else return a * b;}ul calc(ul x, ul y) {if (x - y < y)y = x - y;if (y == 0)return 1;else if (y == 1)return x;vector<ul> v;rep(i, y) {v.push_back(x - i);}rep1(i, y) {ul cop = i;rep(j, v.size()) {if (cop == 1)break;ul g = gcd(v[j], cop);v[j] /= g; cop /= g;}}ul res = 1;rep(j, v.size()) {res = multi(res, v[j]);}return res;}ul calc(vector<int> vs, ul s){if (vs.empty())return 1;if (s == 0)return 1;vector<ul> cur(vs.size());//cout << "hello\n";ul sum = 0;rep(i, vs.size())sum += vs[i];ul d = s / sum;ul res = 1;s -= d * sum;//cout << s << " ?\n";auto comp = [](const speP a, const speP b) {ul cl = a.first.first * b.first.second;ul cr = a.first.second * b.first.first;if (cl != cr)return cl < cr;else return a.second < b.second;};priority_queue<speP, vector<speP>, function<bool(speP,speP)>> q([](speP a, speP b) {ul cl = a.first.first * b.first.second;ul cr = a.first.second * b.first.first;if (cl != cr)return cl < cr;else return a.second < b.second;});//cout << "hoee\n";rep(i, vs.size()) {cur[i] = vs[i] * d;ul x = vs[i] + cur[i];ul y = vs[i];ul z = calc(x, y);res = multi(res, z);if (res >= sup)return sup;ul g = gcd(vs[i], cur[i] + 1);q.push({ {(vs[i])/g,(cur[i] + 1)/g},i });}//cout << "?? " << res << "\n";rep (aa,s) {speP p = q.top(); q.pop();int id = p.second;//cout << p.first.first << " " << p.first.second << "\n";res /= p.first.second;res = multi(res, p.first.second+p.first.first);//cout << res << "\n";if (res >= sup)return sup;cur[id]++;ul g = gcd(vs[id], cur[id] + 1);q.push({ {vs[id]/g,(cur[id] + 1)/g},id });}//cout << res << "\n";return res;}void solve() {vector<ll> alf(26);rep(i, 26)cin >> alf[i];string s; cin >> s;string t; vector<int> num;rep(i, s.size()) {int cnt = 1;while (i + 1 < s.size() && s[i] == s[i + 1]) {cnt++; i++;}t.push_back(s[i]);num.push_back(cnt);}rep(i, t.size()) {alf[t[i] - 'a'] -= num[i];}rep(i, 26)if (alf[i] < 0) {cout << 0 << "\n"; return;}vector<int> nums[26];rep(i, t.size()) {nums[t[i] - 'a'].push_back(num[i]);}ul ans = 1;rep(i, 26) {//cout << char('a' + i) << "\n";ans = multi(ans, calc(nums[i], alf[i]));}if (ans >= sup)cout << "hel\n";else cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//expr();//int t; cin >> t; rep(i, t)//while (cin >> n >> m>>s1>>s2>>t, n)solve();return 0;}