結果
問題 | No.871 かえるのうた |
ユーザー | k_6101 |
提出日時 | 2019-12-07 17:29:04 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,633 bytes |
コンパイル時間 | 2,261 ms |
コンパイル使用メモリ | 77,500 KB |
実行使用メモリ | 75,220 KB |
最終ジャッジ日時 | 2023-08-26 21:59:33 |
合計ジャッジ時間 | 22,888 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 112 ms
55,300 KB |
testcase_01 | WA | - |
testcase_02 | AC | 114 ms
55,560 KB |
testcase_03 | AC | 122 ms
55,508 KB |
testcase_04 | WA | - |
testcase_05 | AC | 121 ms
55,804 KB |
testcase_06 | WA | - |
testcase_07 | AC | 123 ms
56,192 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 179 ms
60,984 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 913 ms
72,736 KB |
testcase_15 | WA | - |
testcase_16 | AC | 915 ms
74,564 KB |
testcase_17 | AC | 810 ms
72,456 KB |
testcase_18 | AC | 423 ms
63,728 KB |
testcase_19 | WA | - |
testcase_20 | AC | 271 ms
60,996 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 123 ms
55,916 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 121 ms
55,820 KB |
testcase_29 | AC | 597 ms
63,716 KB |
testcase_30 | WA | - |
testcase_31 | AC | 198 ms
60,100 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 443 ms
63,620 KB |
testcase_35 | WA | - |
testcase_36 | AC | 789 ms
71,964 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 605 ms
67,256 KB |
testcase_41 | AC | 114 ms
55,780 KB |
testcase_42 | AC | 482 ms
65,484 KB |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | AC | 114 ms
56,204 KB |
testcase_47 | AC | 116 ms
55,768 KB |
testcase_48 | AC | 114 ms
55,600 KB |
ソースコード
import java.io.InputStream; import java.io.PrintWriter; import java.lang.reflect.Array; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.Map; import java.util.Map.Entry; import java.util.PriorityQueue; import java.util.Scanner; import java.util.Set; import java.util.Stack; import java.util.TreeMap; import java.util.TreeSet; import static java.util.Comparator.*; public class Main { public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); Solver solver = new Solver(System.in, out); solver.solve(); out.close(); } } class Solver { Scanner sc; PrintWriter out; public Solver(InputStream in, PrintWriter out) { sc = new Scanner(in); this.out = out; } // ================================================================== TreeMap<Long, Long> map = new TreeMap<>(); public void solve() { int N = Integer.parseInt(sc.next()); int K = Integer.parseInt(sc.next()); long[] X = new long[N]; long[] A = new long[N]; for (int i = 0; i < N; i++) { X[i] = Long.parseLong(sc.next()); } for (int i = 0; i < N; i++) { A[i] = Long.parseLong(sc.next()); } for (int i = 0; i < N; i++) { map.put(X[i], A[i]); } long min = X[K-1]; long lkey = X[K-1] - A[K-1] - 1; Entry<Long, Long> low; while(true) { low = map.higherEntry(lkey); if(low == null || low.getKey() == min) break; // out.println(" low : min = " + min + " lkey = " + lkey // + " X = " + low.getKey() + " A = " + low.getValue()); min = low.getKey(); lkey = low.getKey() - low.getValue() - 1; } long max = X[K-1]; long rkey = X[K-1] + A[K-1] + 1; Entry<Long, Long> high; while(true) { high = map.lowerEntry(rkey); if(high == null || high.getKey() == max) break; // out.println(" high : max = " + max + " rkey = " + rkey // + " X = " + low.getKey() + " A = " + low.getValue()); max = high.getKey(); rkey = high.getKey() + high.getValue() + 1; } int ans = 0; for (int i = 0; i < N; i++) { if(X[i] >= min && X[i] <= max) ans++; } out.println(ans); } class PP{ public int key, val; public PP(int key, int val) { this.key = key; this.val = val; } public int getKey() { return key; } public void setKey(int key) { this.key = key; } public int getVal() { return val; } public void setVal(int val) { this.val = val; } } }