#403064 (C++14) No.935 う　し　た　ぷ　に　き　あくん笑　ビ　－　ム

提出ソース

結果

問題	No.935 う　し　た　ぷ　に　き　あくん笑　ビ　－　ム
ユーザー	ningenMe
提出日時	2019-11-30 03:35:04
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	117 ms / 2,000 ms
コード長	3,541 bytes
コンパイル時間	1,677 ms
コンパイル使用メモリ	172,524 KB
実行使用メモリ	5,376 KB
最終ジャッジ日時	2024-09-14 06:01:49
合計ジャッジ時間	4,408 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 5,248 KB
testcase_01	AC	7 ms 5,376 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	6 ms 5,376 KB
testcase_04	AC	7 ms 5,376 KB
testcase_05	AC	3 ms 5,376 KB
testcase_06	AC	26 ms 5,376 KB
testcase_07	AC	24 ms 5,376 KB
testcase_08	AC	58 ms 5,376 KB
testcase_09	AC	34 ms 5,376 KB
testcase_10	AC	41 ms 5,376 KB
testcase_11	AC	58 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	3 ms 5,376 KB
testcase_17	AC	117 ms 5,376 KB
testcase_18	AC	19 ms 5,376 KB
testcase_19	AC	48 ms 5,376 KB
testcase_20	AC	36 ms 5,376 KB
testcase_21	AC	6 ms 5,376 KB
testcase_22	AC	3 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	3 ms 5,376 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	3 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	3 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	28 ms 5,376 KB
testcase_34	AC	48 ms 5,376 KB
testcase_35	AC	42 ms 5,376 KB
testcase_36	AC	11 ms 5,376 KB
testcase_37	AC	29 ms 5,376 KB
testcase_38	AC	28 ms 5,376 KB
testcase_39	AC	51 ms 5,376 KB
testcase_40	AC	56 ms 5,376 KB
testcase_41	AC	55 ms 5,376 KB
testcase_42	AC	42 ms 5,376 KB
testcase_43	AC	58 ms 5,376 KB
testcase_44	AC	19 ms 5,376 KB
testcase_45	AC	58 ms 5,376 KB
testcase_46	AC	7 ms 5,376 KB
testcase_47	AC	23 ms 5,376 KB
testcase_48	AC	17 ms 5,376 KB
testcase_49	AC	20 ms 5,376 KB
testcase_50	AC	25 ms 5,376 KB
testcase_51	AC	31 ms 5,376 KB
testcase_52	AC	30 ms 5,376 KB
testcase_53	AC	51 ms 5,376 KB
testcase_54	AC	11 ms 5,376 KB
testcase_55	AC	4 ms 5,376 KB
testcase_56	AC	40 ms 5,376 KB
testcase_57	AC	25 ms 5,376 KB
testcase_58	AC	2 ms 5,376 KB
testcase_59	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N; cin >> N;
    string S; cin >> S;
    S = "." + S;
    vector<ll> A(N+1,0);
    for(int i = 1; i <= N; ++i) cin >> A[i];
    vector<ll> cnt(N+1,0),sum(N+1,0);
    for(int i = 1; i <= N; ++i) sum[i] = sum[i-1] + A[i];
    for(int i = 1; i <= N; ++i) cnt[i] = cnt[i-1] + (S[i]=='E');
    int Q; cin >> Q;
    vector<ll> ans;
    while(Q--){
        ll K; cin >> K;
        ll maxi = 0;
        for(int i = 1; i <= N; ++i){
            if(A[i]>K) continue;
            int ok = i, ng = N+1,md;
            while(ng-ok>1){
                md = (ok+ng)/2;
                int l = i, r = md;
                (sum[r]-sum[l-1]<=K?ok:ng)=md;
            }
            chmax(maxi,cnt[ok]-cnt[i-1]);
        }
        ans.push_back(maxi);
    }
    for(ll e:ans) cout << e << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード