| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 425573 | hhhhaura | 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.
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()
#define INF 1000000000000000000
#define eps (1e-9)
using namespace std;
#define int long long int
#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())
#ifdef wiwihorz
#define print(a...) kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) {while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#else
#define print(...) 0
#define vprint(...) 0
#endif
namespace solver {
const int P = 6, MOD = 998244353;
int ans = 0;
vector<vector<signed>> cnt[11];
vector<signed> cur;
set<string> st;
vector<pii> edge = {
{0, 1}, {0, 4}, {0, 2},
{1, 5}, {1, 3}, {2, 3},
{2, 6}, {3, 7}, {5, 7},
{5, 4}, {6, 7}, {4, 6}
};
void init_() {
rep(i, 0, 10)
cnt[i].assign(P, vector<int>(P, 0));
cur.assign(8, 0);
ans = 0, st.clear();
}
int count() {
int a = 0, c;
rep(i, 3, 10) {
c = 1;
for(auto j : edge) {
c = c * cnt[i][cur[j.first]][cur[j.second]] % MOD;
if(!c) break;
}
a = (a + c);
if(a >= MOD) a -= MOD;
}
return a;
}
void solve() {
for(cur[0] = 0; cur[0] < P; cur[0] ++)
for(cur[1] = 0; cur[1] < P; cur[1] ++)
for(cur[2] = 0; cur[2] < P; cur[2] ++)
for(cur[3] = 0; cur[3] < P; cur[3] ++)
for(cur[4] = 0; cur[4] < P; cur[4] ++)
for(cur[5] = 0; cur[5] < P; cur[5] ++)
for(cur[6] = 0; cur[6] < P; cur[6] ++)
for(cur[7] = 0; cur[7] < P; cur[7] ++) {
ans = (ans + count());
if(ans >= MOD) ans -= MOD;
}
}
};
using namespace solver;
signed main() {
ios::sync_with_stdio(false), cin.tie(0);
int n; cin >> n;
init_();
rep(i, 1, n) {
string s, s1; cin >> s;
int sz = s.size();
if(st.find(s) == st.end())
cnt[sz][s[0] - 'a'][s.back() - 'a'] ++;
st.insert(s);
s1 = s, reverse(all(s1));
if(st.find(s1) == st.end())
cnt[sz][s1[0] - 'a'][s1.back() - 'a'] ++;
st.insert(s1);
}
solve();
cout << ans << "\n";
return 0;
}