結果
問題 | No.1882 Areas of Triangle |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 21:42:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 215 ms / 2,000 ms |
コード長 | 1,530 bytes |
コンパイル時間 | 221 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 104,960 KB |
最終ジャッジ日時 | 2024-05-05 07:09:32 |
合計ジャッジ時間 | 5,944 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
89,856 KB |
testcase_01 | AC | 138 ms
89,728 KB |
testcase_02 | AC | 136 ms
89,600 KB |
testcase_03 | AC | 134 ms
89,344 KB |
testcase_04 | AC | 215 ms
103,552 KB |
testcase_05 | AC | 198 ms
104,960 KB |
testcase_06 | AC | 189 ms
104,704 KB |
testcase_07 | AC | 141 ms
89,344 KB |
testcase_08 | AC | 133 ms
89,728 KB |
testcase_09 | AC | 134 ms
89,600 KB |
testcase_10 | AC | 133 ms
89,216 KB |
testcase_11 | AC | 132 ms
89,728 KB |
testcase_12 | AC | 134 ms
89,728 KB |
testcase_13 | AC | 144 ms
89,856 KB |
testcase_14 | AC | 137 ms
89,472 KB |
testcase_15 | AC | 133 ms
89,472 KB |
testcase_16 | AC | 138 ms
89,984 KB |
testcase_17 | AC | 141 ms
90,112 KB |
testcase_18 | AC | 142 ms
90,496 KB |
testcase_19 | AC | 148 ms
90,496 KB |
testcase_20 | AC | 149 ms
90,496 KB |
testcase_21 | AC | 142 ms
90,240 KB |
testcase_22 | AC | 148 ms
90,240 KB |
testcase_23 | AC | 170 ms
92,672 KB |
testcase_24 | AC | 163 ms
92,032 KB |
testcase_25 | AC | 136 ms
89,600 KB |
testcase_26 | AC | 138 ms
89,600 KB |
testcase_27 | AC | 141 ms
89,600 KB |
testcase_28 | AC | 136 ms
89,856 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()