oj.uz

Submission #276146

# Submission time Handle Problem Language Result Execution time Memory
276146 2020-08-20T11:05:26 Z theStaticMind Cubeword (CEOI19_cubeword) C++14
0 / 100
 1100 ms 17192 KB 
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

const int k = 16;

int dp[k][k][k][k];
int dp2[k][k][k][k];
int dp3[k][k][k][k];
int dp4[k][k][k][k];

map<char, int> ptr;

void clear(){
	for(int a = 0; a < k; a++){
		for(int b = 0; b < k; b++){
			for(int c = 0; c < k; c++){
				for(int d = 0; d < k; d++){
					dp[a][b][c][d] = 0;
					dp2[a][b][c][d] = 0;
					dp3[a][b][c][d] = 0;
					dp4[a][b][c][d] = 0;
				}
			}
		}
	}
}
 
int solve(map<ii, int>& cnt){

	clear();

	/*for(auto p : cnt){
		cout << p.first.first << "-" << p.first.second << "=>" << p.second << "\n";
	}*/

	for(int a = 0; a < k; a++){
		for(int b = 0; b < k; b++){
			for(int c = 0; c < k; c++){
				for(int d = 0; d < k; d++){
					dp[a][b][c][d] = cnt[{a, b}] * cnt[{b, d}] % mod * cnt[{d, c}] % mod * cnt[{c, a}] % mod;
				}
			}
		}
	}

	for(int a = 0; a < k; a++){
		for(int b = 0; b < k; b++){
			for(int c = 0; c < k; c++){
				for(int d = 0; d < k; d++){
					for(int f = 0; f < k; f++){
						dp2[a][f][c][d] += dp[a][b][c][d] * cnt[{b, f}] % mod;
						dp2[a][f][c][d] %= mod;
					}
				}
			}
		}
	}

	for(int a = 0; a < k; a++){
		for(int f = 0; f < k; f++){
			for(int c = 0; c < k; c++){
				for(int d = 0; d < k; d++){
					for(int h = 0; h < k; h++){
						dp3[a][f][c][h] += dp2[a][f][c][d] * cnt[{d, h}] % mod * cnt[{f, h}] % mod;
						dp3[a][f][c][h] %= mod;
					}
				}
			}
		}
	}

	for(int a = 0; a < k; a++){
		for(int f = 0; f < k; f++){
			for(int c = 0; c < k; c++){
				for(int h = 0; h < k; h++){
					for(int g = 0; g < k; g++){
						dp4[a][f][g][h] += dp3[a][f][c][h] * cnt[{c, g}] % mod * cnt[{g, h}] % mod;
						dp4[a][f][g][h] %= mod;
					}
				}
			}
		}
	}

	int ret = 0;

	for(int a = 0; a < k; a++){
		for(int f = 0; f < k; f++){
			for(int g = 0; g < k; g++){
				for(int h = 0; h < k; h++){
					for(int e = 0; e < k; e++){
						ret += dp4[a][f][g][h] * cnt[{a, e}] % mod * cnt[{f, e}] % mod * cnt[{g, e}] % mod;
						ret %= mod;
					}
				}
			}
		}
	}

	return ret;
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, ans = 0;
	cin >> n;

	unordered_set<string> S[11];
	vector<string> arr;

	for(int i = 0; i < n; i++){
		string s;
		cin >> s;
		S[sz(s)].insert(s);
		reverse(all(s));
		S[sz(s)].insert(s);
	}

	for(char i = 'a'; i <= 'p'; i++) ptr[i] = 0;
//	for(char i = 'A'; i <= 'P'; i++) ptr[i] = 0;
	int ind = 0;
	for(auto& p : ptr){
		p.second = ind++;
	}

	for(int i = 3; i <= 10; i++){ 
		if(S[i].empty()) continue;
		map<ii, int> cnt;
		for(auto p : S[i]){
			cnt[{ptr[p[0]], ptr[p[i - 1]]}]++;
		}

		ans += solve(cnt);
	}

	cout << ans % mod;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1180 ms 17192 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1180 ms 17192 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1180 ms 17192 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1180 ms 17192 KB Time limit exceeded
2 Halted 0 ms 0 KB -