結果
問題 | No.133 カードゲーム |
ユーザー | McGregorsh |
提出日時 | 2022-06-16 15:37:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 180 ms / 5,000 ms |
コード長 | 1,708 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 89,984 KB |
最終ジャッジ日時 | 2024-04-16 03:37:50 |
合計ジャッジ時間 | 5,307 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
83,072 KB |
testcase_01 | AC | 149 ms
83,584 KB |
testcase_02 | AC | 145 ms
83,584 KB |
testcase_03 | AC | 145 ms
83,328 KB |
testcase_04 | AC | 147 ms
83,200 KB |
testcase_05 | AC | 169 ms
89,728 KB |
testcase_06 | AC | 169 ms
89,856 KB |
testcase_07 | AC | 169 ms
89,856 KB |
testcase_08 | AC | 150 ms
83,584 KB |
testcase_09 | AC | 147 ms
83,456 KB |
testcase_10 | AC | 172 ms
89,728 KB |
testcase_11 | AC | 174 ms
89,344 KB |
testcase_12 | AC | 175 ms
89,856 KB |
testcase_13 | AC | 154 ms
83,200 KB |
testcase_14 | AC | 154 ms
83,456 KB |
testcase_15 | AC | 155 ms
83,200 KB |
testcase_16 | AC | 180 ms
89,984 KB |
testcase_17 | AC | 176 ms
89,728 KB |
testcase_18 | AC | 174 ms
89,728 KB |
testcase_19 | AC | 175 ms
89,856 KB |
testcase_20 | AC | 175 ms
89,600 KB |
testcase_21 | AC | 178 ms
89,984 KB |
testcase_22 | AC | 173 ms
89,728 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) a = i_list() b = i_list() ans = 0 total = 0 for per in permutations(range(n), n): A = list(per) for pers in permutations(range(n), n): B = list(pers) a_sum = 0 b_sum = 0 for i in range(n): if a[A[i]] > b[B[i]]: a_sum += 1 elif a[A[i]] < b[B[i]]: b_sum += 1 #print(a_sum, b_sum) if a_sum > b_sum: ans += 1 total += 1 print(ans/total) if __name__ == '__main__': main()