結果
問題 | No.1845 Long Substrings |
ユーザー | heno239 |
提出日時 | 2022-02-18 22:25:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 49 ms / 2,000 ms |
コード長 | 4,764 bytes |
コンパイル時間 | 1,775 ms |
コンパイル使用メモリ | 148,960 KB |
実行使用メモリ | 14,152 KB |
最終ジャッジ日時 | 2024-06-29 09:17:00 |
合計ジャッジ時間 | 3,674 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
14,144 KB |
testcase_01 | AC | 36 ms
14,148 KB |
testcase_02 | AC | 45 ms
14,148 KB |
testcase_03 | AC | 45 ms
14,148 KB |
testcase_04 | AC | 36 ms
14,152 KB |
testcase_05 | AC | 43 ms
13,760 KB |
testcase_06 | AC | 44 ms
13,896 KB |
testcase_07 | AC | 38 ms
14,144 KB |
testcase_08 | AC | 47 ms
14,012 KB |
testcase_09 | AC | 45 ms
14,020 KB |
testcase_10 | AC | 35 ms
14,024 KB |
testcase_11 | AC | 43 ms
13,760 KB |
testcase_12 | AC | 43 ms
13,872 KB |
testcase_13 | AC | 35 ms
14,016 KB |
testcase_14 | AC | 45 ms
13,984 KB |
testcase_15 | AC | 18 ms
11,588 KB |
testcase_16 | AC | 17 ms
11,584 KB |
testcase_17 | AC | 17 ms
11,716 KB |
testcase_18 | AC | 18 ms
11,588 KB |
testcase_19 | AC | 18 ms
11,716 KB |
testcase_20 | AC | 19 ms
11,588 KB |
testcase_21 | AC | 18 ms
11,592 KB |
testcase_22 | AC | 18 ms
11,720 KB |
testcase_23 | AC | 18 ms
11,592 KB |
testcase_24 | AC | 18 ms
11,712 KB |
testcase_25 | AC | 18 ms
11,588 KB |
testcase_26 | AC | 17 ms
11,592 KB |
testcase_27 | AC | 17 ms
11,716 KB |
testcase_28 | AC | 18 ms
11,584 KB |
testcase_29 | AC | 18 ms
11,588 KB |
testcase_30 | AC | 19 ms
11,588 KB |
testcase_31 | AC | 18 ms
11,720 KB |
testcase_32 | AC | 19 ms
11,716 KB |
testcase_33 | AC | 18 ms
11,712 KB |
ソースコード
#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#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<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>#include<chrono>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;//constexpr ll mod = 998244353;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#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;template<typename T>void chmin(T& a, T b) {a = min(a, b);}template<typename T>void chmax(T& a, T b) {a = max(a, b);}template<typename T>void cinarray(vector<T>& v) {rep(i, v.size())cin >> v[i];}template<typename T>void coutarray(vector<T>& v) {rep(i, v.size()) {if (i > 0)cout << " "; cout << v[i];}cout << "\n";}ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;//if (x == 0)return 0;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {int n;modint() :n(0) { ; }modint(ll m) {if (m < 0 || mod <= m) {m %= mod; if (m < 0)m += mod;}n = m;}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)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 20;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];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll gcd(ll a, ll b) {a = abs(a); b = abs(b);if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-8;const ld pi = acosl(-1.0);template<typename T>void addv(vector<T>& v, int loc, T val) {if (loc >= v.size())v.resize(loc + 1, 0);v[loc] += val;}/*const int mn = 100005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}*///[,val)template<typename T>auto prev_itr(set<T>& st, T val) {auto res = st.lower_bound(val);if (res == st.begin())return st.end();res--; return res;}//[val,)template<typename T>auto next_itr(set<T>& st, T val) {auto res = st.lower_bound(val);return res;}using mP = pair<modint, modint>;int dx[4] = { 1,0,-1,0 };int dy[4] = { 0,1,0,-1 };//-----------------------------------------void solve() {int n; cin >> n;vector<ll> a(n); rep(i, n)cin >> a[i];string s; cin >> s;vector<modint> alf(26);vector<modint> dp(n);rep(i, n)dp[i] = a[i];rep(i, n) {int c = s[i] - 'a';dp[i] += alf[c]*(modint)a[i];rep(j, 26)if (j != c)alf[j] += dp[i];}modint ans = 0;rep(i, n)ans += dp[i];cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);init_f();//init();//while(true)//useexpr();//int t; cin >> t; rep(i, t)solve();return 0;}