We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Itertools
  4. Maximize It!
  5. Discussions

Maximize It!

  • maxence_qnt
     + 0 comments

    After several try, I finally pass this Hard problem with the following code. It's maybe possible to improve it in term of time complexity. The logic is to take all product possibilities using the itertool.product() method, then, with a temp value, see if the current result is better than the output.

    # Enter your code here. Read input from STDIN. Print output to STDOUT
from itertools import product

K, M = map(int, input().split())

all_lists = []

for i in range(K):
    all_lists.append(list(map(int, input().split()[1:])))

#print(all_lists)

for sub_list in all_lists:
    sub_list.sort() 



#all_product_possibilities = list(product(*all_lists))
# print(all_product_possibilities[:5])

output = 0

#print("-------------------------")

for possible_product in list(product(*all_lists)):
    current_product = list(possible_product)
    #print(f"current_product = {current_product}")
    temp = 0
    for values in current_product:
        temp += values**2
    
    temp = temp%M
    #print(f"Temp: {temp}")
    #print(f"Output: {output}")
    if temp > output:
        output = temp
    else:
        continue
    #print(f"Current Output = {output}")
print(output)