bela

Bela

ID: bela

Difficulty: 1.3

CPU Time: 1 second

Memory: 1024 MB

Solution

One can build two maps (for dominant and non-dominant values), and then loop over the 4N hands, and by reading the 2nd character to determine suit (B), add the appropriate value of the 1st character to a running total by performing a lookup based on whether it is or is not dominant.