codeforces Gym 100338F Spam Filter

#include<bits/stdc++.h>
using namespace std;

typedef long double ld;
map<string,int> spam,good;
set<string> once;
int s,g,n,T;
const int maxn = 205;
char str[maxn],word[maxn];

int sscan_l(char *w,char *&s)
{
    while(isalpha(*s) == 0){
        if(!*s) return 0;
        s++;
    }
    int j = 0;
    for(int t; s[j] && (t = isalpha(s[j])) !=0; j++){
        w[j] = s[j];
        if(t == 1) w[j] += ‘a‘-‘A‘;
    }
    w[j] = ‘\0‘; s += j;
    return j;
}

bool judge()
{
    gets(str); char *p = str;
    int cnt = 0;
    once.clear();
    while(sscan_l(word,p)){
        string s0 = word;
        if(once.count(s0) == 0){
            once.insert(s0);
            int wS = spam[s0];
            int wTot = wS + good[s0];
            if(wTot && wS*2 >= wTot) cnt++;
        }
    }

    return cnt*100>=T*once.size();
}

int main()
{
    freopen("spam.in","r",stdin);
    freopen("spam.out","w",stdout);
    scanf("%d%d%d%d\n",&s,&g,&n,&T);
    for(int i = 0; i < s; i++){
        gets(str); char *p = str;
        once.clear();
        while(sscan_l(word,p)){
            string s0 = word;
            if(once.count(s0) == 0){
                once.insert(s0);
                spam[s0]++;
            }
        }
    }
    for(int i = 0; i < g; i++){
        gets(str); char *p = str;
        once.clear();
        while(sscan_l(word,p)){
            string s0 = word;
            if(once.count(s0) == 0){
                once.insert(s0);
                good[s0]++;
            }
        }
    }
    for(int i = 0; i < n; i++){
        if(judge()) puts("spam");
        else puts("good");
    }
    return 0;
}