結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー Shuz*Shuz*
提出日時 2019-11-29 22:27:08
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 129 ms / 2,000 ms
コード長 4,699 bytes
コンパイル時間 1,517 ms
コンパイル使用メモリ 169,216 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-14 05:49:31
合計ジャッジ時間 5,099 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge6
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
6,816 KB
testcase_01 AC 19 ms
6,940 KB
testcase_02 AC 3 ms
6,940 KB
testcase_03 AC 23 ms
6,940 KB
testcase_04 AC 27 ms
6,940 KB
testcase_05 AC 4 ms
6,940 KB
testcase_06 AC 46 ms
6,940 KB
testcase_07 AC 44 ms
6,944 KB
testcase_08 AC 110 ms
6,944 KB
testcase_09 AC 62 ms
6,940 KB
testcase_10 AC 74 ms
6,940 KB
testcase_11 AC 101 ms
6,940 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,944 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 2 ms
6,940 KB
testcase_17 AC 129 ms
6,940 KB
testcase_18 AC 22 ms
6,940 KB
testcase_19 AC 56 ms
6,944 KB
testcase_20 AC 41 ms
6,944 KB
testcase_21 AC 6 ms
6,944 KB
testcase_22 AC 3 ms
6,940 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,940 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 2 ms
6,940 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,940 KB
testcase_31 AC 3 ms
6,940 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 48 ms
6,940 KB
testcase_34 AC 80 ms
6,944 KB
testcase_35 AC 73 ms
6,944 KB
testcase_36 AC 17 ms
6,940 KB
testcase_37 AC 47 ms
6,940 KB
testcase_38 AC 46 ms
6,940 KB
testcase_39 AC 86 ms
6,940 KB
testcase_40 AC 96 ms
6,940 KB
testcase_41 AC 93 ms
6,940 KB
testcase_42 AC 71 ms
6,944 KB
testcase_43 AC 98 ms
6,940 KB
testcase_44 AC 29 ms
6,940 KB
testcase_45 AC 101 ms
6,944 KB
testcase_46 AC 9 ms
6,940 KB
testcase_47 AC 35 ms
6,944 KB
testcase_48 AC 28 ms
6,940 KB
testcase_49 AC 31 ms
6,940 KB
testcase_50 AC 41 ms
6,940 KB
testcase_51 AC 50 ms
6,944 KB
testcase_52 AC 50 ms
6,944 KB
testcase_53 AC 88 ms
6,944 KB
testcase_54 AC 18 ms
6,944 KB
testcase_55 AC 4 ms
6,940 KB
testcase_56 AC 64 ms
6,944 KB
testcase_57 AC 40 ms
6,944 KB
testcase_58 AC 2 ms
6,940 KB
testcase_59 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using vvector = vector<vector<T>>;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplase_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(i, h) {                                                            \
            rep(j, w) cerr << a[i][j] << sp;                                   \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(i, n) cerr << a[i] << (i == n - 1 ? rt : sp);                      \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1 << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

signed main() {
    ll N, Q, K;
    string S;
    cin >> N >> S;
    ll A[N + 1], B[N + 1];
    A[0] = B[0] = 0;
    rep(i, N) cin >> A[i + 1], A[i + 1] += A[i], B[i + 1] = S[i] == 'E',
                                                       B[i + 1] += B[i];
    cin >> Q;
    rep(i, Q) {
        cin >> K;
        ll res = 0;
        rep(j, N) {
            ll ok = j, ng = N + 1;
            while (ng - ok > 1) {
                ll md = (ok + ng) / 2;
                if (A[md] - A[j] <= K) {
                    ok = md;
                } else {
                    ng = md;
                }
            }
            chmax(res, B[ok] - B[j]);
        }
        cout << res << rt;
    }
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
0