Submission #898816

#	Time	Username	Problem	Language	Result	Execution time	Memory
898816		Alish	Cubeword (CEOI19_cubeword)	C++17	84 / 100	429 ms	16984 KiB

cubeword

#include<bits/stdc++.h>

//#pragma GCC optimize("O3")
//#pragma GCC target("sse4")

using namespace std;

typedef long long           ll;
typedef pair<int, int>      pii;
typedef pair<ll, ll>        pll;
typedef long double         ld;


#define endl                '\n'
#define pb                  push_back
#define all(x)              x.begin(), x.end()
#define F                   first
#define S                   second
#define fast_io             ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define debug(x)            cerr<<#x<<" "<<x<<endl;

ll mod = 998244353;

const int N = 1e6+23, S= 33;
ll ans=0;
ll num[S][S][S];
ll cnt[S][S];
set<string> st[11];
int n;

ll power(ll a, ll b){
    ll ans=1;
    a%=mod;
    while(b){
        if(b&1) ans=ans*a%mod;
        b>>=1;
        a=a*a%mod;
    }
    return ans;
}

int get(char c){
    if(c>='a' && c<='p'){
        int t=c-'a';
        return t;
    }
    if(c>='A' && c<='P'){
        int t=c-'A';
        t+=16;
        return t;
    }
    exit(0);
}



int main()
{
    fast_io
    cin>>n;
    for (int i=0; i<n; i++){
        string s; cin>>s;
        st[s.size()].insert(s);
        reverse(all(s));
        st[s.size()].insert(s);
    }

    for (int i=3; i<=10; i++){
        memset(num, 0, sizeof(num));
        memset(cnt, 0, sizeof(cnt));

        for (string s : st[i]){
            char c=s.back();
            int t=get(c);
            c=s[0];
            int r=get(c);
            cnt[r][t]++;
        }
        for (int x=0; x<S; x++) for (int a=0; a<S; a++) for (int b=0; b<S; b++) for (int c=0; c<S; c++)num[a][b][c]=(num[a][b][c]+cnt[x][a]*cnt[x][b]%mod*cnt[x][c]%mod)%mod;

        for (int a=0; a<S; a++) for (int b=0; b<S; b++) for (int c=0; c<S; c++) for (int d=0; d<S; d++) ans=(ans+ num[a][b][c]*num[a][b][d]%mod*num[a][c][d]%mod*num[b][c][d]%mod)%mod;

    }
    cout<<ans<<endl;

}

• Subtask 1: 21 / 21
• Subtask 2: 29 / 29
• Subtask 3: 34 / 34
• Subtask 4: 0 / 16