#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long dp[2001][26][26], sum[2001][2001][26], ans[2001][26][26]; // sum[sz][x] = soma dos dp[sz][K][x]
long long mod(long long a, long long b) {
a %= b;
if (a < 0) a += b;
return a;
}
void add_self(long long& a, long long b) {
a = mod(a + b, MOD);
}
/*
dp[ t ][ x ][ y ] = numero de sequencias de tamanho t ate r que terminam em xy
calculo pra cada r ^ e somo em sum[ t ][ x ][ y ]
*/
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string str; cin >> str;
int n = (int) str.size();
sum[0][0][0] = 1;
for (int r = 0; r < n; r++) {
// vou adicionar o str[r] para buildar um novo bloco
for (int sz = 0; sz <= r; sz++) {
// para cada tamanho
for (int x = 0; x < 26; x++) {
// adiciono todos os caras com final 'x' (e finalizo eles com [str[r] - 'a'])
dp[sz + 1][x][str[r] - 'a'] = sum[r][sz][x];
// adiciono as strings que terminam em [str[r] - 'a'] na soma do prefixo
add_self(sum[r + 1][sz + 1][str[r] - 'a'], dp[sz + 1][x][str[r] - 'a']);
// adiciono as strings que terminam em x do prefixo anterior no novo prefixo
add_self(sum[r + 1][sz][x], sum[r][sz][x]);
// soma de prefixo de [sz][x][y]
add_self(ans[sz + 1][x][str[r] - 'a'], dp[sz + 1][x][str[r] - 'a']);
}
}
}
int q; cin >> q;
for (int i = 0; i < q; i++) {
int l; cin >> l;
string suffix; cin >> suffix;
//long long ans = 0;
cout << ans[l][suffix[0] - 'a'][suffix[1] - 'a'] << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
1388 KB |
Output is correct |
2 |
Correct |
6 ms |
1388 KB |
Output is correct |
3 |
Correct |
7 ms |
1260 KB |
Output is correct |
4 |
Correct |
10 ms |
1388 KB |
Output is correct |
5 |
Correct |
51 ms |
8300 KB |
Output is correct |
6 |
Correct |
52 ms |
8300 KB |
Output is correct |
7 |
Correct |
51 ms |
8300 KB |
Output is correct |
8 |
Correct |
41 ms |
7916 KB |
Output is correct |
9 |
Runtime error |
404 ms |
131076 KB |
Execution killed with signal 9 |
10 |
Runtime error |
421 ms |
131076 KB |
Execution killed with signal 9 |