結果
問題 | No.1280 Beyond C |
ユーザー | McGregorsh |
提出日時 | 2023-05-19 13:53:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 350 ms / 2,000 ms |
コード長 | 1,584 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 112,776 KB |
最終ジャッジ日時 | 2023-08-22 19:42:32 |
合計ジャッジ時間 | 8,422 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
92,312 KB |
testcase_01 | AC | 246 ms
92,008 KB |
testcase_02 | AC | 243 ms
92,040 KB |
testcase_03 | AC | 243 ms
92,272 KB |
testcase_04 | AC | 244 ms
92,016 KB |
testcase_05 | AC | 246 ms
91,968 KB |
testcase_06 | AC | 246 ms
92,192 KB |
testcase_07 | AC | 244 ms
92,236 KB |
testcase_08 | AC | 240 ms
92,188 KB |
testcase_09 | AC | 241 ms
92,028 KB |
testcase_10 | AC | 243 ms
92,172 KB |
testcase_11 | AC | 248 ms
93,004 KB |
testcase_12 | AC | 243 ms
92,292 KB |
testcase_13 | AC | 249 ms
92,792 KB |
testcase_14 | AC | 246 ms
93,308 KB |
testcase_15 | AC | 302 ms
107,232 KB |
testcase_16 | AC | 291 ms
104,884 KB |
testcase_17 | AC | 303 ms
107,652 KB |
testcase_18 | AC | 298 ms
110,468 KB |
testcase_19 | AC | 297 ms
110,008 KB |
testcase_20 | AC | 347 ms
112,392 KB |
testcase_21 | AC | 346 ms
112,596 KB |
testcase_22 | AC | 350 ms
112,776 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, M, C = i_map() A = i_list() B = i_list() A.sort() B.sort() total = M * N ans = 0 for i in range(N): p = C // A[i] + 1 score = M - bisect_left(B, p) ans += score print(ans / total) if __name__ == '__main__': main()