# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
953613 | 2024-03-26T10:34:11 Z | LucaIlie | Cubeword (CEOI19_cubeword) | C++17 | 70 ms | 13600 KB |
#include <bits/stdc++.h> using namespace std; const int MAX_ID = 62; const int MIN_LEN = 3; const int MAX_LEN = 10; const int MOD = 998244353; unordered_set<string> s[MAX_LEN + 1]; unordered_map<char, int> id; int m; int coef[MAX_ID][MAX_ID], prod[MAX_ID][MAX_ID][MAX_ID]; int solve() { int ans = 0; for ( int a = 0; a < m; a++ ) { for ( int b = 0; b < m; b++ ) { for ( int c = 0; c < m; c++ ) { prod[a][b][c] = 0; for ( int i = 0; i < m; i++ ) prod[a][b][c] = (prod[a][b][c] + (long long)coef[a][i] * coef[b][i] % MOD * coef[c][i]) % MOD; } } } for ( int a = 0; a < m; a++ ) { for ( int b = 0; b < m; b++ ) { for ( int c = 0; c < m; c++ ) { for ( int d = 0; d < m; d++ ) ans = (ans + prod[a][b][c] * (long long)prod[a][b][d] % MOD * prod[a][c][d] % MOD * prod[b][c][d]) % MOD; } } } return ans; } int main() { int n; cin >> n; for ( int i = 0; i < n; i++ ) { string t; cin >> t; s[t.size()].insert( t ); reverse( t.begin(), t.end() ); s[t.size()].insert( t ); for ( int i = 0; i < t.size(); i++ ) id[t[i]] = 1; } m = 0; for ( auto p: id ) id[p.first] = m++; int ans = 0; for ( int l = MIN_LEN; l <= MAX_LEN; l++ ) { if ( s[l].size() == 0 ) continue; for ( int i = 0; i < m; i++ ) { for ( int j = 0; j < m; j++ ) coef[i][j] = 0; } for ( string t: s[l] ) coef[id[t[0]]][id[t.back()]]++; ans += solve(); } cout << ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 13600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 13600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 13600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 13600 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |