| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 98233 | dalgerok | Mate (COCI18_mate) | C++17 | 541 ms | 14720 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.
#include<bits/stdc++.h>
using namespace std;
const int N = 2005, M = 26, MOD = 1e9 + 7;
string s;
int n, m, dp[N][M][M], sum[N][M];
inline void upd(int &x, int y){
    x += y;
    if(x >= MOD){
        x -= MOD;
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> s;
    n = (int)s.size();
    for(auto &it : s){
        it -= 'a';
    }
    s = '#' + s;
    for(int i = 1; i <= n; i++){
        for(int j = i; j >= 2; j--){
            for(int k = 0; k < M; k++){
                upd(dp[j][k][s[i]], sum[j - 1][k]);
                upd(sum[j][s[i]], sum[j - 1][k]);
            }
        }
        upd(sum[1][s[i]], 1);
    }
    cin >> m;
    while(m--){
        int len;
        char x, y;
        cin >> len >> x >> y;
        x -= 'a';
        y -= 'a';
        cout << dp[len][x][y] << "\n";
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
