# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151900 | phillip | Lozinke (COCI17_lozinke) | C++14 | 1084 ms | 65540 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;
bool cmp(string a,string b)
{
if(a.size()<b.size())return true;
return false;
}
int n;
string s[20009];
map<string,bool>m[20009];
int main()
{
cin>>n;
for(int i=0;i<n;i++)cin>>s[i];
sort(s,s+n,cmp);
//for(int i=0;i<n;i++)cout<<s[i]<<"\n";
for(int i=0;i<n;i++)
{
for(int k=0;k<s[i].size();k++)
{
for(int j=0;j<s[i].size()-k;j++)
{
//cout<<s[i].substr(j,k+1)<<"\n";
m[i][s[i].substr(j,k+1)]=1;
}
}
}
int ans=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(m[j][s[i]])ans++;
if(s[i]==s[j])ans++;
}
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |