Submission #639056

#TimeUsernameProblemLanguageResultExecution timeMemory
639056inksamuraiLozinke (COCI17_lozinke)C++17
100 / 100
346 ms16748 KiB
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,c,n) for(int i=c;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3RhsN1z ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e signed main(){ _3RhsN1z; int n; cin>>n; vec(string) a(n); rep(i,n){ cin>>a[i]; } std::map<string,int> mp; rep(i,n){ string s=a[i]; vec(string) tmp; rep(i,sz(s)){ string now=""; rng(j,i,sz(s)){ now+=s[j]; tmp.pb(now); } } sort(tmp.begin(),tmp.end()); tmp.erase(unique(tmp.begin(),tmp.end()),tmp.end()); for(auto s:tmp){ mp[s]+=1; } } int ans=0; rep(i,n){ ans+=mp[a[i]]-1; } print(ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...