結果
問題 | No.343 手抜き工事のプロ |
ユーザー | uwi |
提出日時 | 2016-02-12 22:40:36 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 3,317 bytes |
コンパイル時間 | 4,298 ms |
コンパイル使用メモリ | 89,008 KB |
実行使用メモリ | 54,808 KB |
最終ジャッジ日時 | 2023-10-22 03:16:15 |
合計ジャッジ時間 | 7,108 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
53,300 KB |
testcase_01 | AC | 54 ms
53,340 KB |
testcase_02 | AC | 56 ms
53,344 KB |
testcase_03 | AC | 56 ms
53,328 KB |
testcase_04 | AC | 54 ms
53,340 KB |
testcase_05 | AC | 56 ms
53,340 KB |
testcase_06 | AC | 54 ms
53,332 KB |
testcase_07 | AC | 55 ms
52,324 KB |
testcase_08 | AC | 53 ms
53,340 KB |
testcase_09 | AC | 54 ms
53,340 KB |
testcase_10 | AC | 55 ms
53,340 KB |
testcase_11 | AC | 54 ms
53,328 KB |
testcase_12 | AC | 54 ms
52,324 KB |
testcase_13 | AC | 61 ms
52,340 KB |
testcase_14 | AC | 53 ms
53,344 KB |
testcase_15 | AC | 54 ms
52,272 KB |
testcase_16 | AC | 53 ms
53,336 KB |
testcase_17 | AC | 53 ms
53,344 KB |
testcase_18 | AC | 54 ms
53,356 KB |
testcase_19 | AC | 53 ms
53,332 KB |
testcase_20 | AC | 59 ms
53,364 KB |
testcase_21 | AC | 81 ms
54,172 KB |
testcase_22 | AC | 79 ms
53,904 KB |
testcase_23 | AC | 89 ms
54,764 KB |
testcase_24 | AC | 91 ms
54,748 KB |
testcase_25 | AC | 90 ms
54,808 KB |
testcase_26 | AC | 99 ms
54,708 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); int L = ni(); int[] x = new int[n]; for(int i = 1;i < n;i++)x[i] = ni(); for(int i = 0;i < n-1;i++){ if(Math.abs(x[i+1] - x[i]) >= L){ out.println(-1); return; } } long w = 0; int num = n-1; for(int i = n-1;i >= 0;i--){ if(i <= n-2){ // a[i] < w/2/(n-1-i) < a[i]+L if( x[i] * 2L * (n-1-i) < w && w < (x[i] + L) * 2L * (n-1-i) && x[i+1] * 2L * (n-1-i) < w && w < (x[i+1] + L) * 2L * (n-1-i) ){ num--; } } w += x[i] + x[i] + L; } out.println(num); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }