Problem p00884 (C++) — buggy submission, verdict: Time Limit Exceeded

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

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX / 3

#define MAX_N 1000

vector<string> group;
vector<string> mem[211];
set<string> st;
bool vis[211];
char inc[1024];

void dfs(int v) {
  vis[v] = true;
  rep(i, mem[v].size()) {
    string name = mem[v][i];
    if (exist(group, name)) {
      int nv = find(all(group), name) - group.begin();
      if (vis[nv])
        continue;
      dfs(nv);
    } else {
      st.insert(name);
    }
  }
}

int main() {
  // cin.sync_with_stdio(false);
  while (1) {
    int n = 0;
    string ins;
    scanf("%d", &n);
    // dbg(n);
    if (n == 0)
      break;
    group.clear();
    rep(i, n) mem[i].clear();
    st.clear();
    rep(i, n) {
      scanf("%s", inc);
      ins = inc;
      int l = 0;
      rep(j, ins.length()) {
        if (ins[j] == ':') {
          group.pb(ins.substr(l, j - l));
          l = j + 1;
        } else if (ins[j] == ',' || ins[j] == '.') {
          mem[i].pb(ins.substr(l, j - l));
          l = j + 1;
        }
      }
    }
    memset(vis, 0, sizeof(vis));
    dfs(0);
    cout << st.size() << endl;
  }
  return 0;
}

Error: TLE

Fixed submission:

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

#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define each(itr, v) for (auto itr : v)
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define maxch(x, y) x = max(x, y)
#define minch(x, y) x = min(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX / 3

#define MAX_N 1000

int n;
string ins;
vector<string> group;
vector<string> mem[111];
set<string> st;

void dfs(int v) {
  rep(i, mem[v].size()) {
    string name = mem[v][i];
    if (exist(group, name)) {
      dfs(find(all(group), name) - group.begin());
    } else {
      st.insert(name);
    }
  }
}

int main() {
  cin.sync_with_stdio(false);
  while (1) {
    cin >> n;
    if (n == 0)
      break;
    group.clear();
    rep(i, n) mem[i].clear();
    st.clear();
    rep(i, n) {
      cin >> ins;
      int l = 0;
      rep(j, ins.length()) {
        if (ins[j] == ':') {
          group.pb(ins.substr(l, j));
          l = j + 1;
        } else if (ins[j] == ',' || ins[j] == '.') {
          mem[i].pb(ins.substr(l, j - l));
          l = j + 1;
        }
      }
    }
    dfs(0);
    cout << st.size() << endl;
  }
  return 0;
}