# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138623 | KCSC | Lozinke (COCI17_lozinke) | C++14 | 1045 ms | 16760 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];
char aux[DIM];
map<string, int> mmp;
void solve(int n, int &ans) {
mmp.clear();
for (int i = 1; i <= n; ++i) {
ans += mmp[str[i]];
set<string> mst;
for (int p1 = 0; p1 < str[i].length(); ++p1)
for (int p2 = p1; p2 < str[i].length(); ++p2)
mst.insert(str[i].substr(p1, p2 - p1 + 1));
for (string s : mst)
mmp[s]++;
}
}
int main(void) {
#ifdef HOME
freopen("lozinke.in", "r", stdin);
freopen("lozinke.out", "w", stdout);
#endif
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%s", aux + 1);
int m = strlen(aux + 1);
for (int j = 1; j <= m; ++j)
str[i].push_back(aux[j]);
}
int ans = 0;
solve(n, ans);
reverse(str + 1, str + n + 1);
solve(n, ans);
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |