Discussion @ 1100. Final Standings @ Timus Online Judge

Alex Svetkin [OrelSTU] I hated this problem :) [2] // Problem 1100. Final Standings 17 Oct 2004 20:53

Is there a way to solve this problem with complexity O(N), not O(N*M)? The first way always gets MLE: you need to store list of teams in dynamic array [1..100] which is obviously TLE. Grouping teams in buckets (so using only 1 pointer for ~400 teams) don't help either.

thwomass and your solution is.. [1] // Problem 1100. Final Standings 25 Oct 2004 20:18

And what is your solution for this problem?

Edited by author 25.10.2004 20:19

Alex Svetkin [OrelSTU] Re: and your solution is.. // Problem 1100. Final Standings 3 Nov 2004 02:00

Count sort + I stored scores and IDs in one longint (8 + 24 bits).

Discussion of Problem 1100. Final Standings