# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472793 | AbdoMo | Lozinke (COCI17_lozinke) | C++17 | 1094 ms | 3400 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
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
if(a.size()==b.size())
{
return a<b;
}
return a.size()<b.size();
}
void solve(){
int n;
cin>>n;
vector<string>v;
map<string,int>freq;
set<string,decltype(comp)*>st(comp);
for(int i=0;i<n;i++)
{
string s;
cin>>s;
st.insert(s);
freq[s]++;
v.pb(s);
}
sort(v.begin(),v.end(),comp);
int ans=0;
int c=1;
auto it=st.begin();
for(int i=0;i<n;i+=freq[v[i]],it++)
{
auto j=it;
j++;
ans+=freq[v[i]]*(freq[v[i]]-1);
for(;j!=st.end();j++)
{
string x=*j;
if(x.find(v[i])!=-1)
{
ans+=freq[*j]*freq[v[i]];
}
}
}
cout<<ans<<endl;
/*
*/
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//cin>>t;
while(t--){solve();}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |