# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116893 | Dajunctic | Lozinke (COCI17_lozinke) | C++17 | 347 ms | 21160 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;
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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |