# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233107 | PeppaPig | Lozinke (COCI17_lozinke) | C++14 | 328 ms | 13220 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define long long long
using namespace std;
const int N = 2e4+5;
const int P = 1e9+7;
int n, ans;
char S[N][15];
map<long, int> mp;
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf(" %s", S[i] + 1);
long hsh = 0;
for(int j = 1; j <= strlen(S[i] + 1); j++)
hsh = hsh * P + S[i][j];
++mp[hsh];
}
for(int i = 1; i <= n; i++) {
int len = strlen(S[i] + 1);
set<long> st;
for(int j = 1; j <= len; j++) {
long hsh = 0;
for(int k = j; k <= len; k++) {
hsh = hsh * P + S[i][k];
if(st.find(hsh) == st.end()) {
ans += mp[hsh];
if(j == 1 && k == len) --ans;
st.emplace(hsh);
}
}
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |