oj.uz

Submission #754373

# Submission time Handle Problem Language Result Execution time Memory
754373 2023-06-07T15:16:44 Z komalrajputtrootech Programming Contest (POI11_pro) Python 3
0 / 100
 21 ms 2940 KB 
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.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2888 KB It was possible to solve 100 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 2868 KB It was possible to solve 95 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 2900 KB It was possible to solve 80 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2848 KB It was possible to solve 200 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 2940 KB It was possible to solve 494 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 2904 KB It was possible to solve 500 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2828 KB It was possible to solve 500 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2900 KB It was possible to solve 390 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2940 KB It was possible to solve 500 problems and you solved only 3.
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 2940 KB It was possible to solve 452 problems and you solved only 3.
2 Halted 0 ms 0 KB -