# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138620 | KCSC | Lozinke (COCI17_lozinke) | C++14 | 809 ms | 55800 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 int DIM = 20005;
string str[DIM];
map<string, set<int>> mmp;
void solve(int n, int &ans) {
mmp.clear();
for (int i = 1; i <= n; ++i) {
ans += mmp[str[i]].size();
for (int p1 = 0; p1 < str[i].length(); ++p1)
for (int p2 = p1; p2 < str[i].length(); ++p2)
mmp[str[i].substr(p1, p2 - p1 + 1)].insert(i);
}
}
inline bool cmp(string s1, string s2) {
return s1.length() > s2.length();
}
int main(void) {
#ifdef HOME
freopen("lozinke.in", "r", stdin);
freopen("lozinke.out", "w", stdout);
#endif
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> str[i];
sort(str + 1, str + n + 1, cmp);
int ans = 0;
solve(n, ans);
for (int i = 1, j = 1; i <= n; i = j) {
while (j <= n and str[i] == str[j])
++j;
ans += j - i - 1;
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |