# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477795 | mychecksedad | Trener (COCI20_trener) | C++17 | 2074 ms | 8344 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.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
int n, k;
ll dp[55][1600];
string s[55][1600];
void solve(){
cin >> n >> k;
for(int i = 1; i <= n; ++i) for(int j = 1; j <= k; ++j) cin >> s[i][j];
for(int i = 0; i <= n; i++) for(int j = 0; j <= k; ++j) dp[i][j] = 0;
for(int j = 1; j <= k; ++j) dp[1][j] = 1;
for(int i = 2; i <= n; ++i){
for(int j = 1; j <= k; ++j){
for(int back = 1; back <= k; ++back){
bool ok = 1;
for(int f = 0; f < s[i - 1][back].length(); ++f){
if(s[i - 1][back][f] != s[i][j][f]){
ok = 0;
}
}
if(ok){
(dp[i][j] += dp[i - 1][back])%=MOD;
}else{
bool ok = 1;
for(int f = 0; f < s[i - 1][back].length(); ++f){
if(s[i - 1][back][f] != s[i][j][f + 1]){
ok = 0;
}
}
if(ok) (dp[i][j] += dp[i - 1][back])%=MOD;
}
}
}
}
ll sum = 0;
for(int i = 1; i <= k; ++i) (sum += dp[n][i]) %= MOD;
cout << sum;
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
}
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... |