Tournament Win Counts

Given a tournament of m games, each played between two players with a known winner and margin, answer queries of the form: given two players, who won more matches? Asked in the pair programming round 2 stage. Part 1 is a simple hashmap solution returning -1 on a tie. Part 2 breaks ties transitively: if A and B never played but A beat C and C beat B, A wins, requiring DFS from both sides. Reported follow-ups: On a tie, resolve transitively via DFS from both players.

Use the games and match_queries tables for Part 1.

Output

1. One row per query, with query_id, player_a, player_b, and result.
2. Return 1 when player_a has more wins, 2 when player_b has more wins, and -1 on a tie.
3. Order by query_id ascending.