# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238571 | vankata | Trener (COCI20_trener) | C++14 | 20 ms | 1024 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 MAXN = 2048;
const int MOD = (int)(1e9+7);
map< pair<int,int> ,long long >mp;
long long n,k;
bool cmp(string a,string b)
{
for(size_t i=0;i<a.size();i++)
{
if(a[i]!=b[i])return false;
}return true;
}
int base1 = 29 ;
int base2 = 31 ;
int mod1=1e5+3;
int mod2=100019;
pair<int,int> hsh(string s)
{
int i,j;
int h1=0,h2=0;
for(i=0;i<s.size();i++)
{
h1*=base1;
h2*=base2;
h1+=(s[i]-'a'+1);
h2+=(s[i]-'a'+1);
h1%=mod1;
h2%=mod2;
}
return {h1,h2};
}
void read()
{
int i,j,l;
long long ans = 0;
cin>>n>>k;
string s,t,q;
int lm=0;
for(i=0;i<n;i++)
{
for(j=0;j<k;j++)
{
cin>>s;
if(!i){mp[hsh(s)]++;continue;}
t="";
q="";
t=s.substr(0,s.size()-1);
q=s.substr(1);
mp[hsh(s)]+=mp[hsh(q)];
if(!cmp(q,t))mp[hsh(s)]+=mp[hsh(t)];
mp[hsh(s)]%=MOD;
if(i==n-1)
{
ans+=mp[hsh(s)];
ans%=MOD;
}
}
}
if(n==1)
{
cout<<k<<endl;
return ;
}
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
read();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |