結果
問題 | No.1280 Beyond C |
ユーザー | McGregorsh |
提出日時 | 2023-05-19 13:52:09 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,590 bytes |
コンパイル時間 | 255 ms |
コンパイル使用メモリ | 86,820 KB |
実行使用メモリ | 113,256 KB |
最終ジャッジ日時 | 2023-08-22 19:41:43 |
合計ジャッジ時間 | 9,024 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
92,584 KB |
testcase_01 | AC | 231 ms
92,436 KB |
testcase_02 | AC | 232 ms
92,512 KB |
testcase_03 | AC | 234 ms
92,368 KB |
testcase_04 | AC | 230 ms
92,540 KB |
testcase_05 | AC | 235 ms
92,640 KB |
testcase_06 | AC | 229 ms
92,608 KB |
testcase_07 | AC | 232 ms
92,508 KB |
testcase_08 | AC | 230 ms
92,624 KB |
testcase_09 | AC | 232 ms
92,340 KB |
testcase_10 | AC | 230 ms
92,508 KB |
testcase_11 | AC | 236 ms
93,528 KB |
testcase_12 | AC | 231 ms
92,444 KB |
testcase_13 | AC | 235 ms
93,484 KB |
testcase_14 | AC | 235 ms
93,360 KB |
testcase_15 | AC | 299 ms
108,096 KB |
testcase_16 | AC | 280 ms
105,228 KB |
testcase_17 | AC | 290 ms
108,400 KB |
testcase_18 | AC | 302 ms
110,964 KB |
testcase_19 | WA | - |
testcase_20 | AC | 350 ms
113,256 KB |
testcase_21 | AC | 333 ms
113,128 KB |
testcase_22 | AC | 350 ms
113,164 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 = floor(C / A[i]) + 1 score = M - bisect_left(B, p) ans += score print(ans / total) if __name__ == '__main__': main()