041. World Cup (Harder Version)

Codeforces

IDCF10269041

Time1000ms

Memory256MB

Difficulty—

English · Original

Formal · Original

While watching the world cup, you wonder how many points each team has in the group stage. Recall that during the group stage teams are awarded three points for a win, one point for a tie, and zero points for a loss. For this problem, you're given a history of the games between all of the teams, and you must figure out how many group stage points each team has. The first line of input contains a single integer $n$: the number of games played. The next $n$ lines of input consist of two space-separated integers representing the two teams that played. After the integers on each line, one character will follow (after a space) indicating the result of the game. If the character is "W", the first team beat the second team. If the character is "T", the teams tied. (the character will never be "L", i.e. the first team will never lose) Output $m$ lines. On each line, print each team's name, and a single integer $p$: the number of group stage points that the team has. The teams should be sorted in order of their scores; if there is a tie, the tied teams should be sorted alphabetically. ## Input The first line of input contains a single integer $n$: the number of games played. The next $n$ lines of input consist of two space-separated integers representing the two teams that played. After the integers on each line, one character will follow (after a space) indicating the result of the game. If the character is "W", the first team beat the second team. If the character is "T", the teams tied. (the character will never be "L", i.e. the first team will never lose) ## Output Output $m$ lines. On each line, print each team's name, and a single integer $p$: the number of group stage points that the team has. The teams should be sorted in order of their scores; if there is a tie, the tied teams should be sorted alphabetically. [samples]

**Definitions** Let $ n \in \mathbb{Z}^+ $ be the number of games. Let $ G = \{ (T_{i,1}, T_{i,2}, r_i) \mid i \in \{1, \dots, n\} \} $ be the set of game results, where: - $ T_{i,1}, T_{i,2} $ are team identifiers (strings), - $ r_i \in \{ \text{W}, \text{T} \} $ is the result: - If $ r_i = \text{W} $, then $ T_{i,1} $ wins and $ T_{i,2} $ loses. - If $ r_i = \text{T} $, then both teams tie. Let $ \mathcal{S} $ be the set of all unique teams appearing in $ G $. **Constraints** 1. $ n \geq 1 $ 2. For each game $ i $, $ r_i \neq \text{L} $ **Objective** For each team $ s \in \mathcal{S} $, compute its total points $ p_s $: $$ p_s = 3 \cdot w_s + 1 \cdot t_s $$ where: - $ w_s $ = number of games in which $ s $ is the first team and $ r_i = \text{W} $, - $ t_s $ = number of games in which $ s $ appears (as either team) and $ r_i = \text{T} $. Output the teams sorted by $ p_s $ descending; for ties, sort alphabetically by team name.

API Response (JSON)

{
  "problem": {
    "name": "041. World Cup (Harder Version)",
    "description": {
      "content": "While watching the world cup, you wonder how many points each team has in the group stage. Recall that during the group stage teams are awarded three points for a win, one point for a tie, and zero po",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF10269041"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "While watching the world cup, you wonder how many points each team has in the group stage. Recall that during the group stage teams are awarded three points for a win, one point for a tie, and zero po...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of games.  \nLet $ G = \\{ (T_{i,1}, T_{i,2}, r_i) \\mid i \\in \\{1, \\dots, n\\} \\} $ be the set of game results, where:  \n- $ T_{i,1}, T_{i,2} $ ...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments