# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165733 | Sensei | Lozinke (COCI17_lozinke) | C++17 | 1089 ms | 32120 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 = 53;
const long long MOD = 1e9 + 7;
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;
}
string st[MAXN + 7];
long long fullhash[MAXN + 7];
unordered_set<long long> subhashes[MAXN + 7];
int main () {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> st[i];
}
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].insert(hash);
if (ss == 0 && j + 1 == st[i].size()) {
fullhash[i] = hash;
}
}
}
}
long long ans = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i != j && subhashes[i].find(fullhash[j]) != subhashes[i].end()) {
ans++;
}
}
}
cout << ans << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |