# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165742 | Sensei | Lozinke (COCI17_lozinke) | C++17 | 480 ms | 42560 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>
using namespace std;
const long long P = 61;
const long long MOD = 1e16 + 3;
const int MAXN = 2e4;
long long add (long long x, long long y) {
return ((x % MOD) + (y % MOD)) % MOD;
}
long long mul (long long x, long long y) {
return ((x % MOD) * (y % MOD)) % MOD;
}
// vector<char> st[MAXN + 7];
string st[MAXN + 7];
long long fullhash[MAXN + 7];
// vector<long long> subhashes[MAXN + 7];
unordered_set<long long> subhashes[MAXN + 7];
char buff[12];
map<long long, int> fullhashes;
int main () {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
// scanf("%s", buff);
// for (int j = 0; buff[j] != 0; j++) {
// st[i].push_back(buff[j]);
// }
cin >> st[i];
}
for (int i = 1; i <= N; i++) {
long long hash = 0;
for (int j = 0; j < st[i].size(); j++) {
hash = mul(hash, P);
hash = add(hash, st[i][j] - 'a' + 1);
}
fullhash[i] = hash;
fullhashes[hash]++;
}
long long ans = 0;
for (int i = 1; i <= N; i++) {
for (int ss = 0; ss < st[i].size(); ss++) {
long long hash = 0;
for (int j = ss; j < st[i].size(); j++) {
hash = mul(hash, P);
hash = add(hash, st[i][j] - 'a' + 1);
// subhashes[i].push_back(hash);
if (subhashes[i].find(hash) == subhashes[i].end()) {
subhashes[i].insert(hash);
ans += fullhashes[hash];
}
}
}
// sort(subhashes[i].begin(), subhashes[i].end());
}
ans -= N;
// for (int i = 1; i <= N; i++) {
// for (long long hash : subhashes[i]) {
// ans += fullhashes.count(hash);
// }
// ans--;
// }
cout << ans << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |