結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー OlandOland
提出日時 2019-11-29 22:57:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 410 ms / 2,000 ms
コード長 7,735 bytes
コンパイル時間 2,656 ms
コンパイル使用メモリ 86,412 KB
実行使用メモリ 56,544 KB
最終ジャッジ日時 2023-10-12 06:31:27
合計ジャッジ時間 16,665 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 121 ms
53,228 KB
testcase_01 AC 166 ms
53,552 KB
testcase_02 AC 106 ms
53,556 KB
testcase_03 AC 189 ms
53,704 KB
testcase_04 AC 171 ms
53,196 KB
testcase_05 AC 109 ms
53,072 KB
testcase_06 AC 228 ms
53,828 KB
testcase_07 AC 209 ms
53,460 KB
testcase_08 AC 363 ms
55,864 KB
testcase_09 AC 273 ms
56,104 KB
testcase_10 AC 329 ms
56,304 KB
testcase_11 AC 395 ms
56,268 KB
testcase_12 AC 55 ms
49,776 KB
testcase_13 AC 54 ms
50,284 KB
testcase_14 AC 55 ms
49,776 KB
testcase_15 AC 54 ms
49,888 KB
testcase_16 AC 54 ms
49,908 KB
testcase_17 AC 410 ms
56,544 KB
testcase_18 AC 161 ms
53,308 KB
testcase_19 AC 288 ms
53,964 KB
testcase_20 AC 253 ms
55,840 KB
testcase_21 AC 114 ms
52,932 KB
testcase_22 AC 97 ms
53,248 KB
testcase_23 AC 66 ms
50,948 KB
testcase_24 AC 70 ms
51,100 KB
testcase_25 AC 72 ms
51,180 KB
testcase_26 AC 60 ms
50,700 KB
testcase_27 AC 59 ms
49,828 KB
testcase_28 AC 92 ms
52,800 KB
testcase_29 AC 88 ms
52,968 KB
testcase_30 AC 72 ms
51,428 KB
testcase_31 AC 70 ms
51,296 KB
testcase_32 AC 99 ms
53,116 KB
testcase_33 AC 277 ms
56,232 KB
testcase_34 AC 358 ms
56,244 KB
testcase_35 AC 337 ms
56,284 KB
testcase_36 AC 151 ms
53,180 KB
testcase_37 AC 271 ms
56,208 KB
testcase_38 AC 213 ms
53,668 KB
testcase_39 AC 336 ms
53,644 KB
testcase_40 AC 367 ms
55,804 KB
testcase_41 AC 385 ms
56,268 KB
testcase_42 AC 328 ms
56,496 KB
testcase_43 AC 390 ms
56,168 KB
testcase_44 AC 194 ms
53,668 KB
testcase_45 AC 365 ms
55,764 KB
testcase_46 AC 128 ms
53,576 KB
testcase_47 AC 206 ms
53,496 KB
testcase_48 AC 243 ms
56,244 KB
testcase_49 AC 179 ms
53,372 KB
testcase_50 AC 212 ms
53,740 KB
testcase_51 AC 238 ms
53,200 KB
testcase_52 AC 232 ms
53,128 KB
testcase_53 AC 338 ms
55,936 KB
testcase_54 AC 148 ms
53,208 KB
testcase_55 AC 105 ms
53,028 KB
testcase_56 AC 300 ms
55,652 KB
testcase_57 AC 219 ms
53,656 KB
testcase_58 AC 54 ms
49,736 KB
testcase_59 AC 55 ms
50,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.Arrays;
import java.util.Scanner;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b;}
    
    void solve(){
        int N = in.nextInt();
        String S = "#" + in.nextStr();
        int[] accS = new int[N+1];
        for(int i = 1; i <= N; i++) accS[i] = accS[i-1] + (S.charAt(i) == 'E' ? 1 : 0);
        int[] A = in.nextIntArray1Index(N);
        long[] accA = new long[N+1];
        for(int i = 1; i <= N; i++) accA[i] = accA[i-1] + A[i];
        
        int Q = in.nextInt();
        for(int i = 0; i < Q; i++){
            int K = in.nextInt();
            int max = 0;
            for(int j = 0; j <= N; j++){
                if(j < N){
                    int ok = j, ng = N + 1;
                    while(Math.abs(ok - ng) > 1){
                        int mid = (ok + ng) / 2;
                        long P = accA[mid] - accA[j];
                        if(P <= K) ok = mid;
                        else ng = mid;
                    }
                    int num = accS[ok] - accS[j];
                    max = Math.max(max, num);
                }
                if(j > 0){
                    int ok = j, ng = -1;
                    while(Math.abs(ok - ng) > 1){
                        int mid = (ok + ng) / 2;
                        long P = accA[j] - accA[mid];
                        if(P <= K) ok = mid;
                        else ng = mid;
                    }
                    int num = accS[j] - accS[ok];
                    max = Math.max(max, num);
                }
            }
            out.println(max);
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }

    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "output.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }

    static class FastScanner {
        private Reader input;

        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

        public int nextInt() {return (int) nextLong();}

        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0