結果

問題 No.1171 Runs in Subsequences
ユーザー satashunsatashun
提出日時 2020-08-14 21:47:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 10 ms / 2,000 ms
コード長 3,866 bytes
コンパイル時間 2,159 ms
コンパイル使用メモリ 204,504 KB
実行使用メモリ 6,036 KB
最終ジャッジ日時 2023-07-31 21:54:36
合計ジャッジ時間 3,357 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
4,924 KB
testcase_01 AC 4 ms
4,936 KB
testcase_02 AC 3 ms
4,992 KB
testcase_03 AC 4 ms
5,232 KB
testcase_04 AC 4 ms
5,028 KB
testcase_05 AC 3 ms
4,940 KB
testcase_06 AC 4 ms
4,912 KB
testcase_07 AC 4 ms
4,932 KB
testcase_08 AC 4 ms
4,976 KB
testcase_09 AC 4 ms
4,944 KB
testcase_10 AC 4 ms
4,980 KB
testcase_11 AC 4 ms
4,948 KB
testcase_12 AC 4 ms
5,004 KB
testcase_13 AC 3 ms
5,116 KB
testcase_14 AC 3 ms
4,932 KB
testcase_15 AC 9 ms
5,764 KB
testcase_16 AC 9 ms
5,820 KB
testcase_17 AC 9 ms
6,036 KB
testcase_18 AC 10 ms
5,824 KB
testcase_19 AC 9 ms
5,972 KB
testcase_20 AC 9 ms
5,920 KB
testcase_21 AC 10 ms
5,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }
    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    static uint get_mod() { return MOD; }
};

using Mint = ModInt<1000000007>;

const int maxn = 200010;
const Mint i2 = (Mint::get_mod() + 1) / 2;
Mint p2[maxn], ip2[maxn];

int main() {
    p2[0] = ip2[0] = 1;
    for (int i = 1; i < maxn; ++i)
        p2[i] = p2[i - 1] * 2, ip2[i] = ip2[i - 1] * i2;
    string S;
    cin >> S;
    int n = S.size();
    VV<int> pos(26);
    rep(i, n) pos[S[i] - 'a'].pb(i);

    Mint all = p2[n - 1] * n;
    Mint same;
    rep(i, 26) {
        Mint s;

        for (int v : pos[i]) {
            same += p2[n - v - 1] * s;
            s += p2[v];
        }
    }
    cout << all - same << endl;

    return 0;
}
0