Solution 1

Official Analysis

Solution 2 - Generating All Permutations

We can map the games to every possible permutation of the moves (hoof, paper, scissors) and find the sequence which gives us the maximum wins. This works because $1 \leq N \leq 100$.

Implementation

Time Complexity: $\mathcal{O}(N)$

Copy
from itertools import permutations
import sys

sys.stdin = open("hps.in", "r")
sys.stdout = open("hps.out", "w")

n = int(input())
games = []

games = [list(map(int, input().split())) for _ in range(n)]