# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116816 | nhimnam120 | Lozinke (COCI17_lozinke) | C++14 | 1088 ms | 1784 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 fi first
#define se second
using namespace std;
vector<pair<long long, string> > inp;
signed main(){
long long n;
cin >> n;
for(int i=0;i<n;i++){
string s;
cin >> s;
inp.push_back({s.size(),s});
}
long long ans=0;
sort(inp.begin(),inp.end());
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(inp[i].fi==inp[j].fi){
if(inp[i].se==inp[j].se){
ans+=2;
}
}
else{
string a=inp[i].se;
string b=inp[j].se;
//cout << a << " " << b<< " " <<inp[i].fi-inp[j].fi+1<< " "<< ans<<" ";
for(int k=0;k<inp[i].fi-inp[j].fi+1;k++){
if(a[k]==b[0]){
ans++;
for(int l=0;l<inp[j].fi;l++){
if(a[k+l]!=b[l]){
ans--;
break;
}
}
}
}
//cout << ans <<endl;
}
}
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |