結果

問題 No.1093 区間の和 / Sum of Range
ユーザー neko_the_shadowneko_the_shadow
提出日時 2020-07-10 13:17:54
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,594 bytes
コンパイル時間 3,044 ms
コンパイル使用メモリ 85,872 KB
実行使用メモリ 67,084 KB
最終ジャッジ日時 2024-10-10 19:30:55
合計ジャッジ時間 30,902 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 91 ms
41,504 KB
testcase_01 AC 755 ms
52,484 KB
testcase_02 AC 478 ms
48,988 KB
testcase_03 AC 610 ms
56,716 KB
testcase_04 AC 451 ms
54,920 KB
testcase_05 WA -
testcase_06 AC 475 ms
49,328 KB
testcase_07 AC 657 ms
50,180 KB
testcase_08 AC 814 ms
57,284 KB
testcase_09 AC 742 ms
49,320 KB
testcase_10 AC 748 ms
54,728 KB
testcase_11 AC 873 ms
52,972 KB
testcase_12 AC 793 ms
56,092 KB
testcase_13 AC 198 ms
42,168 KB
testcase_14 AC 814 ms
49,408 KB
testcase_15 AC 479 ms
50,108 KB
testcase_16 AC 1,033 ms
65,568 KB
testcase_17 AC 706 ms
48,428 KB
testcase_18 AC 666 ms
49,116 KB
testcase_19 AC 315 ms
47,544 KB
testcase_20 AC 582 ms
48,360 KB
testcase_21 AC 897 ms
50,052 KB
testcase_22 AC 1,007 ms
55,268 KB
testcase_23 AC 728 ms
48,644 KB
testcase_24 AC 529 ms
54,156 KB
testcase_25 AC 844 ms
50,980 KB
testcase_26 AC 936 ms
65,816 KB
testcase_27 AC 827 ms
48,556 KB
testcase_28 AC 830 ms
55,752 KB
testcase_29 WA -
testcase_30 AC 409 ms
47,756 KB
testcase_31 AC 528 ms
50,540 KB
testcase_32 AC 590 ms
50,608 KB
testcase_33 AC 999 ms
55,332 KB
testcase_34 AC 308 ms
46,848 KB
testcase_35 AC 799 ms
58,252 KB
testcase_36 AC 1,020 ms
57,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.lang.reflect.Array;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.HashMap;
import java.util.Map;
import java.util.Objects;
import java.util.regex.Pattern;
import java.util.stream.Collectors;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int k = stdin.nextInt();
        long[] a = stdin.nextLongArray(n);

        long[] b = new long[n+1];
        for (int i = 0; i < n; i++) b[i+1] = b[i] + a[i];

        Map<Long, Long> c = new HashMap<>();
        for (int i = 0; i < n - k + 1; i++) {
            long sum = b[i+k]-b[i];
            if (c.containsKey(sum)) {
                c.put(sum, c.get(sum)+1);
            } else {
                c.put(sum, 1L);
            }
        }

        long[] d = c.keySet().stream().mapToLong(Long::longValue).sorted().toArray();
        int m = d.length;
        long[] e = new long[m];
        e[0] = c.get(d[0]);
        for (int i = 1; i < m; i++) {
            e[i] = e[i-1] + c.get(d[i]);
        }

        int q = stdin.nextInt();
        for (int i = 0; i < q; i++) {
            long x = stdin.nextInt();
            int p = Arrays.binarySearch(d, x);
            if (p >= 0) {
                stdout.println(e[p]);
            } else {
                p = -1 * (p + 1) - 1;
                if (p > 0) {
                    stdout.println(e[p]);
                } else {
                    stdout.println(0);
                }
            }
        }
    }

    private static final Stdin stdin = new Stdin();
    private static final Stdout stdout = new Stdout();

    public static void main(String[] args) {
        new Main().exec();
        stdout.flush();
    }

    public static class Stdin {
        private BufferedReader stdin;
        private Deque<String> tokens;
        private Pattern delim;

        public Stdin() {
            stdin = new BufferedReader(new InputStreamReader(System.in));
            tokens = new ArrayDeque<>();
            delim = Pattern.compile(" ");
        }

        public String nextString() {
            try {
                if (tokens.isEmpty()) {
                    String line = stdin.readLine();
                    delim.splitAsStream(line).forEach(tokens::addLast);
                }
                return tokens.pollFirst();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

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

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

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

        public String[] nextStringArray(int n) {
            String[] a = new String[n];
            for (int i = 0; i < n; i++) a[i] = nextString();
            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 double[] nextDoubleArray(int n) {
            double[] a = new double[n];
            for (int i = 0; i < n; i++) a[i] = nextDouble();
            return a;
        }

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

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout() {
            stdout =  new PrintWriter(System.out, false);
        }

        public void printf(String format, Object ... args) {
            stdout.printf(format, args);
        }

        public void println(Object ... objs) {
            String line = Arrays.stream(objs).map(this::deepToString).collect(Collectors.joining(" "));
            stdout.println(line);
        }

        private String deepToString(Object o) {
            if (o == null || !o.getClass().isArray()) {
                return Objects.toString(o);
            }

            int len = Array.getLength(o);
            String[] tokens = new String[len];
            for (int i = 0; i < len; i++) {
                tokens[i] = deepToString(Array.get(o, i));
            }
            return "{" + String.join(",", tokens) + "}";
        }

        public void flush() {
            stdout.flush();
        }
    }
}
0