Tournament Standings

Rank teams from match records. Each record has the form First;Second;result, with no extra spaces. Result is win, loss, or draw from First’s perspective. A win earns 3 points, a draw earns 1 per team, and a loss earns 0. Count matches played, wins, draws, losses, and points for each team that appears. Sort by descending points, then ascending team name (ASCII order).

Return one semicolon-separated row per team: Name;Played;Won;Drawn;Lost;Points. Do not include a header or alignment spaces.

Implement tournament_standings(matches).

Input

matches: Match records, in any order.

Output

Return ranked rows with the six fields described above. Write numbers without leading zeros.

Contraintes

0…10,000 valid records. Team names contain 1…30 ASCII letters and are case-sensitive. Each match has two different names. Repeated matches are separate games. Empty input gives an empty result.

Exemples

Entrée :
matches = ["Falcons;Bears;win", "Bears;Owls;draw"]

Sortie attendue :
expected = ["Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"]

Entrée :
std::vector<std::string> matches = {"Falcons;Bears;win", "Bears;Owls;draw"};

Sortie attendue :
std::vector<std::string> expected = {"Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"};

Entrée :
string[] matches = new string[] {"Falcons;Bears;win", "Bears;Owls;draw"};

Sortie attendue :
string[] expected = new string[] {"Falcons;1;1;0;0;3", "Bears;2;0;1;1;1", "Owls;1;0;1;0;1"};

Entrée :
matches = ["Zebras;Ants;loss"]

Sortie attendue :
expected = ["Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"]

Entrée :
std::vector<std::string> matches = {"Zebras;Ants;loss"};

Sortie attendue :
std::vector<std::string> expected = {"Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"};

Entrée :
string[] matches = new string[] {"Zebras;Ants;loss"};

Sortie attendue :
string[] expected = new string[] {"Ants;1;1;0;0;3", "Zebras;1;0;0;1;0"};

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Exercism: Tournament