結果

問題 No.1433 Two color sequence
ユーザー shojin_proshojin_pro
提出日時 2021-03-19 22:00:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 358 ms / 2,000 ms
コード長 5,111 bytes
コンパイル時間 2,766 ms
コンパイル使用メモリ 86,860 KB
実行使用メモリ 65,960 KB
最終ジャッジ日時 2024-11-18 22:19:49
合計ジャッジ時間 10,603 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
50,260 KB
testcase_01 AC 58 ms
50,172 KB
testcase_02 AC 56 ms
50,424 KB
testcase_03 AC 231 ms
58,252 KB
testcase_04 AC 242 ms
58,264 KB
testcase_05 AC 57 ms
50,540 KB
testcase_06 AC 56 ms
50,120 KB
testcase_07 AC 59 ms
50,064 KB
testcase_08 AC 331 ms
64,988 KB
testcase_09 AC 323 ms
65,508 KB
testcase_10 AC 338 ms
65,960 KB
testcase_11 AC 335 ms
65,680 KB
testcase_12 AC 342 ms
64,640 KB
testcase_13 AC 327 ms
65,568 KB
testcase_14 AC 320 ms
65,260 KB
testcase_15 AC 358 ms
65,520 KB
testcase_16 AC 355 ms
65,492 KB
testcase_17 AC 357 ms
65,476 KB
testcase_18 AC 335 ms
64,876 KB
testcase_19 AC 328 ms
65,516 KB
testcase_20 AC 354 ms
65,588 KB
testcase_21 AC 338 ms
65,392 KB
testcase_22 AC 331 ms
65,604 KB
testcase_23 AC 338 ms
65,504 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) throws Exception {
        if (args.length == 1 && args[0].equals("debug")) {
            FileReader filereader;
            BufferedReader is;
            String path = new File(".").getAbsoluteFile().getParent();
            String input = path + File.separator + "_debug_";
            String output = path + File.separator + "_answer_" + File.separator;
            File[] list = new File(input).listFiles();
            for (File file : list) {
                filereader = new FileReader(file);
                sc = new FastScanner(filereader);
                pw.println(file.getName());
                pw.println("----------------------------------------");
                pw.println("output");
                long start = System.currentTimeMillis();
                solve();
                if (new File(output + file.getName()).exists()) {
                    pw.println("----------------------------------------");
                    pw.println("expect");
                    filereader = new FileReader(new File(output + file.getName()));
                    is = new BufferedReader(filereader);
                    String s;
                    while ((s = is.readLine()) != null) {
                        pw.println(s);
                    }
                }
                pw.println("----------------------------------------");
                pw.println((System.currentTimeMillis() - start) + "ms\n");
            }
        } else {
            solve();
        }
        pw.flush();
    }

    public static void solve() {
        int n = sc.nextInt();
        char[] c = sc.next().toCharArray();
        long[] a = sc.nextLongArray(n);
        long min = 0;
        long max = 0;
        long now = 0;
        long[] cum = new long[n+1];
        for(int i = 0; i < n; i++){
            if(c[i] == 'B'){
                now += a[i];
            }else{
                now -= a[i];
            }
            min = Math.min(min,now);
            max = Math.max(max,now);
        }
        pw.println(max-min);
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

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

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