oj.uz

답안 #238357

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238357 2020-06-10T20:59:23 Z danikoynov Trener (COCI20_trener) C++14
22 / 110
 12 ms 3744 KB 
#include<bits/stdc++.h>
#define endl '\n'

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

int n, k;
long long dp[MAXN][MAXK];
string s[MAXN][MAXK];
pair < string, string > p[MAXN][MAXN];
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];

    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 ++)
    {
        p[i][j].first = s[i][j].substr(0, s[i][j].size() - 1);
        p[i][j].second = s[i][j].substr(1, s[i][j].size() - 1);
    }
    for (int i = 1; i < n; i ++)
        for (int j = 1; j <= k; j ++)
            for (int d = 1; d <= k; d ++)
            {
                if (s[i][j] == p[i + 1][d].first || s[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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 6 ms 3200 KB Output is correct
3 Correct 6 ms 3072 KB Output is correct
4 Correct 7 ms 3200 KB Output is correct

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 3744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3072 KB Output is correct
2 Correct 6 ms 3200 KB Output is correct
3 Correct 6 ms 3072 KB Output is correct
4 Correct 7 ms 3200 KB Output is correct
5 Incorrect 12 ms 3744 KB Output isn't correct
6 Halted 0 ms 0 KB -