# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554687 | new_acc | Lozinke (COCI17_lozinke) | C++14 | 152 ms | 41144 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
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e6+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod=998244353;
const ll mod2=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
int t[N];
string s[N];
unordered_map<ll,int> m;
unordered_map<ll,bool> m2;
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>s[i];
ll akth=0;
for(int j=0;j<s[i].size();j++) akth=(akth*p+s[i][j])%mod;
m[akth]++;
}
ll res=0;
for(int i=1;i<=n;i++){
for(int j=0;j<s[i].size();j++){
ll akth=0;
for(int k=j;k<s[i].size();k++){
akth=(akth*p+s[i][k])%mod;
if(m2[akth]) continue;
res+=m[akth];
m2[akth]=1;
}
}
m2.clear();
res--;
}
cout<<res<<"\n";
}
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |