Submission #62552091

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
from collections import Counter
n = int(input())
K = [(a[0], Counter(sorted(a[1:])))for a in [list(map(int, input().split())) for i in range(n)]]
ans = -1
for i in range(n):
  for j in range(i+1, n):
    # print(i, j)
    an = 0
    k, a = K[i]
    kk, aa = K[j]
    
    k, kk = min(k, kk), max(k, kk)
    a, aa = (a if len(a) < len(aa) else aa), (a if not(len(a) < len(aa)) else aa)
    for (key, value) in a.items():
      valueb = aa[key]
      # print(key,(value/k),(valueb/kk))
      an += (value/k) * (valueb/kk)
      # print("KV", key, value, valueb)
    # print(an)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

from collections import Counter
n = int(input())
K = [(a[0], Counter(sorted(a[1:])))for a in [list(map(int, input().split())) for i in range(n)]]

ans = -1
for i in range(n):
  for j in range(i+1, n):
    # print(i, j)
    an = 0
    k, a = K[i]
    kk, aa = K[j]
    
    k, kk = min(k, kk), max(k, kk)
    a, aa = (a if len(a) < len(aa) else aa), (a if not(len(a) < len(aa)) else aa)

    for (key, value) in a.items():
      valueb = aa[key]
      # print(key,(value/k),(valueb/kk))
      an += (value/k) * (valueb/kk)
      # print("KV", key, value, valueb)
    # print(an)
    ans = max(ans, an)

print(ans)
    
# print(K)

Submission Info

Judge Result