# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116895 | TienDungz | Lozinke (COCI17_lozinke) | C++14 | 368 ms | 29764 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>
#define int long long
using namespace std;
int res=0,n;
string t;
vector<int> bump;
vector<string> adj;
map<string,int> cnt;
bool cmp (string a,string b)
{
return a.length()<b.length();
}
signed main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>t;
adj.push_back(t);
}
sort(adj.begin(),adj.end(),cmp);
for(int i=0;i<n;i++)
{
for(int k=1;k<=adj[i].length()-1;k++)
{
map<string,bool> cur;
string s;
for(int j=0;j<=(adj[i].length()-1)-k+1;j++)
{
s=adj[i].substr(j,k);
if(cnt[s]>=1&&cur[s]==false)
{
res+=cnt[s];
cur[s]=true;
}
}
}
cnt[adj[i]]++;
if(cnt[adj[i]]>=2)
{
bump.push_back(i);
}
}
map<string,bool> cur;
for(int i=0;i<bump.size();i++)
{
if(cur[adj[bump[i]]]==false)
{
int a=1,b=1;
for(int j=1;j<=cnt[adj[bump[i]]];j++)
{
a=a*j;
if(j==cnt[adj[bump[i]]]-2) b=a;
}
res+=a/b;
cur[adj[bump[i]]]=true;
}
}
cout<<res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |