結果
問題 | No.852 連続部分文字列 |
ユーザー | penguinshunya |
提出日時 | 2020-01-26 10:25:08 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 857 ms / 3,153 ms |
コード長 | 2,919 bytes |
コンパイル時間 | 1,927 ms |
コンパイル使用メモリ | 174,172 KB |
実行使用メモリ | 109,720 KB |
最終ジャッジ日時 | 2023-10-12 12:00:25 |
合計ジャッジ時間 | 13,021 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,372 KB |
testcase_01 | AC | 1 ms
4,372 KB |
testcase_02 | AC | 1 ms
4,368 KB |
testcase_03 | AC | 1 ms
4,368 KB |
testcase_04 | AC | 1 ms
4,368 KB |
testcase_05 | AC | 1 ms
4,368 KB |
testcase_06 | AC | 2 ms
4,372 KB |
testcase_07 | AC | 2 ms
4,368 KB |
testcase_08 | AC | 2 ms
4,368 KB |
testcase_09 | AC | 1 ms
4,372 KB |
testcase_10 | AC | 2 ms
4,372 KB |
testcase_11 | AC | 1 ms
4,372 KB |
testcase_12 | AC | 2 ms
4,372 KB |
testcase_13 | AC | 15 ms
4,872 KB |
testcase_14 | AC | 7 ms
4,372 KB |
testcase_15 | AC | 25 ms
6,012 KB |
testcase_16 | AC | 15 ms
4,852 KB |
testcase_17 | AC | 21 ms
5,756 KB |
testcase_18 | AC | 26 ms
6,164 KB |
testcase_19 | AC | 3 ms
4,368 KB |
testcase_20 | AC | 12 ms
4,376 KB |
testcase_21 | AC | 27 ms
6,208 KB |
testcase_22 | AC | 9 ms
4,368 KB |
testcase_23 | AC | 19 ms
5,116 KB |
testcase_24 | AC | 11 ms
4,372 KB |
testcase_25 | AC | 18 ms
5,152 KB |
testcase_26 | AC | 26 ms
6,236 KB |
testcase_27 | AC | 16 ms
4,888 KB |
testcase_28 | AC | 21 ms
5,748 KB |
testcase_29 | AC | 27 ms
6,272 KB |
testcase_30 | AC | 6 ms
4,376 KB |
testcase_31 | AC | 28 ms
6,472 KB |
testcase_32 | AC | 29 ms
6,712 KB |
testcase_33 | AC | 853 ms
109,640 KB |
testcase_34 | AC | 851 ms
109,572 KB |
testcase_35 | AC | 848 ms
109,588 KB |
testcase_36 | AC | 849 ms
109,588 KB |
testcase_37 | AC | 857 ms
109,720 KB |
testcase_38 | AC | 853 ms
109,644 KB |
testcase_39 | AC | 849 ms
109,520 KB |
testcase_40 | AC | 849 ms
109,532 KB |
testcase_41 | AC | 847 ms
109,600 KB |
testcase_42 | AC | 650 ms
109,596 KB |
testcase_43 | AC | 629 ms
109,584 KB |
ソースコード
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit(b) (1ll << (b)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector<i32>; using vi64 = vector<i64>; using vu64 = vector<u64>; using vf80 = vector<f80>; using vstr = vector<string>; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {}; template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {}; template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; } template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; } template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; } template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; } template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; } template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } void solve() { string s; cin >> s; i64 n = s.size(); vector<vi32> prev(26, vi32(n + 1)); rep(i, n) { prev[s[i] - 'a'][i + 1] = i + 1; rep(j, 26) { amax(prev[j][i + 1], prev[j][i]); } } f80 ans = 0; reps(i, n) { vi32 v; rep(j, 26) v.push_back(prev[j][i]); sort(all(v)); reverse(all(v)); v.push_back(0); reps(j, 26) { ans += j * (v[j - 1] - v[j]); } } cout << ans / (n * (n + 1) / 2) << endl; }