# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155205 | GoldNextYear | Lozinke (COCI17_lozinke) | C++14 | 596 ms | 16792 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.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define pob pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n,ans;
string s[20009];
map<string,int>mp;
map<string,int>done;
int main(){
fast;
cin>>n;
for(int i=0;i<n;i++)cin>>s[i],mp[s[i]]++;
for(int i=0;i<n;i++){
mp[s[i]]--;
string x=s[i];
for(int j=0;j<x.size();j++){
string ret="";
for(int k=j;k<x.size();k++){
ret+=x[k];
if(!done[ret]){
ans+=mp[ret];
done[ret]=1;
}
}
}
done.clear();
mp[s[i]]++;
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |