Submission #519321

#TimeUsernameProblemLanguageResultExecution timeMemory
519321sidonCubeword (CEOI19_cubeword)C++17
0 / 100
1139 ms10296 KiB
#include <bits/stdc++.h> using namespace std; #define int int64_t #define F(X) for(int X = 0; X < B; X++) const int B = 62, LIM = 8, M = 998244353; int get(char c) { if(c < 60) return c - 48; return c - (c < 95 ? 55 : 61); } int n, _a[LIM][B][B], b[B][B][B], res; map<string, bool> inp[11]; #define c(i, j, k, l) ((b[i][j][l] * b[j][k][l]) % M) int32_t main() { ios::sync_with_stdio(0), cin.tie(0); cin >> n; while(n--) { string s; cin >> s; if(get(s[0]) > get(end(s)[-1])) reverse(begin(s), end(s)); int i = size(s); if(inp[i][s]) continue; inp[i][s] = 1; string t = s; reverse(begin(t), end(t)); int x = get(s[0]), y = get(end(s)[-1]); ++_a[i-3][x][y]; if(s != t) ++_a[i-3][y][x]; } for(int L = 0; L < 8; L++) { auto a = _a[L]; memset(b, 0, sizeof b); F(i) F(j) F(k) F(x) (b[i][j][k] += (((a[i][x] * a[j][x]) % M) * a[k][x])) %= M; F(i) F(j) F(k) F(l) (res += c(i, j, k, l) * c(l, k, j, i)) %= M; } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...