# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
658580 | 2022-11-13T15:13:38 Z | mychecksedad | Cubeword (CEOI19_cubeword) | C++17 | 0 ms | 0 KB |
/* Author : Mychecksdead */ #include<bits/stdc++.h> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long int ll; typedef long double ld; #define MOD1 (1000000000+7) #define MOD (998244353) #define PI 3.1415926535 #define pb push_back #define setp() cout << setprecision(15) #define all(x) x.begin(), x.end() #define debug(x) cerr << #x << " is " << x << '\n'; const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20; int n, S = 63; ll dp[100][100], d[70][70][70]; vector<string> s[15]; bool is_palindrome(string &a){ bool ok = 1; int x = a.length(); for(int i = 0; i < x / 2; ++i) ok &= (a[i] == a[x - i - 1]); return ok; } int comb(int a, int b, int c, int d){ if(a==b && b==c && c==d) return 1; if(a==b && b==c && c!=d) return 4; if(a==b && b!=c && c==d) return 6; if(a!=b && b==c && c==d) return 4; if(a==b && b!=c && c!=d) return 12; if(a!=b && b==c && c!=d) return 12; if(a!=b && b!=c && c==d) return 12; if(a==b && b==c && c==d) return 24; } void solve(){ cin >> n; for(int i = 0; i < n; ++i){ string a; cin >> a; for(char &c: a){ if(c >= '0' && c <= '9'){ c = 'z' + 26 + (c - '0') + 1; } else if(!(c >= 'a' && c <= 'z')){ c = 'z' + (c - 'A') + 1; } } s[a.length()].pb(a); } ll ans = 0; for(int i = 1; i < 15; ++i){ if(s[i].empty()) continue; for(int j = 0; j < S; ++j) for(int k = 0; k < S; ++k) dp[j][k] = 0; map<string, bool> used; for(auto a: s[i]){ if(used[a]) continue; if(is_palindrome(a)){ dp[a[0] - 'a'][a[0] - 'a']++; }else{ dp[a[0] - 'a'][a.back() - 'a']++; dp[a.back() - 'a'][a[0] - 'a']++; } reverse(all(a)); used[a] = 1; } for(int a = 0; a < S; ++a){ for(int b = a; b < S; ++b){ for(int c = b; c < S; ++c){ d[a][b][c] = 0; for(int l = 0; l < S; ++l){ (d[a][b][c] += dp[a][l] * dp[b][l] * dp[c][l]) %= MOD; } } } } for(int a = 0; a < S; ++a){ for(int b = a; b < S; ++b){ for(int c = b; c < S; ++c){ for(int e = c; e < S; ++e){ ll p = (d[a][b][c] * d[a][b][e] % MOD) * (d[a][c][e] * d[b][c][e] % MOD) % MOD; (ans += p * comb(a, b, c, d)) %= MOD; } } } } } cout << ans; } int main(){ cin.tie(0); ios::sync_with_stdio(0); int T = 1, aa; // cin >> T;aa=T; while(T--){ // cout << "Case #" << aa-T << ": "; solve(); } return 0; }