# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198633 | arnold518 | Cubeword (CEOI19_cubeword) | C++14 | 0 ms | 0 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5;
const int S = 6;
const ll MOD = 998244353;
int N;
ll ans, cnt[70][70], D[70][70][70];
vector<string> S, T[15];
int convert(char s)
{
if('a'<=s && s<='z') return s-'a';
if('A'<=s && s<='Z') return s-'A'+26;
if('0'<=s && s<='9') return s-'0'+52;
}
int main()
{
int i, j, p, q, k;
//ios_base::sync_with_stdio(false);
//cin.tie(NULL); cout.tie(NULL);
cin>>N;
for(i=1; i<=N; i++)
{
string s, t;
cin>>s; t=s;
reverse(t.begin(), t.end());
S.push_back(s);
S.push_back(t);
}
sort(S.begin(), S.end());
S.erase(unique(S.begin(), S.end()), S.end());
for(i=0; i<S.size(); i++) T[S[i].size()].push_back(S[i]);
for(k=3; k<=10; k++)
{
vector<string> V=T[k];
if(V.empty()) continue;
memset(cnt, 0, sizeof(cnt));
memset(D, 0, sizeof(D));
for(i=0; i<V.size(); i++) cnt[convert(V[i][0])][convert(V[i][V[i].size()-1])]++;
for(i=0; i<S; i++) for(j=0; j<S; j++) for(p=0; p<S; p++)
{
for(q=0; q<S; q++)
{
D[i][j][p]+=cnt[i][q]*cnt[j][q]%MOD*cnt[p][q]%MOD;
D[i][j][p]%=MOD;
}
}
for(i=0; i<S; i++) for(j=0; j<S; j++) for(p=0; p<S; p++) for(q=0; q<S; q++)
{
ans+=D[i][j][p]*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
ans%=MOD;
}
}
cout<<ans;
}