oj.uz

답안 #280387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
280387 2020-08-22T17:10:18 Z williamMBDK Cubeword (CEOI19_cubeword) C++14
0 / 100
 368 ms 15340 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
// int M = 62;
// string chars = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890";
int M = 30;
string chars = "abcdefghijklmnopABCDEFGHIJKLMNOP";
vector<vector<vector<int>>> cnt (11, vector<vector<int>> (M, vector<int> (M)));
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	map<char,int> mp;
	for(int i = 0; i < M; i++) mp[chars[i]] = i;
	int N; cin >> N;
	set<string> seen;
	for(int i = 0; i < N; i++){
		string s; cin >> s;
		if(seen.count(s)) continue;
		cnt[s.length()][mp[s[0]]][mp[s[s.length() - 1]]]++;
		seen.insert(s);
		reverse(s.begin(), s.end());
		if(seen.count(s)) continue;
		cnt[s.length()][mp[s[0]]][mp[s[s.length() - 1]]]++;
		seen.insert(s);
	}
	int MOD = 998244353;
	int res = 0;
	for(int len = 3; len <= 10; len++){
		vector<vector<vector<int>>> dp (M, vector<vector<int>> (M, vector<int> (M)));
		for(int i = 0; i < M; i++){
			for(int j = 0; j < M; j++){
				for(int k = 0; k < M; k++){
					for(int l = 0; l < M; l++){
						dp[i][j][k] += cnt[len][i][l] * cnt[len][j][l] * cnt[len][k][l] % MOD;
					}
				}
			}	
		}
		for(int i = 0; i < M; i++){
			for(int j = 0; j < M; j++){
				for(int k = 0; k < M; k++){
					for(int l = 0; l < M; l++){
						res += (dp[i][j][k] * dp[i][j][l]) % MOD * (dp[i][l][k] * dp[j][k][l]) % MOD;
					}
				}
			}	
		}
	}
	cout << res << endl;
	
}

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 368 ms 15340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 368 ms 15340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 368 ms 15340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 368 ms 15340 KB Output isn't correct
2 Halted 0 ms 0 KB -