Submission #68563439

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pi pair<int, int>
#define mp make_pair
#define vi vector<int>
#define vvi vector<vector<int>>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int INF = (int)4e18;
const int MODa = 1e9 + 7;
const int MOD = 998244353;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

int enc(vector<int>& p)
{
    int ans = 0;
    int pp = 1;
    for(int i=0; i<p.size(); i++)
    {
        ans += p[i]*pp;
        pp *= 100;
    }

    return ans;
}

vector<int> dec(int x, int n)
{
    vector<int> p(0);
    for(int i=0; i<n; i++)
    {
        p.pb(x%100);
        x /= 100;
    }

    return p;
}

int nv(string& s, int x, char c)
{
    if(x==s.size()) return x;

    if(x==0)
    {
        if(c==s[0]) return 1;
        else return 0;
    }

    int al = 0;
    string ns = s.substr(0, x) + c;
    for(int z=x+1; z; z--)
    {
        if(ns.substr(ns.size()-z, z)==s.substr(0, z))
        {
            al = z;
            break;
        }
    }

    return al;
}

void solve()
{
    int n, l;
    cin>>n>>l;

    vector<string> s(n);

    for(int i=0; i<n; i++)
    {
        cin>>s[i];
    }

    vector<map<int, int>> cnt(l+1);

    int prec[10][12][26];
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<=s[i].size(); j++)
        {
            for(int k=0; k<26; k++)
            {
                prec[i][j][k] = nv(s[i], j, ('a' + k));
            }
        }
    }

    // cerr<<"doenn"<<"\n";

    cnt[0][0] = 1;

    for(int i=0; i<l; i++)
    {
        // cerr<<i<<"\n";
        for(auto pp: cnt[i])
        {
            vector<int> dn = dec(pp.fi, n);
            vector<int> cn = dn;
            for(int j=0; j<26; j++)
            {
                for(int k=0; k<n; k++)
                {
                    // cn[k] = nv(s[k], dn[k], ('a'+j));
                    cn[k] = prec[k][dn[k]][j];
                }
                int ee = enc(cn);
                cnt[i+1][ee] += pp.se;
                cnt[i+1][ee] %= MOD;            
            }
        }
    }

    vector<int> fin(n);
    for(int i=0; i<n; i++)
    {
        fin[i] = s[i].size();
    }

    int ee = enc(fin);

    if(!cnt[l].count(ee))
    {
        cout<<0<<"\n";
        return;
    }

    cout<<cnt[l][ee]<<"\n";
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;  
    // cin>>t;
    while(t--)
    {
        solve();
    }

    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘long long int enc(std::vector<long long int>&)’:
Main.cpp:28:19: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<long long int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   28 |     for(int i=0; i<p.size(); i++)
      |                  ~^~~~~~~~~
Main.cpp: In function ‘long long int nv(std::string&, long long int, char)’:
Main.cpp:51:9: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   51 |     if(x==s.size()) return x;
      |        ~^~~~~~~~~~
Main.cpp: In function ‘void solve()’:
Main.cpp:90:23: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   90 |         for(int j=0; j<=s[i].size(); j++)
      |                      ~^~~~~~~~~~~~~

Judge Result