結果
問題 | No.1882 Areas of Triangle |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 21:42:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 340 ms / 2,000 ms |
コード長 | 1,530 bytes |
コンパイル時間 | 716 ms |
コンパイル使用メモリ | 86,592 KB |
実行使用メモリ | 109,212 KB |
最終ジャッジ日時 | 2023-08-18 00:17:43 |
合計ジャッジ時間 | 11,564 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
92,456 KB |
testcase_01 | AC | 239 ms
92,112 KB |
testcase_02 | AC | 237 ms
92,276 KB |
testcase_03 | AC | 238 ms
92,180 KB |
testcase_04 | AC | 340 ms
106,932 KB |
testcase_05 | AC | 320 ms
109,212 KB |
testcase_06 | AC | 300 ms
108,852 KB |
testcase_07 | AC | 239 ms
92,416 KB |
testcase_08 | AC | 241 ms
92,316 KB |
testcase_09 | AC | 239 ms
92,332 KB |
testcase_10 | AC | 240 ms
92,388 KB |
testcase_11 | AC | 240 ms
92,416 KB |
testcase_12 | AC | 238 ms
92,296 KB |
testcase_13 | AC | 238 ms
92,196 KB |
testcase_14 | AC | 238 ms
92,476 KB |
testcase_15 | AC | 237 ms
92,428 KB |
testcase_16 | AC | 246 ms
92,568 KB |
testcase_17 | AC | 249 ms
93,560 KB |
testcase_18 | AC | 249 ms
93,548 KB |
testcase_19 | AC | 253 ms
93,624 KB |
testcase_20 | AC | 262 ms
93,908 KB |
testcase_21 | AC | 255 ms
93,516 KB |
testcase_22 | AC | 268 ms
93,884 KB |
testcase_23 | AC | 281 ms
96,632 KB |
testcase_24 | AC | 272 ms
96,600 KB |
testcase_25 | AC | 243 ms
92,328 KB |
testcase_26 | AC | 238 ms
92,376 KB |
testcase_27 | AC | 239 ms
92,452 KB |
testcase_28 | AC | 240 ms
92,528 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N, K = i_map() A = i_list() A.sort() ans = 0 for i in range(N): p = ceil(K * 2 / A[i]) score = N - bisect_left(A, p) ans += score print(ans) if __name__ == '__main__': main()