oj.uz

Submission #297572

# Submission time Handle Problem Language Result Execution time Memory
297572 2020-09-11T16:00:05 Z Hehehe Mate (COCI18_mate) C++14
0 / 100
 1834 ms 28204 KB 
#include<bits/stdc++.h> //:3
#define DIM 2010
#define MOD 1000000007
using namespace std;

//ifstream cin ("date.in");
//ofstream cout ("date.out");
int v[DIM],c[DIM][DIM],f[DIM],dp[DIM][30][30],a[DIM][30];
char l1,l2;
int n,i,j,x,y,q,lg;
int main (){

    string s;
    cin >> s;
    n = s.size();
    s = '.' + s;

    for (i=1;i<=n;i++)
        v[i] = s[i] - 'a' + 1;

    c[0][0] = c[1][0] = c[1][1] = 1;
    for (i=2;i<=n;i++){
        c[i][0] = 1;
        for (j=1;j<=i;j++){
            c[i][j] = c[i-1][j] + c[i-1][j-1];
            if (c[i][j] >= MOD)
                c[i][j] -= MOD;
        }}


    for (i=1;i<=n;i++)
        for (j=i+1;j<=n;j++)
            a[i][v[j]]++;


    for (lg=2;lg<=n;lg++){
        for (i=lg-1;i<=n;i++){
            x = v[i];
            for (y=1;y<=26;y++){
                dp[lg][x][y] = dp[lg][x][y]+1LL*a[i][y]*c[i-1][lg-2]%MOD;
                if (dp[lg][x][y] >= MOD)
                    dp[lg][x][y] -= MOD;
            }}}


    cin >> q;
    for (;q--;){
        cin >> lg >> l1 >> l2;
        cout << dp[lg][l1-'a'+1][l2-'a'+1];
    }


    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 107 ms 896 KB Output isn't correct
2 Incorrect 53 ms 892 KB Output isn't correct
3 Incorrect 56 ms 800 KB Output isn't correct
4 Incorrect 115 ms 1016 KB Output isn't correct
5 Incorrect 374 ms 3576 KB Output isn't correct
6 Incorrect 460 ms 3800 KB Output isn't correct
7 Incorrect 311 ms 3492 KB Output isn't correct
8 Incorrect 282 ms 3288 KB Output isn't correct
9 Incorrect 1834 ms 28204 KB Output isn't correct
10 Incorrect 1820 ms 28104 KB Output isn't correct