結果

問題 No.1093 区間の和 / Sum of Range
ユーザー OlandOland
提出日時 2020-06-26 20:52:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 321 ms / 2,000 ms
コード長 7,057 bytes
コンパイル時間 2,079 ms
コンパイル使用メモリ 79,520 KB
実行使用メモリ 47,944 KB
最終ジャッジ日時 2024-07-04 18:40:06
合計ジャッジ時間 12,875 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
37,272 KB
testcase_01 AC 231 ms
44,344 KB
testcase_02 AC 152 ms
42,220 KB
testcase_03 AC 184 ms
41,848 KB
testcase_04 AC 153 ms
41,328 KB
testcase_05 AC 285 ms
47,596 KB
testcase_06 AC 149 ms
41,968 KB
testcase_07 AC 207 ms
43,624 KB
testcase_08 AC 217 ms
43,240 KB
testcase_09 AC 239 ms
47,944 KB
testcase_10 AC 213 ms
43,508 KB
testcase_11 AC 236 ms
45,580 KB
testcase_12 AC 209 ms
43,760 KB
testcase_13 AC 68 ms
38,116 KB
testcase_14 AC 245 ms
45,680 KB
testcase_15 AC 154 ms
41,832 KB
testcase_16 AC 273 ms
46,512 KB
testcase_17 AC 205 ms
46,992 KB
testcase_18 AC 205 ms
43,780 KB
testcase_19 AC 105 ms
40,128 KB
testcase_20 AC 180 ms
43,592 KB
testcase_21 AC 255 ms
47,556 KB
testcase_22 AC 299 ms
47,624 KB
testcase_23 AC 216 ms
45,596 KB
testcase_24 AC 167 ms
41,536 KB
testcase_25 AC 226 ms
46,132 KB
testcase_26 AC 234 ms
45,092 KB
testcase_27 AC 260 ms
47,848 KB
testcase_28 AC 239 ms
44,292 KB
testcase_29 AC 321 ms
46,268 KB
testcase_30 AC 127 ms
41,452 KB
testcase_31 AC 158 ms
41,852 KB
testcase_32 AC 182 ms
42,920 KB
testcase_33 AC 284 ms
47,580 KB
testcase_34 AC 113 ms
39,868 KB
testcase_35 AC 231 ms
47,688 KB
testcase_36 AC 283 ms
47,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.BigDecimal;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    
    void solve(){
        int N = in.nextInt(), K = in.nextInt();
        int[] a = in.nextIntArray(N);
        
        int[] S = new int[N-K+2];
        for(int i = 0; i < K; i++) S[0] += a[i];
        for(int i = 1; i < N - K + 1; i++) S[i] = S[i-1] + a[i+K-1] - a[i-1];
        S[N-K+1] = Integer.MAX_VALUE / 2;
        Arrays.sort(S);
        
        int Q = in.nextInt();
        for(int i = 0; i < Q; i++){
            int x = in.nextInt();
            int ok = N - K + 1, ng = -1;
            while(ok - ng > 1){
                int mid = (ok + ng) / 2;
                if(S[mid] > x) ok = mid;
                else ng = mid;
            }
            out.println(ok);
        }
    }
    
    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 = "input.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() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        
        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