#include <bits/stdc++.h>
using namespace std;
const int N = 20004;
int n;
string a[N];
int z;
int t[N * 11][26];
int q[N * 11];
int main()
{
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
{
int m = a[i].size();
int pos = 0;
for (int j = 0; j < m; ++j)
{
if (!t[pos][a[i][j] - 'a'])
t[pos][a[i][j] - 'a'] = ++z;
pos = t[pos][a[i][j] - 'a'];
}
++q[pos];
}
long long ans = 0;
for (int i = 0; i < n; ++i)
{
int m = a[i].size();
set<int> s;
for (int l = 0; l < m; ++l)
{
int pos = 0;
for (int j = l; j < m; ++j)
{
if (!t[pos][a[i][j] - 'a'])
break;
pos = t[pos][a[i][j] - 'a'];
if (s.find(pos) == s.end())
ans += q[pos];
s.insert(pos);
}
}
--ans;
}
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
888 KB |
Output is correct |
2 |
Correct |
5 ms |
888 KB |
Output is correct |
3 |
Correct |
6 ms |
1016 KB |
Output is correct |
4 |
Correct |
6 ms |
1016 KB |
Output is correct |
5 |
Correct |
8 ms |
1272 KB |
Output is correct |
6 |
Correct |
11 ms |
1272 KB |
Output is correct |
7 |
Correct |
10 ms |
1528 KB |
Output is correct |
8 |
Correct |
11 ms |
1784 KB |
Output is correct |
9 |
Correct |
33 ms |
2540 KB |
Output is correct |
10 |
Correct |
38 ms |
4472 KB |
Output is correct |
11 |
Correct |
46 ms |
3576 KB |
Output is correct |
12 |
Correct |
65 ms |
7800 KB |
Output is correct |
13 |
Correct |
95 ms |
3192 KB |
Output is correct |
14 |
Correct |
52 ms |
8056 KB |
Output is correct |
15 |
Correct |
71 ms |
8440 KB |
Output is correct |
16 |
Correct |
112 ms |
1400 KB |
Output is correct |
17 |
Correct |
48 ms |
1144 KB |
Output is correct |
18 |
Correct |
37 ms |
1144 KB |
Output is correct |
19 |
Correct |
66 ms |
5496 KB |
Output is correct |
20 |
Correct |
62 ms |
1284 KB |
Output is correct |