結果
問題 | No.1093 区間の和 / Sum of Range |
ユーザー | Oland |
提出日時 | 2020-06-26 20:52:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 342 ms / 2,000 ms |
コード長 | 7,057 bytes |
コンパイル時間 | 2,545 ms |
コンパイル使用メモリ | 85,880 KB |
実行使用メモリ | 59,468 KB |
最終ジャッジ日時 | 2023-09-18 01:42:32 |
合計ジャッジ時間 | 13,384 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,596 KB |
testcase_01 | AC | 248 ms
56,880 KB |
testcase_02 | AC | 152 ms
53,952 KB |
testcase_03 | AC | 177 ms
54,844 KB |
testcase_04 | AC | 156 ms
54,292 KB |
testcase_05 | AC | 292 ms
57,672 KB |
testcase_06 | AC | 139 ms
54,716 KB |
testcase_07 | AC | 214 ms
57,040 KB |
testcase_08 | AC | 228 ms
56,648 KB |
testcase_09 | AC | 249 ms
58,496 KB |
testcase_10 | AC | 231 ms
57,068 KB |
testcase_11 | AC | 242 ms
57,908 KB |
testcase_12 | AC | 214 ms
54,544 KB |
testcase_13 | AC | 81 ms
52,236 KB |
testcase_14 | AC | 268 ms
57,552 KB |
testcase_15 | AC | 159 ms
54,396 KB |
testcase_16 | AC | 305 ms
57,340 KB |
testcase_17 | AC | 225 ms
58,024 KB |
testcase_18 | AC | 215 ms
57,524 KB |
testcase_19 | AC | 113 ms
53,924 KB |
testcase_20 | AC | 188 ms
57,244 KB |
testcase_21 | AC | 286 ms
59,120 KB |
testcase_22 | AC | 304 ms
59,468 KB |
testcase_23 | AC | 216 ms
58,448 KB |
testcase_24 | AC | 165 ms
54,804 KB |
testcase_25 | AC | 227 ms
57,736 KB |
testcase_26 | AC | 258 ms
58,684 KB |
testcase_27 | AC | 282 ms
58,020 KB |
testcase_28 | AC | 245 ms
57,656 KB |
testcase_29 | AC | 342 ms
59,456 KB |
testcase_30 | AC | 127 ms
54,492 KB |
testcase_31 | AC | 168 ms
54,908 KB |
testcase_32 | AC | 177 ms
54,904 KB |
testcase_33 | AC | 296 ms
57,756 KB |
testcase_34 | AC | 112 ms
53,228 KB |
testcase_35 | AC | 260 ms
59,172 KB |
testcase_36 | AC | 292 ms
59,056 KB |
ソースコード
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; } } }