# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321729 | kaplanbar | Lozinke (COCI17_lozinke) | C++14 | 312 ms | 15984 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;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
unordered_map<string, int> st, subst;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
st[s]++;
int n = s.length();
unordered_map<string, bool> stemp;
for(int i = 0; i < n; i++) {
string k = "";
for(int j = i; j < n; j++) {
k += s[j];
stemp[k] = true;
}
}
for(auto &x: stemp) {
subst[x.first]+=x.second;
}
}
int64_t ans = 0;
for(auto &s: st) {
ans += 1ll * s.second * (subst[s.first] - 1);
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |