| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 845388 |
2023-09-06T13:26:29 Z |
vjudge1 |
Trener (COCI20_trener) |
C++17 |
|
11 ms |
2140 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
struct HASH{
int sz = 5;
int p[5] = {31,101,53,43,89};
vector < int > get(string &str){
vector < int > ret(sz,0) , kat(sz,1);
for(auto itr : str){
for(int i = 0;i<sz;i++) {
ret[i] = (ret[i] + kat[i] * (itr - 'a')) % mod;
kat[i] = (kat[i] * p[i]) % mod;
}
}
return ret;
}
} h;
void solve(){
int n,k;cin >> n >> k;
string v[n+1][k];
map < vector < int > , vector < int > > mpa;
for(int i = 1;i<=n;i++){
for(int j = 0;j<k;j++){
cin >> v[i][j];
mpa[h.get(v[i][j])].push_back(j);
}
}
int dp[n+1][k];
memset(dp , 0 , sizeof(dp));
for(int i = 0;i<k;i++)dp[1][i] = 1;
for(int i = 2;i<=n;i++){
for(int j = 0;j<k;j++){
string s1 = string(v[i][j].begin() , v[i][j].end()-1) , s2 = string(v[i][j].begin()+1 , v[i][j].end());
vector < int > ind1 = mpa[h.get(s1)];
vector < int > ind2 = mpa[h.get(s2)];
for(auto itr : ind2)ind1.push_back(itr);
sort(ind1.begin(),ind1.end());
ind1.resize(unique(ind1.begin() , ind1.end()) - ind1.begin());
for(auto itr : ind1){
dp[i][j] = (dp[i][j] + dp[i-1][itr]) % mod;
}
}
}
int ans = 0;
for(int i = 0;i<k;i++)ans = (ans + dp[n][i]) % mod;
cout << ans << endl;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int testcase = 1;//cin >> testcase;
while(testcase--)solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
2140 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
