제출 #754387

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

pro

n, m, r, t, k = map(int, input().split())

problems_solved = [0] * n
time_remaining = [t] * m
contestant_assigned = [-1] * m
starting_time = [-1] * m

for _ in range(k):
    a, b = map(int, input().split())
    a -= 1  # Adjust index to 0-based
    b -= 1  # Adjust index to 0-based
    contestant_assigned[b] = a

for problem in range(m - 1, -1, -1):
    for contestant in range(n):
        if contestant_assigned[problem] == -1 and time_remaining[problem] >= r:
            if contestant in range(n) and problem in range(m):
                problems_solved[contestant] += 1
                time_remaining[problem] -= r
                contestant_assigned[problem] = contestant
                starting_time[problem] = t - time_remaining[problem]
                break

total_penal_points = sum(starting_time)

print(sum(problems_solved), total_penal_points)
for problem in range(m):
    if starting_time[problem] != -1:
        print(contestant_assigned[problem] + 1, problem + 1, starting_time[problem])

• 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