結果
問題 | No.871 かえるのうた |
ユーザー | kitakitalily |
提出日時 | 2019-08-30 22:51:23 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,729 bytes |
コンパイル時間 | 2,299 ms |
コンパイル使用メモリ | 77,920 KB |
実行使用メモリ | 52,820 KB |
最終ジャッジ日時 | 2024-05-01 19:42:44 |
合計ジャッジ時間 | 8,234 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,756 KB |
testcase_01 | AC | 50 ms
36,580 KB |
testcase_02 | AC | 50 ms
36,324 KB |
testcase_03 | AC | 50 ms
36,540 KB |
testcase_04 | AC | 51 ms
36,496 KB |
testcase_05 | AC | 51 ms
36,896 KB |
testcase_06 | AC | 52 ms
36,716 KB |
testcase_07 | AC | 50 ms
36,584 KB |
testcase_08 | AC | 59 ms
36,532 KB |
testcase_09 | AC | 57 ms
36,416 KB |
testcase_10 | AC | 51 ms
36,960 KB |
testcase_11 | AC | 53 ms
36,564 KB |
testcase_12 | AC | 90 ms
38,632 KB |
testcase_13 | AC | 62 ms
37,040 KB |
testcase_14 | AC | 154 ms
40,796 KB |
testcase_15 | AC | 151 ms
40,384 KB |
testcase_16 | AC | 163 ms
40,600 KB |
testcase_17 | AC | 149 ms
40,420 KB |
testcase_18 | AC | 84 ms
38,112 KB |
testcase_19 | WA | - |
testcase_20 | AC | 71 ms
37,880 KB |
testcase_21 | AC | 114 ms
39,656 KB |
testcase_22 | AC | 54 ms
36,724 KB |
testcase_23 | AC | 51 ms
36,624 KB |
testcase_24 | AC | 51 ms
36,684 KB |
testcase_25 | AC | 54 ms
36,872 KB |
testcase_26 | AC | 72 ms
37,912 KB |
testcase_27 | AC | 75 ms
38,384 KB |
testcase_28 | AC | 51 ms
36,648 KB |
testcase_29 | AC | 106 ms
39,872 KB |
testcase_30 | AC | 131 ms
39,912 KB |
testcase_31 | AC | 58 ms
36,784 KB |
testcase_32 | AC | 122 ms
39,924 KB |
testcase_33 | AC | 143 ms
40,720 KB |
testcase_34 | AC | 92 ms
38,104 KB |
testcase_35 | AC | 118 ms
39,436 KB |
testcase_36 | AC | 136 ms
40,592 KB |
testcase_37 | AC | 115 ms
39,912 KB |
testcase_38 | AC | 151 ms
40,204 KB |
testcase_39 | WA | - |
testcase_40 | AC | 101 ms
39,712 KB |
testcase_41 | AC | 52 ms
36,580 KB |
testcase_42 | AC | 101 ms
39,588 KB |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 52 ms
36,452 KB |
testcase_46 | AC | 50 ms
36,284 KB |
testcase_47 | AC | 51 ms
36,932 KB |
testcase_48 | AC | 49 ms
36,896 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args){ FastScanner scanner = new FastScanner(); int n = scanner.nextInt(); int k = scanner.nextInt()-1; long[] x = new long[n]; long[] a = new long[n]; for(int i = 0; i < n; i++){ x[i] = scanner.nextLong(); } for(int i = 0; i < n; i++){ a[i] = scanner.nextLong(); } long min = x[k]-a[k]; long max = x[k]+a[k]; for(int i = k; i >= 0; i--){ if(x[i] >= min){ min = Math.min(min,x[i]-a[i]); max = Math.max(max,x[i]+a[i]); } } for(int i = k; i < n; i++){ if(x[i] <= max){ min = Math.min(min,x[i]-a[i]); max = Math.max(max,x[i]+a[i]); } } int start = -1; int end = n; for(int i = 0; i < n; i++){ if(x[i] >= min){ start = i; break; } } for(int i = n-1; i >= 0; i--){ if(x[i] <= max){ end = i; break; } } if(start == end){ if(n == 1){ System.out.println(1); return; }else{ if(start >= 0 && end < n){ System.out.println(1); }else{ System.out.println(0); } } }else if(start != end && start >= 0 && end < n){ System.out.println(end-start+1); } } public static int upperBound(long[] array, long value) { int low = 0; int high = array.length; int mid; while( low < high ) { mid = ((high - low) >>> 1) + low; // (high + low) / 2 if( array[mid] <= value ) { low = mid + 1; } else { high = mid; } } return low; } public static final int lowerBound(final long[] arr, final long value) { int low = 0; int high = arr.length; int mid; while (low < high){ mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策) if (arr[mid] < value) { low = mid + 1; } else { high = mid; } } return low; } private static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} } }