| Task: | String padding |
| Sender: | aalto26im_028 |
| Submission time: | 2026-11-02 17:30:28 +0200 |
| Language: | C++ (C++23) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | ACCEPTED | 0.02 s | details |
| #8 | ACCEPTED | 0.01 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.02 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.01 s | details |
| #15 | ACCEPTED | 0.01 s | details |
| #16 | ACCEPTED | 0.00 s | details |
| #17 | ACCEPTED | 0.00 s | details |
| #18 | ACCEPTED | 0.01 s | details |
Code
// #ifdef ONLINE_JUDGE
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #endif
#include "bits/stdc++.h"
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define FOR(i, a, b) for(__typeof(b) i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(__typeof(a) i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define dq deque<int>
#define nend '\n'
using namespace std;
const ll inf = 1e18;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
const int MOD = 1e9 + 7;
const ll hashi = 2e9 + 11;
void init_code() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int M=105;
int n, m;
string p;
int pi_[M], go[M][26]; // go[j][c]: matched j chars of p, add letter c -> matched how many now
ll dp[M], ndp[M]; // dp[j]: strings so far whose longest suffix matching a prefix of p has length j
// answer = all strings no contain p
void solve() {
cin >> n >> p;
m=p.size();
// KMP
FOR(i,1,m-1) {
int k=pi_[i-1];
while (k>0 && p[i]!=p[k]) k=pi_[k-1];
if (p[i]==p[k]) k++;
pi_[i]=k;
}
// automaton
FOR(j,0,m-1) FOR(c,0,25) {
if (p[j]-'A'==c) go[j][c]=j+1;
else go[j][c]= j==0 ? 0 : go[pi_[j-1]][c];
}
dp[0]=1;
FOR(i,1,n) {
FOR(j,0,m-1) ndp[j]=0;
FOR(j,0,m-1) if (dp[j]) FOR(c,0,25) {
int k=go[j][c];
if (k<m) ndp[k]=(ndp[k]+dp[j])%MOD;///p appearred
}
FOR(j,0,m-1) dp[j]=ndp[j];
}
ll avoid=0, all=1;
FOR(j,0,m-1) avoid=(avoid+dp[j])%MOD;
FOR(i,1,n) all=all*26%MOD;
cout << ((all-avoid)%MOD+MOD)%MOD << nend;
}
int main() {
init_code();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 100 YWANYWAZYWANYWA |
| correct output |
|---|
| 134837038 |
| user output |
|---|
| 134837038 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 100 EDMXEDVNEDMXED |
| correct output |
|---|
| 642715950 |
| user output |
|---|
| 642715950 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 100 SDARSDAWVSDARSDA |
| correct output |
|---|
| 748728234 |
| user output |
|---|
| 748728234 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 100 HBDHBSHBDHB |
| correct output |
|---|
| 594110560 |
| user output |
|---|
| 594110560 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 100 CUNXUYGNGNEROXVLASQB |
| correct output |
|---|
| 675706202 |
| user output |
|---|
| 675706202 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 1000 LZAOLRKGLZAOLXLZAOLRKGLZAOLTLZ... |
| correct output |
|---|
| 318756627 |
| user output |
|---|
| 318756627 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1000 SUASJSUASSGDSUASJSUASGKSUASJSU... |
| correct output |
|---|
| 367950233 |
| user output |
|---|
| 367950233 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 1000 NHYGNHEWNHYGNHFSNHYGNHEWNHYGNH... |
| correct output |
|---|
| 849646061 |
| user output |
|---|
| 849646061 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 1000 ZOCUZOCGRFZOCUZOCOQZOCUZOCGRFZ... |
| correct output |
|---|
| 32142571 |
| user output |
|---|
| 32142571 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 1000 LJZMKDTECKBXBTQQUMLGADBDNGWGPY... |
| correct output |
|---|
| 26128120 |
| user output |
|---|
| 26128120 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 1 A |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 100 AVXETIDRHKPAKRBEAAVHLOPFACULSE... |
| correct output |
|---|
| 228794815 |
| user output |
|---|
| 228794815 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 3 ABC |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 745 RRQOVUJRQBIMIQK |
| correct output |
|---|
| 504765084 |
| user output |
|---|
| 504765084 |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 666 ABCABCDABCABCX |
| correct output |
|---|
| 920654188 |
| user output |
|---|
| 920654188 |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 6 AA |
| correct output |
|---|
| 2212651 |
| user output |
|---|
| 2212651 |
Test 17
Verdict: ACCEPTED
| input |
|---|
| 1 B |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 18
Verdict: ACCEPTED
| input |
|---|
| 1000 OMAKARAAA |
| correct output |
|---|
| 408042378 |
| user output |
|---|
| 408042378 |
