結果
問題 | No.1280 Beyond C |
ユーザー | McGregorsh |
提出日時 | 2022-07-15 12:53:48 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,634 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 86,612 KB |
実行使用メモリ | 113,012 KB |
最終ジャッジ日時 | 2023-09-09 14:25:52 |
合計ジャッジ時間 | 10,047 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,184 KB |
testcase_01 | AC | 239 ms
92,104 KB |
testcase_02 | AC | 236 ms
91,964 KB |
testcase_03 | AC | 234 ms
91,908 KB |
testcase_04 | AC | 235 ms
92,140 KB |
testcase_05 | AC | 238 ms
91,920 KB |
testcase_06 | AC | 243 ms
91,952 KB |
testcase_07 | AC | 242 ms
92,140 KB |
testcase_08 | AC | 239 ms
91,968 KB |
testcase_09 | AC | 240 ms
92,124 KB |
testcase_10 | AC | 239 ms
92,020 KB |
testcase_11 | AC | 255 ms
92,996 KB |
testcase_12 | AC | 240 ms
92,052 KB |
testcase_13 | AC | 245 ms
92,944 KB |
testcase_14 | AC | 246 ms
93,100 KB |
testcase_15 | AC | 312 ms
107,372 KB |
testcase_16 | AC | 285 ms
104,844 KB |
testcase_17 | AC | 300 ms
108,100 KB |
testcase_18 | AC | 311 ms
110,548 KB |
testcase_19 | WA | - |
testcase_20 | AC | 363 ms
112,996 KB |
testcase_21 | AC | 340 ms
113,012 KB |
testcase_22 | AC | 358 ms
112,716 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 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() bunsi = 0 bunbo = n * m for i in range(n): num = c / A[i] point = m - bisect_right(B, num) #print(point) bunsi += point print(bunsi / bunbo) if __name__ == '__main__': main()