Submission #38394170

---

Source Code Expand

#include <iostream>
#define N 510000
using namespace std;
int rt, ch[N][26], sum[N], tot;
void insert(int &x, int d, const char *c) {
  if (!x)
    x = ++tot;
  sum[x]++;
  if (!*c)
    return;
  insert(ch[x][*c - 'a'], d + 1, c + 1);
}
int query(int x, int d, const char *c) {
  if (sum[x] < 2)
    return 0;
  if (!*c)
    return d;
  return max(d, query(ch[x][*c - 'a'], d + 1, c + 1));
}
int n;
string s[N];
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> s[i];
    insert(rt, 0, s[i].c_str());
  }
  for (int i = 1; i <= n; i++) {
    cout << query(rt, 0, s[i].c_str()) << '\n';
  }
  return 0;
}

Submission Info

Judge Result