제출 #519361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
519361		sidon	Cubeword (CEOI19_cubeword)	C++17	100 / 100	1062 ms	32004 KiB

cubeword

#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define F(X) for(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[LIM][B][B][B], res;
map<string, bool> inp;
int i, j, k, l, x;

#define c(i, j, k, l) ((b[L][i][j][l] * b[L][j][k][l]) % M)
 
int32_t main() {
	cin >> n;
	while(n--) {
		string s; cin >> s;
		i = size(s);
 
		if(inp[s]) continue;
 
		string t = s;
		reverse(begin(t), end(t));
		inp[s] = inp[t] = 1;
 
		int z = get(s[0]), y = get(end(s)[-1]);
		++a[i-3][z][y];
		if(s != t) ++a[i-3][y][z];
	}
 
	for(int L = 0; L < LIM; L++) {
		F(i) F(j) F(k) F(x)
			b[L][i][j][k] += a[L][i][x] * a[L][j][x] * a[L][k][x];

		F(i) F(j) F(k)
			b[L][i][j][k] %= M;

		F(i) F(j) F(k) F(l)
			res += (c(i, j, k, l) * c(l, k, j, i)) % M;
	}
 
	cout << res % M;
}

• Subtask 1: 21 / 21
• Subtask 2: 29 / 29
• Subtask 3: 34 / 34
• Subtask 4: 16 / 16