結果
| 問題 | 
                            No.1093 区間の和 / Sum of Range
                             | 
                    
| ユーザー | 
                             neko_the_shadow
                         | 
                    
| 提出日時 | 2020-07-10 13:14:41 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                WA
                                 
                             
                            
                         | 
                    
| 実行時間 | - | 
| コード長 | 4,590 bytes | 
| コンパイル時間 | 3,912 ms | 
| コンパイル使用メモリ | 97,224 KB | 
| 実行使用メモリ | 64,636 KB | 
| 最終ジャッジ日時 | 2024-10-10 19:30:18 | 
| 合計ジャッジ時間 | 32,969 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge3 / judge2 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 1 | 
| other | AC * 34 WA * 2 | 
ソースコード
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();
        int[] a = stdin.nextIntArray(n);
        int[] b = new int[n+1];
        for (int i = 0; i < n; i++) b[i+1] = b[i] + a[i];
        Map<Integer, Integer> c = new HashMap<>();
        for (int i = 0; i < n - k + 1; i++) {
            int sum = b[i+k]-b[i];
            if (c.containsKey(sum)) {
                c.put(sum, c.get(sum)+1);
            } else {
                c.put(sum, 1);
            }
        }
        int[] d = c.keySet().stream().mapToInt(Integer::intValue).sorted().toArray();
        int m = d.length;
        int[] e = new int[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++) {
            int 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();
        }
    }
}
            
            
            
        
            
neko_the_shadow