Submission #116893

#TimeUsernameProblemLanguageResultExecution timeMemory
116893DajuncticLozinke (COCI17_lozinke)C++17
100 / 100
347 ms21160 KiB
#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+50;
int n;
string a[N];
unordered_map<string, int> M;
int ans = 0;
int main(){
  	cin >> n;
  	for(int i=1;i<=n;i++){
  	  	cin >> a[i];
  	  	unordered_set<string> S;
  	  	int m = a[i].length();
    	for(int j=0;j<m;j++){
      		string s;
      		for(int k=j;k<m;k++){
        		s += a[i][k];
        		S.insert(s);
      		}
    	}
   		for(auto x : S) M[x]++;
    }
  	for(auto x: a) ans += M[x];
  	cout<<ans-n;
}
#Verdict Execution timeMemoryGrader output
Fetching results...