#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;
template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "["; REP(i, U) out << v[i] << ", "; out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
const int mod = 998244353;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
const int alpha = 52;
vector<int> cnv(150);
REP(i, 26) cnv['a' + i] = i;
REP(i, 26) {
cnv['A' + i] = 26 + i;
}
REP(i, 10){
cnv['0' + i] = 52 + i;
}
int n; cin >> n;
vector<string> strings(n);
cin >> strings;
ll D[alpha][alpha][alpha];
ll cn[alpha][alpha];
auto solve = [&](vector<string> a){
int nn = a.size();
memset(D, 0, sizeof(D));
memset(cn, 0, sizeof(cn));
for(string x : a){
int f = cnv[x[0]]; int s = cnv[x.back()];
string nx = x; reverse(all(nx)); // if palindrome
if(x == nx) cn[f][f]++;
else{
cn[f][s]++; cn[s][f]++;
}
}
REP(i, alpha){
REP(j, alpha){
REP(k, alpha){
REP(g, alpha){
D[j][k][g] += (cn[i][j] * cn[i][k] * cn[i][g]) % mod;
}
}
}
}
ll res = 0;
REP(a, alpha){
REP(b, alpha){
REP(c, alpha){
REP(d, alpha){
res += ((((D[a][d][c] * D[a][d][b]) % mod) * D[a][c][b]) % mod) * D[d][c][b];
res %= mod;
}
}
}
}
return res;
};
vector<vector<string>> todo(11);
REP(i, n) todo[strings[i].length()].pb(strings[i]);
ll ans = 0;
FOR(i, 3, 11, 1){
if(todo[i].size() > 0)
ans += solve(todo[i]);
ans %= mod;
}
cout << ans << "\n";
return 0;
}
Compilation message
cubeword.cpp: In lambda function:
cubeword.cpp:76:13: warning: unused variable 'nn' [-Wunused-variable]
76 | int nn = a.size();
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
595 ms |
8468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
595 ms |
8468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
595 ms |
8468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
595 ms |
8468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
