Editorial for DMOPC '20 Contest 1 P1 - Victor Gets Quizzed

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

For each string, iterate the characters and check if it contains M and/or S.

Time Complexity: $\mathcal O(\sum_{i=1}^N |S_i|)$ ~\mathcal O(\sum_{i=1}^N |S_i|)~

Comments

There are no comments at the moment.