Submission #754379

#	Time	Username	Problem	Language	Result	Execution time	Memory
754379		komalrajputtrootech	Programming Contest (POI11_pro)	Cpython 3	0 / 100	1076 ms	63776 KiB

pro

import sys
n, m, r, t, k = map(int, sys.stdin.readline().split())
problem_pair = []
for i in range(k):
    problem_pair.append(map(int, sys.stdin.readline().split()))

users = {}
time = {}
total_time = r
for idx,(a,b) in enumerate(problem_pair):
    if a not in users.keys():
        users[a] = []
        time[a] = 0
        users[a].append((b, time[a]))
    else:
        users[a].append((b, time[a]))
    time[a] += r

user_list = []
user_task = set()

for task in range(1,1+m):
    for key, c in users.items():
        for tsk in c:
            tsk = (key, ) + tsk
            user_task.add(tsk)


user_task = list(user_task)
user_task.sort(key = lambda x: x[2])


seen = {}
new_tuples = []

for tup in user_task:
    if tup[1] not in seen:
        new_tuples.append(tup)
        seen[tup[1]] = True

print(len(new_tuples), sum(time.values())-r)
for task in new_tuples:
    print(*task)

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10