oj.uz

Submission #238442

# Submission time Handle Problem Language Result Execution time Memory
238442 2020-06-11T10:09:37 Z danikoynov Trener (COCI20_trener) C++14
110 / 110
 270 ms 10104 KB 
#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.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 6 ms 2944 KB Output is correct
4 Correct 6 ms 2944 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3840 KB Output is correct
2 Correct 10 ms 3840 KB Output is correct
3 Correct 10 ms 3840 KB Output is correct
4 Correct 10 ms 3840 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 10 ms 3840 KB Output is correct
7 Correct 11 ms 3840 KB Output is correct

Subtask #3
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 6 ms 2944 KB Output is correct
4 Correct 6 ms 2944 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 10 ms 3840 KB Output is correct
7 Correct 10 ms 3840 KB Output is correct
8 Correct 10 ms 3840 KB Output is correct
9 Correct 10 ms 3840 KB Output is correct
10 Correct 10 ms 3840 KB Output is correct
11 Correct 11 ms 3840 KB Output is correct
12 Correct 144 ms 8056 KB Output is correct
13 Correct 158 ms 8180 KB Output is correct
14 Correct 145 ms 8056 KB Output is correct
15 Correct 146 ms 8012 KB Output is correct
16 Correct 269 ms 8056 KB Output is correct
17 Correct 173 ms 8184 KB Output is correct
18 Correct 165 ms 9976 KB Output is correct
19 Correct 160 ms 9976 KB Output is correct
20 Correct 167 ms 9976 KB Output is correct
21 Correct 166 ms 10036 KB Output is correct
22 Correct 270 ms 10104 KB Output is correct