# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107985 | Frankenween | Lozinke (COCI17_lozinke) | C++17 | 530 ms | 13444 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.
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;
using namespace std;
template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
for (T &cnt : arr) {
in >> cnt;
}
return in;
};
void solve() {
ll n;
cin >> n;
map<ll, ll> cnt;
vector<string> arr(n);
cin >> arr;
for (int i = 0; i < n; i++) {
ll h = 0;
for (auto c : arr[i]) {
h = (h * BASE + c - 'a' + 1) % mod;
}
cnt[h]++;
}
ll answer = 0;
for (auto &s : arr) {
set<ll> d;
for (int i = 0; i < s.size(); i++) {
ll h = 0;
for (int j = i; j < s.size(); j++) {
h = (h * BASE + s[j] - 'a' + 1) % mod;
d.insert(h);
}
}
for (auto i : d) {
answer += cnt[i];
}
answer--;
}
cout << answer;
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#else
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout.precision(30);
ll seed = time(0);
//cerr << "Seed: " << seed << "\n";
srand(seed);
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |