# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530962 | Tenis0206 | Trener (COCI20_trener) | C++11 | 78 ms | 1728 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 int long long
using namespace std;
const int Mod = 1e9 + 7;
const int Mh = 1e9 + 7;
const int b = 29;
int n,k;
int dp[1505];
string s[1505];
map<int,int> dps,fc;
int put[115];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
put[0] = 1;
for(int i=1;i<=n;i++)
{
put[i] = 1LL * put[i-1] * b % Mh;
}
for(int j=1; j<=k; j++)
{
cin>>s[j];
int Hash = 0;
for(auto it : s[j])
{
Hash = (1LL * Hash * b + (it - 'a' + 1)) % Mh;
}
++dps[Hash];
}
for(int i=2; i<=n; i++)
{
for(int j=1; j<=k; j++)
{
dp[j] = 0;
}
for(int j=1; j<=k; j++)
{
cin>>s[j];
fc.clear();
int Hash = 0;
for(int dr=0; dr<i-1; dr++)
{
Hash = (1LL * Hash * b + (s[j][dr] - 'a' + 1)) % Mh;
}
if(!fc[Hash])
{
dp[j] += dps[Hash];
dp[j] %= Mod;
}
++fc[Hash];
for(int st=1; st+i-2<s[j].size(); st++)
{
int dr = st + i - 2;
Hash = (1LL * Hash * b + (s[j][dr] - 'a' + 1)) % Mh;
Hash = (Hash - (s[j][st-1] - 'a' + 1) * put[i-1] % Mh + Mh) % Mh;
if(!fc[Hash])
{
dp[j] += dps[Hash];
dp[j] %= Mod;
}
++fc[Hash];
}
}
dps.clear();
for(int j=1; j<=k; j++)
{
int Hash = 0;
for(auto it : s[j])
{
Hash = (1LL * Hash * b + (it - 'a' + 1)) % Mh;
}
dps[Hash] += dp[j];
dps[Hash] %= Mod;
}
}
int rez = 0;
for(int j=1; j<=k; j++)
{
rez += dp[j];
rez %= Mod;
}
cout<<rez<<'\n';
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... |