One way to do the problem is by imitating the proof of the apple game theorem (or the pressing down lemma).

Another way is to use the function f to devise a strategy for the apple game in which you only get fined at such times a. Since we know you must get fined uncountably many times, there must be uncountably many such a's.