Submission #238442

#	Time	Username	Problem	Language	Result	Execution time	Memory
238442		danikoynov	Trener (COCI20_trener)	C++14	110 / 110	270 ms	10104 KiB

trener

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
const int MAXN = 55, MAXK = 1510;
const long long mod = 1e9 + 7, base = 27;

int n, k;
long long dp[MAXN][MAXK];
string s[MAXN][MAXK];
pair < long long, long long > p[MAXN][MAXK];
long long full[MAXN][MAXK];
int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> k;
    for (int i = 1; i <= n; i ++)
        for (int j = 1; j <= k; j ++)
        {
            cin >> s[i][j];

            p[i][j].first = 0;
            for (int d = 1; d < i; d ++)
            {
                p[i][j].first = (p[i][j].first * base + s[i][j][d - 1] - 'a' + 1) % mod;
            }

            p[i][j].second = 0;
            for (int d = 2; d <= i; d ++)
            {
                p[i][j].second = (p[i][j].second * base + s[i][j][d - 1] - 'a' + 1) % mod;
            }

            for (int d = 1; d <= i; d ++)
            {
                full[i][j] = (full[i][j] * base + s[i][j][d - 1] - 'a' + 1) % mod;
            }
        }

    for (int j = 1; j <= k; j ++)
    dp[1][j] = 1;

    for (int i = 1; i < n; i ++)
        for (int j = 1; j <= k; j ++)
            for (int d = 1; d <= k; d ++)
            {
                /**string s1 = s[i][j], s2 = s[i + 1][d].substr(0, s[i + 1][d].size() - 1), s3 = s[i + 1][d].substr(1, s[i + 1][d].size() - 1);
                if (s1 == s2 || s1 == s3)
                    dp[i + 1][d] = (dp[i + 1][d] + dp[i][j]) % mod;*/

                if (full[i][j] == p[i + 1][d].first || full[i][j] == p[i + 1][d].second)
                    dp[i + 1][d] = (dp[i + 1][d] + dp[i][j]) % mod;
            }

    long long ans = 0;
    for (int j = 1; j <= k; j ++)
        ans = (ans + dp[n][j]) % mod;

    cout << ans << endl;
    return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 33 / 33
• Subtask 3: 55 / 55