結果
問題 | No.1882 Areas of Triangle |
ユーザー | Asahi |
提出日時 | 2023-05-31 18:49:44 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 173 ms / 2,000 ms |
コード長 | 5,598 bytes |
コンパイル時間 | 2,785 ms |
コンパイル使用メモリ | 80,880 KB |
実行使用メモリ | 41,376 KB |
最終ジャッジ日時 | 2024-06-08 21:11:13 |
合計ジャッジ時間 | 6,162 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
36,720 KB |
testcase_01 | AC | 49 ms
37,288 KB |
testcase_02 | AC | 46 ms
37,040 KB |
testcase_03 | AC | 50 ms
37,052 KB |
testcase_04 | AC | 163 ms
40,612 KB |
testcase_05 | AC | 173 ms
41,376 KB |
testcase_06 | AC | 107 ms
39,420 KB |
testcase_07 | AC | 47 ms
36,816 KB |
testcase_08 | AC | 49 ms
36,808 KB |
testcase_09 | AC | 49 ms
36,800 KB |
testcase_10 | AC | 48 ms
37,028 KB |
testcase_11 | AC | 49 ms
36,880 KB |
testcase_12 | AC | 50 ms
36,952 KB |
testcase_13 | AC | 47 ms
37,172 KB |
testcase_14 | AC | 49 ms
36,820 KB |
testcase_15 | AC | 48 ms
37,148 KB |
testcase_16 | AC | 48 ms
37,176 KB |
testcase_17 | AC | 50 ms
37,272 KB |
testcase_18 | AC | 52 ms
36,952 KB |
testcase_19 | AC | 84 ms
39,056 KB |
testcase_20 | AC | 85 ms
38,844 KB |
testcase_21 | AC | 85 ms
38,788 KB |
testcase_22 | AC | 85 ms
38,624 KB |
testcase_23 | AC | 112 ms
39,228 KB |
testcase_24 | AC | 134 ms
39,696 KB |
testcase_25 | AC | 50 ms
37,172 KB |
testcase_26 | AC | 48 ms
36,876 KB |
testcase_27 | AC | 48 ms
37,020 KB |
testcase_28 | AC | 48 ms
37,228 KB |
ソースコード
import java.util.*; import java.io.*; class Main{ void solve(PrintWriter out, In in) { int n = in.nextInt() ; long K = in.nextLong(); long [] A = in.LongArray(n); Arrays.sort(A); long ans = 0; // K = 1/2(H*W) -> 2K = H*W -> 2K/H = W for(int i = 0 ; i < n ; i ++ ) { int idx = lower_bound(A,((2*K+A[i]-1)/A[i])); ans += n - idx; } out.print(ans); } /* Library */ int lower_bound(long [] A , long key) { int left = 0; int right = A.length; while(left < right) { int mid = (left + right) / 2; if(A[mid] < key) left = mid + 1; else right = mid; } return right; } /* ------- */ public static void main(String[] args) { PrintWriter out = new PrintWriter(System.out); In in = new In(); new Main().solve(out,in); out.flush(); } final long MOD7 = 1000000007; final long MOD9 = 998244353 ; final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0}; final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1}; final int Inf = (int)1e9; final long Lnf = (long)1e18; final String yes = "Yes"; final String no = "No"; } /* Class */ /* ----- */ class Pair{ private int first ; private int second; Pair(int first,int second) { this.first = first; this.second = second; } int first() { return this.first ; } int second() { return this.second; } @Override public String toString(){ return first()+" = "+second(); } } class PairII { private int first ; private int second ; private int third; PairII(int first, int second, int third) { this.first = first; this.second = second; this.third = third; } int first() { return this.first ; } int second() { return this.second; } int third() { return this.third ; } @Override public String toString(){ return first()+" = "+second()+" = "+third() ; } } class In{ 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(); } 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(); } 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(); } } int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } double nextDouble() { return Double.parseDouble(next()); } int [] IntArray(int n) { final int [] Array = new int [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = nextInt(); } return Array; } int [][] IntArray(int n , int m) { final int [][] Array = new int [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = IntArray(m); } return Array; } long [] LongArray(int n) { final long [] Array = new long [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = nextLong(); } return Array; } long [][] LongArray(int n , int m) { final long [][] Array = new long [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = LongArray(m); } return Array; } String [] StringArray(int n) { final String [] Array = new String [n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next(); } return Array; } char [] CharArray(int n) { final char [] Array = new char[n]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next().charAt(0); } return Array; } char [][] CharArray(int n , int m) { final char [][] Array = new char [n][m]; for(int i = 0 ; i < n ; i ++ ) { Array[i] = next().toCharArray(); } return Array; } }