제출 #754373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754373		komalrajputtrootech	새로운 문제 (POI11_pro)	Cpython 3	0 / 100	21 ms	2940 KiB

pro

total_time = 0

n, m, r, t, k = [2, 4, 3, 15, 4]
problem_pair = [[1,1],[2,3],[1,4],[1,3]]

users = {}
time = {}

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]))
        time[a] += r
    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()))
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