# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116871 | MrUnknown | Lozinke (COCI17_lozinke) | C++11 | 15 ms | 1792 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<stdio.h>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define f_(i,a,b) for (int i=a;i>=b;i--)
//#define f(i,a,b) for (int i=a;i<=b;i++)
int n;
string s[20005];
long long dem=0;
map<string,bool> mb;
map<string,ll> m;
bool cmp(string x,string y) {
return (x.size()<=y.size()) ;
}
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
scanf("%d", &n);
for (int i=1;i<=n;i++) {
cin>>s[i];
}
sort(s+1,s+1+n,cmp);
for (int i=1;i<=n;i++) {
mb.clear();
for (int j=0;j<s[i].size();j++) {
string si;
for (int l=j;l<s[i].size();l++) {
si=si+s[i][l];
if (!mb[si]) {
mb[si]=true;
dem+=m[si];
}
}
}
dem+=m[s[i]];
m[s[i]]++;
}
printf("%lld", dem);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |