結果
問題 |
No.1110 好きな歌
|
ユーザー |
![]() |
提出日時 | 2020-07-10 21:51:06 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,802 ms / 5,000 ms |
コード長 | 2,591 bytes |
コンパイル時間 | 2,317 ms |
コンパイル使用メモリ | 79,936 KB |
実行使用メモリ | 64,948 KB |
最終ジャッジ日時 | 2024-10-11 08:54:54 |
合計ジャッジ時間 | 47,627 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); int n = sc.nextInt(); int d = sc.nextInt(); long[] arr = new long[n]; ArrayList<Long> a = new ArrayList<Long>(); for(int i = 0; i < n; i++){ long b = sc.nextLong(); arr[i] = b; a.add(b); } Collections.sort(a,Comparator.reverseOrder()); for(int i = 0; i < n; i++){ System.out.println(n-beamSearch(arr[i]-d,a)); } } public static int beamSearch(long d, ArrayList<Long> arr){ int left = 0; int right = arr.size(); while(right - left > 1){ int mid = (right + left) / 2; if(arr.get(mid) > d){ left = mid; }else{ right = mid; } } return right; } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }