Matteo spam filter OII

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int solve(vector<string> good, vector<string> bad, vector<string> words) {
  int gfound = 0, bfound = 0;
  for (string w : words) {
    if (find(good.begin(), good.end(), w) != good.end()) {
      gfound++;
    }

    if (find(bad.begin(), bad.end(), w) != bad.end()) {
      bfound++;
    }
  }

  if (gfound && !bfound)
    return 1;
  if (bfound && !gfound)
    return 2;
  return 3;
}

int main() {
  int B, G;
  cin >> B;
  vector<string> bad(B);
  for (string &b : bad) {
    cin >> b;
  }

  cin >> G;
  vector<string> good(G);
  for (string &g : good) {
    cin >> g;
  }

  int E;
  cin >> E;

  int good_found = 0, bad_found = 0;
  for (int i = 0; i < E; i++) {
    // For each email
    int W;
    cin >> W;
    vector<string> words(W);
    for (string &w : words) {
      cin >> w;
    }

    switch (solve(good, bad, words)) {
    case 1:
      good_found++;
      break;
    case 2:
      bad_found++;
      break;
    }
  }

  cout << bad_found << " " << good_found;
  return 0;
}