#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
string s[MAXN];
int pw[MAXN];
int hsh[MAXN];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
#ifdef Local
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
#endif
cin>>n;
for(int i = 0; i < n; i++){
cin>>s[i];
}
ll ans = 0;
unordered_map<int, int> mp;
const int base = 29;
for(int i = 0; i < n; i++){
vector<int> vc;
for(int x = 0; x < s[i].length(); x++){
int bas = 1;
int hash = 0;
for(int y = x; y < s[i].length(); y++){
hash = (hash + 1LL * bas * (s[i][y] - 'a' + 1) % mod) % mod;
vc.push_back(hash);
bas = 1LL * bas * base % mod;
}
if(x == 0)
hsh[i] = hash;
}
sort(vc.begin(), vc.end());
vc.resize(unique(vc.begin(), vc.end()) - vc.begin());
for(auto u: vc)
mp[u]++;
}
for(int i = 0; i < n; i++){
ans += mp[hsh[i]] - 1;
}
cout<<ans<<endl;
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
Compilation message
lozinke.cpp: In function 'int main()':
lozinke.cpp:42:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
42 | for(int x = 0; x < s[i].length(); x++){
| ~~^~~~~~~~~~~~~~~
lozinke.cpp:45:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for(int y = x; y < s[i].length(); y++){
| ~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
9708 KB |
Output is correct |
2 |
Correct |
6 ms |
9708 KB |
Output is correct |
3 |
Correct |
7 ms |
9708 KB |
Output is correct |
4 |
Correct |
8 ms |
9708 KB |
Output is correct |
5 |
Correct |
9 ms |
9964 KB |
Output is correct |
6 |
Correct |
10 ms |
9964 KB |
Output is correct |
7 |
Correct |
12 ms |
10368 KB |
Output is correct |
8 |
Correct |
14 ms |
10732 KB |
Output is correct |
9 |
Correct |
25 ms |
10732 KB |
Output is correct |
10 |
Correct |
46 ms |
13456 KB |
Output is correct |
11 |
Correct |
37 ms |
11640 KB |
Output is correct |
12 |
Incorrect |
108 ms |
17972 KB |
Output isn't correct |
13 |
Correct |
60 ms |
10732 KB |
Output is correct |
14 |
Incorrect |
84 ms |
17460 KB |
Output isn't correct |
15 |
Incorrect |
114 ms |
17972 KB |
Output isn't correct |
16 |
Correct |
63 ms |
9964 KB |
Output is correct |
17 |
Correct |
34 ms |
9836 KB |
Output is correct |
18 |
Correct |
29 ms |
9836 KB |
Output is correct |
19 |
Correct |
69 ms |
13876 KB |
Output is correct |
20 |
Correct |
39 ms |
9964 KB |
Output is correct |