#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long mod = 998244353;
int n;
vector<string> vec[20];
long long add(long long a, long long b) {
a += b;
if(a > mod) {
a -= mod;
}
}
long long mult(long long a, long long b) {
return (a * b) % mod;
}
long long sub(long long a, long long b) {
return (a - b + 2 * mod) % mod;
}
long long dp[64][64][64];
unordered_map<char, int> mp;
long long q[64][64];
int m = 61;
long long answ = 0;
void solve(int len) {
memset(dp, 0, sizeof(dp));
memset(q, 0, sizeof(q));
for(auto i: vec[len]) {
int first = mp[i[0]];
int last = mp[i[len - 1]];
q[first][last]++;
}
for(int start = 0; start <= m; start++) {
for(int i = 0; i <= m; i++) {
for(int j = 0; j <= m; j++) {
for(int k = 0; k <= m; k++) {
long long get = mult(q[start][i], mult(q[start][j], q[start][k]));
dp[i][j][k] = add(dp[i][j][k], get);
}
}
}
}
for(int i = 0; i <= m; i++) {
for(int j = 0; j <= m; j++) {
for(int k = 0; k <= m; k++) {
if(!dp[i][j][k]) continue;
for(int e = 0; e <= m; e++) {
if(!dp[i][j][e]) continue;
long long pt = mult(dp[i][j][e], dp[i][j][k]);
pt = mult(pt, dp[j][e][k]);
pt = mult(pt, dp[i][e][k]);
answ = add(answ, pt);
}
}
}
}
}
void solve_() {
cin >> n;
for(int i = 1; i <= n; i++) {
string s; cin >> s;
vec[sz(s)].push_back(s);
reverse(all(s));
vec[sz(s)].push_back(s);
}
mp.reserve(1000);
for(char i = 'a'; i <= 'z'; i++) {
mp[i] = i - 'a';
}
for(char i = 'A'; i <= 'Z'; i++) {
mp[i] = 26 + (i - 'A');
}
for(char i = '0'; i <= '9'; i++) {
mp[i] = 52 + (i - '0');
}
for(int i = 3; i <= 10; i++) {
sort(all(vec[i]));
uniq(vec[i]);
solve(i);
}
cout << answ << '\n';
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
cubeword.cpp: In function 'long long int add(long long int, long long int)':
cubeword.cpp:81:1: warning: no return statement in function returning non-void [-Wreturn-type]
81 | }
| ^
cubeword.cpp: In function 'void setIO(std::string)':
cubeword.cpp:66:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
66 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cubeword.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
64 ms |
9016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
64 ms |
9016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
64 ms |
9016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
64 ms |
9016 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
