I am working on a POI problem: http://main.edu.pl/en/archive/oi/14/zap. I have an solution, but I would like to know whether there is an O(n·log(n) + a·log(a)) solution.

I am trying to implement Aho-Corasick on this problem in SPOJ: http://www.spoj.com/problems/SUB_PROB/

I am getting Wrong Answer with my code, but can't seem to figure out why. Here is a link to my code http://ideone.com/NUr1CX. Could someone help me out?