結果
問題 | No.1882 Areas of Triangle |
ユーザー | 37zigen |
提出日時 | 2022-03-25 21:31:28 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 190 ms / 2,000 ms |
コード長 | 2,766 bytes |
コンパイル時間 | 3,113 ms |
コンパイル使用メモリ | 77,684 KB |
実行使用メモリ | 40,940 KB |
最終ジャッジ日時 | 2024-10-14 05:22:45 |
合計ジャッジ時間 | 6,038 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
36,840 KB |
testcase_01 | AC | 53 ms
37,016 KB |
testcase_02 | AC | 54 ms
36,788 KB |
testcase_03 | AC | 54 ms
37,016 KB |
testcase_04 | AC | 190 ms
40,612 KB |
testcase_05 | AC | 155 ms
40,940 KB |
testcase_06 | AC | 114 ms
39,568 KB |
testcase_07 | AC | 52 ms
37,048 KB |
testcase_08 | AC | 51 ms
36,772 KB |
testcase_09 | AC | 52 ms
37,040 KB |
testcase_10 | AC | 52 ms
36,836 KB |
testcase_11 | AC | 52 ms
36,664 KB |
testcase_12 | AC | 52 ms
36,724 KB |
testcase_13 | AC | 52 ms
36,668 KB |
testcase_14 | AC | 51 ms
36,860 KB |
testcase_15 | AC | 54 ms
36,836 KB |
testcase_16 | AC | 53 ms
36,936 KB |
testcase_17 | AC | 55 ms
36,968 KB |
testcase_18 | AC | 57 ms
36,668 KB |
testcase_19 | AC | 88 ms
38,772 KB |
testcase_20 | AC | 88 ms
38,656 KB |
testcase_21 | AC | 89 ms
38,528 KB |
testcase_22 | AC | 88 ms
38,728 KB |
testcase_23 | AC | 111 ms
38,976 KB |
testcase_24 | AC | 122 ms
39,460 KB |
testcase_25 | AC | 52 ms
36,952 KB |
testcase_26 | AC | 53 ms
36,916 KB |
testcase_27 | AC | 52 ms
36,552 KB |
testcase_28 | AC | 52 ms
36,680 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main implements Runnable { public static void main(String[] args) { new Main().run(); } public void run() { solve(); } void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); long K=sc.nextLong(); long[] A=new long[N]; for (int i=0;i<N;++i) A[i]=sc.nextLong(); Arrays.sort(A); long ans=0; int t=N-1; for (int i=0;i<N;++i) { while (t>=0&&A[t]*A[i]>=2*K)--t; if (A[i]*A[N-1]<2*K) continue; ans+=N-1-t; } System.out.println(ans); pw.close(); } static void tr(Object...objects) { System.out.println(Arrays.deepToString(objects)); } } 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }