結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー kissshot7kissshot7
提出日時 2020-07-21 23:37:33
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 415 ms / 2,000 ms
コード長 3,895 bytes
コンパイル時間 2,032 ms
コンパイル使用メモリ 179,956 KB
実行使用メモリ 83,520 KB
最終ジャッジ日時 2024-12-31 15:06:50
合計ジャッジ時間 10,770 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
7,872 KB
testcase_01 AC 31 ms
14,916 KB
testcase_02 AC 15 ms
17,604 KB
testcase_03 AC 68 ms
27,456 KB
testcase_04 AC 101 ms
43,328 KB
testcase_05 AC 25 ms
26,436 KB
testcase_06 AC 114 ms
27,336 KB
testcase_07 AC 108 ms
32,448 KB
testcase_08 AC 415 ms
79,172 KB
testcase_09 AC 175 ms
48,708 KB
testcase_10 AC 223 ms
52,672 KB
testcase_11 AC 334 ms
68,292 KB
testcase_12 AC 4 ms
7,620 KB
testcase_13 AC 4 ms
7,492 KB
testcase_14 AC 4 ms
7,492 KB
testcase_15 AC 4 ms
7,492 KB
testcase_16 AC 4 ms
7,616 KB
testcase_17 AC 397 ms
83,520 KB
testcase_18 AC 105 ms
50,500 KB
testcase_19 AC 137 ms
27,208 KB
testcase_20 AC 171 ms
63,940 KB
testcase_21 AC 14 ms
9,408 KB
testcase_22 AC 21 ms
23,108 KB
testcase_23 AC 4 ms
7,624 KB
testcase_24 AC 5 ms
8,260 KB
testcase_25 AC 5 ms
8,128 KB
testcase_26 AC 5 ms
8,256 KB
testcase_27 AC 4 ms
7,492 KB
testcase_28 AC 4 ms
7,744 KB
testcase_29 AC 5 ms
8,004 KB
testcase_30 AC 5 ms
7,744 KB
testcase_31 AC 4 ms
7,880 KB
testcase_32 AC 5 ms
8,392 KB
testcase_33 AC 218 ms
72,776 KB
testcase_34 AC 248 ms
52,800 KB
testcase_35 AC 252 ms
57,284 KB
testcase_36 AC 57 ms
29,508 KB
testcase_37 AC 185 ms
62,020 KB
testcase_38 AC 125 ms
27,716 KB
testcase_39 AC 299 ms
54,980 KB
testcase_40 AC 312 ms
56,772 KB
testcase_41 AC 337 ms
63,304 KB
testcase_42 AC 261 ms
65,088 KB
testcase_43 AC 348 ms
61,376 KB
testcase_44 AC 51 ms
13,888 KB
testcase_45 AC 378 ms
75,588 KB
testcase_46 AC 19 ms
9,924 KB
testcase_47 AC 74 ms
21,956 KB
testcase_48 AC 118 ms
50,112 KB
testcase_49 AC 74 ms
24,644 KB
testcase_50 AC 151 ms
48,712 KB
testcase_51 AC 154 ms
40,512 KB
testcase_52 AC 143 ms
39,752 KB
testcase_53 AC 361 ms
77,380 KB
testcase_54 AC 70 ms
40,256 KB
testcase_55 AC 9 ms
9,540 KB
testcase_56 AC 223 ms
55,496 KB
testcase_57 AC 122 ms
35,524 KB
testcase_58 AC 4 ms
7,620 KB
testcase_59 AC 4 ms
7,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
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 long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%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, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
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];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };




void solve() {
    int N; cin >> N;
    string s; cin >> s;
    vector<vector<LP>> v(N), vr(N);
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    int q; cin >> q;
    vector<ll> k(q);
    rep(i, q) cin >> k[i];

    rep(i, N){
        Rep(j, i, N){
            ll cnt = (s[j] == 'E') ? 1 : 0;
            if(j == i) v[i].push_back(make_pair(a[j], cnt));
            else v[i].push_back(make_pair(v[i].back().first + a[j], v[i].back().second + cnt));
        }
    }
    reverse(all(a));
    reverse(all(s));
    rep(i, N){
        Rep(j, i, N){
            ll cnt = (s[j] == 'E') ? 1 : 0;
            if(j == i) vr[i].push_back(make_pair(a[j], cnt));
            else vr[i].push_back(make_pair(vr[i].back().first + a[j], vr[i].back().second + cnt));
        }
    }

    rep(i, q){
        ll res = 0;
        rep(j, N){
            auto it = upper_bound(all(v[j]), make_pair(k[i], INF));
            if(it != v[j].begin()){
                --it;
                res = max(res, (*it).second);
            }
        }

        rep(j, N){
            auto it = upper_bound(all(v[j]), make_pair(k[i], INF));
            if(it != v[j].begin()){
                --it;
                res = max(res, (*it).second);
            }
        }
        cout << res << endl;
    }
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}
0