oj.uz

Submission #198640

# Submission time Handle Problem Language Result Execution time Memory
198640 2020-01-27T06:04:49 Z arnold518 Cubeword (CEOI19_cubeword) C++14
84 / 100
 561 ms 18772 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int MAXS = 52;
const ll MOD = 998244353;

int N;
ll ans, cnt[70][70], D[70][70][70];
vector<string> S, T[15];

int convert(char s)
{
	if('a'<=s && s<='z') return s-'a';
	if('A'<=s && s<='Z') return s-'A'+26;
	if('0'<=s && s<='9') return s-'0'+52;
}

int main()
{
	int i, j, p, q, k;

	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	cin>>N;
	for(i=1; i<=N; i++)
	{
		string s, t;
		cin>>s; t=s;
		reverse(t.begin(), t.end());
		S.push_back(s);
		S.push_back(t);
	}

	sort(S.begin(), S.end());
	S.erase(unique(S.begin(), S.end()), S.end());

	for(i=0; i<S.size(); i++) T[S[i].size()].push_back(S[i]);

	for(k=3; k<=10; k++)
	{
		vector<string> V=T[k];
		if(V.empty()) continue;

		for(i=0; i<MAXS; i++) for(j=0; j<MAXS; j++) cnt[i][j]=0;
		for(i=0; i<V.size(); i++) cnt[convert(V[i][0])][convert(V[i][V[i].size()-1])]++;

		for(i=0; i<MAXS; i++) for(j=i; j<MAXS; j++) for(p=j; p<MAXS; p++)
		{
			D[i][j][p]=0;
			for(q=0; q<MAXS; q++)
			{
				D[i][j][p]+=cnt[i][q]*cnt[j][q]%MOD*cnt[p][q]%MOD;
				D[i][j][p]%=MOD;
			}
		}

		for(i=0; i<MAXS; i++) for(j=i+1; j<MAXS; j++) for(p=j+1; p<MAXS; p++) for(q=p+1; q<MAXS; q++)
		{
			ans+=24*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=i, p=j+1; p<MAXS; p++) for(q=p+1; q<MAXS; q++)
		{
			ans+=12*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=i+1; j<MAXS; j++) for(p=j, q=p+1; q<MAXS; q++)
		{
			ans+=12*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=i+1; j<MAXS; j++) for(p=j+1; p<MAXS; p++)
		{
			q=p;
			ans+=12*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=i, p=j+1; p<MAXS; p++)
		{
			q=p;
			ans+=6*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=i+1; j<MAXS; j++)
		{
			p=q=j;
			ans+=4*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++) for(j=p=i, q=p+1; q<MAXS; q++)
		{
			ans+=4*D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}

		for(i=0; i<MAXS; i++)
		{
			j=p=q=i;
			ans+=D[i][j][p]%MOD*D[i][j][q]%MOD*D[i][p][q]%MOD*D[j][p][q]%MOD;
			ans%=MOD;
		}
	}
	cout<<ans;
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:42:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0; i<S.size(); i++) T[S[i].size()].push_back(S[i]);
           ~^~~~~~~~~
cubeword.cpp:50:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0; i<V.size(); i++) cnt[convert(V[i][0])][convert(V[i][V[i].size()-1])]++;
            ~^~~~~~~~~
cubeword.cpp: In function 'int convert(char)':
cubeword.cpp:21:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 18236 KB Output is correct
2 Correct 225 ms 16852 KB Output is correct
3 Correct 227 ms 18260 KB Output is correct
4 Correct 230 ms 18772 KB Output is correct
5 Correct 236 ms 18132 KB Output is correct
6 Correct 224 ms 17724 KB Output is correct
7 Correct 223 ms 18004 KB Output is correct
8 Correct 230 ms 17876 KB Output is correct
9 Correct 228 ms 18772 KB Output is correct
10 Correct 227 ms 18004 KB Output is correct
11 Correct 226 ms 17748 KB Output is correct
12 Correct 228 ms 17624 KB Output is correct
13 Correct 224 ms 17240 KB Output is correct
14 Correct 233 ms 18388 KB Output is correct
15 Correct 229 ms 17748 KB Output is correct
16 Correct 230 ms 18388 KB Output is correct
17 Correct 229 ms 17620 KB Output is correct
18 Correct 236 ms 17620 KB Output is correct
19 Correct 226 ms 17084 KB Output is correct
20 Correct 230 ms 18516 KB Output is correct
21 Correct 228 ms 17624 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 18236 KB Output is correct
2 Correct 225 ms 16852 KB Output is correct
3 Correct 227 ms 18260 KB Output is correct
4 Correct 230 ms 18772 KB Output is correct
5 Correct 236 ms 18132 KB Output is correct
6 Correct 224 ms 17724 KB Output is correct
7 Correct 223 ms 18004 KB Output is correct
8 Correct 230 ms 17876 KB Output is correct
9 Correct 228 ms 18772 KB Output is correct
10 Correct 227 ms 18004 KB Output is correct
11 Correct 226 ms 17748 KB Output is correct
12 Correct 228 ms 17624 KB Output is correct
13 Correct 224 ms 17240 KB Output is correct
14 Correct 233 ms 18388 KB Output is correct
15 Correct 229 ms 17748 KB Output is correct
16 Correct 230 ms 18388 KB Output is correct
17 Correct 229 ms 17620 KB Output is correct
18 Correct 236 ms 17620 KB Output is correct
19 Correct 226 ms 17084 KB Output is correct
20 Correct 230 ms 18516 KB Output is correct
21 Correct 228 ms 17624 KB Output is correct
22 Correct 229 ms 15192 KB Output is correct
23 Correct 227 ms 16336 KB Output is correct
24 Correct 234 ms 16096 KB Output is correct
25 Correct 224 ms 16572 KB Output is correct
26 Correct 224 ms 16472 KB Output is correct
27 Correct 227 ms 16980 KB Output is correct
28 Correct 224 ms 17108 KB Output is correct
29 Correct 234 ms 17172 KB Output is correct
30 Correct 230 ms 16468 KB Output is correct
31 Correct 225 ms 16340 KB Output is correct
32 Correct 236 ms 15312 KB Output is correct
33 Correct 229 ms 16212 KB Output is correct
34 Correct 561 ms 16468 KB Output is correct
35 Correct 228 ms 16480 KB Output is correct
36 Correct 230 ms 15188 KB Output is correct
37 Correct 229 ms 16468 KB Output is correct
38 Correct 228 ms 16468 KB Output is correct
39 Correct 225 ms 16468 KB Output is correct
40 Correct 230 ms 15572 KB Output is correct
41 Correct 234 ms 16084 KB Output is correct
42 Correct 226 ms 16188 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 18236 KB Output is correct
2 Correct 225 ms 16852 KB Output is correct
3 Correct 227 ms 18260 KB Output is correct
4 Correct 230 ms 18772 KB Output is correct
5 Correct 236 ms 18132 KB Output is correct
6 Correct 224 ms 17724 KB Output is correct
7 Correct 223 ms 18004 KB Output is correct
8 Correct 230 ms 17876 KB Output is correct
9 Correct 228 ms 18772 KB Output is correct
10 Correct 227 ms 18004 KB Output is correct
11 Correct 226 ms 17748 KB Output is correct
12 Correct 228 ms 17624 KB Output is correct
13 Correct 224 ms 17240 KB Output is correct
14 Correct 233 ms 18388 KB Output is correct
15 Correct 229 ms 17748 KB Output is correct
16 Correct 230 ms 18388 KB Output is correct
17 Correct 229 ms 17620 KB Output is correct
18 Correct 236 ms 17620 KB Output is correct
19 Correct 226 ms 17084 KB Output is correct
20 Correct 230 ms 18516 KB Output is correct
21 Correct 228 ms 17624 KB Output is correct
22 Correct 229 ms 15192 KB Output is correct
23 Correct 227 ms 16336 KB Output is correct
24 Correct 234 ms 16096 KB Output is correct
25 Correct 224 ms 16572 KB Output is correct
26 Correct 224 ms 16472 KB Output is correct
27 Correct 227 ms 16980 KB Output is correct
28 Correct 224 ms 17108 KB Output is correct
29 Correct 234 ms 17172 KB Output is correct
30 Correct 230 ms 16468 KB Output is correct
31 Correct 225 ms 16340 KB Output is correct
32 Correct 236 ms 15312 KB Output is correct
33 Correct 229 ms 16212 KB Output is correct
34 Correct 561 ms 16468 KB Output is correct
35 Correct 228 ms 16480 KB Output is correct
36 Correct 230 ms 15188 KB Output is correct
37 Correct 229 ms 16468 KB Output is correct
38 Correct 228 ms 16468 KB Output is correct
39 Correct 225 ms 16468 KB Output is correct
40 Correct 230 ms 15572 KB Output is correct
41 Correct 234 ms 16084 KB Output is correct
42 Correct 226 ms 16188 KB Output is correct
43 Correct 223 ms 17112 KB Output is correct
44 Correct 226 ms 16724 KB Output is correct
45 Correct 230 ms 17284 KB Output is correct
46 Correct 226 ms 16600 KB Output is correct
47 Correct 226 ms 16976 KB Output is correct
48 Correct 234 ms 16984 KB Output is correct
49 Correct 226 ms 16596 KB Output is correct
50 Correct 219 ms 16316 KB Output is correct
51 Correct 226 ms 16212 KB Output is correct
52 Correct 225 ms 16468 KB Output is correct
53 Correct 227 ms 16720 KB Output is correct
54 Correct 222 ms 16848 KB Output is correct
55 Correct 225 ms 15956 KB Output is correct
56 Correct 227 ms 16852 KB Output is correct
57 Correct 222 ms 16724 KB Output is correct
58 Correct 232 ms 16596 KB Output is correct
59 Correct 225 ms 15956 KB Output is correct
60 Correct 230 ms 17364 KB Output is correct
61 Correct 227 ms 16084 KB Output is correct
62 Correct 228 ms 16784 KB Output is correct
63 Correct 232 ms 16340 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 242 ms 18236 KB Output is correct
2 Correct 225 ms 16852 KB Output is correct
3 Correct 227 ms 18260 KB Output is correct
4 Correct 230 ms 18772 KB Output is correct
5 Correct 236 ms 18132 KB Output is correct
6 Correct 224 ms 17724 KB Output is correct
7 Correct 223 ms 18004 KB Output is correct
8 Correct 230 ms 17876 KB Output is correct
9 Correct 228 ms 18772 KB Output is correct
10 Correct 227 ms 18004 KB Output is correct
11 Correct 226 ms 17748 KB Output is correct
12 Correct 228 ms 17624 KB Output is correct
13 Correct 224 ms 17240 KB Output is correct
14 Correct 233 ms 18388 KB Output is correct
15 Correct 229 ms 17748 KB Output is correct
16 Correct 230 ms 18388 KB Output is correct
17 Correct 229 ms 17620 KB Output is correct
18 Correct 236 ms 17620 KB Output is correct
19 Correct 226 ms 17084 KB Output is correct
20 Correct 230 ms 18516 KB Output is correct
21 Correct 228 ms 17624 KB Output is correct
22 Correct 229 ms 15192 KB Output is correct
23 Correct 227 ms 16336 KB Output is correct
24 Correct 234 ms 16096 KB Output is correct
25 Correct 224 ms 16572 KB Output is correct
26 Correct 224 ms 16472 KB Output is correct
27 Correct 227 ms 16980 KB Output is correct
28 Correct 224 ms 17108 KB Output is correct
29 Correct 234 ms 17172 KB Output is correct
30 Correct 230 ms 16468 KB Output is correct
31 Correct 225 ms 16340 KB Output is correct
32 Correct 236 ms 15312 KB Output is correct
33 Correct 229 ms 16212 KB Output is correct
34 Correct 561 ms 16468 KB Output is correct
35 Correct 228 ms 16480 KB Output is correct
36 Correct 230 ms 15188 KB Output is correct
37 Correct 229 ms 16468 KB Output is correct
38 Correct 228 ms 16468 KB Output is correct
39 Correct 225 ms 16468 KB Output is correct
40 Correct 230 ms 15572 KB Output is correct
41 Correct 234 ms 16084 KB Output is correct
42 Correct 226 ms 16188 KB Output is correct
43 Correct 223 ms 17112 KB Output is correct
44 Correct 226 ms 16724 KB Output is correct
45 Correct 230 ms 17284 KB Output is correct
46 Correct 226 ms 16600 KB Output is correct
47 Correct 226 ms 16976 KB Output is correct
48 Correct 234 ms 16984 KB Output is correct
49 Correct 226 ms 16596 KB Output is correct
50 Correct 219 ms 16316 KB Output is correct
51 Correct 226 ms 16212 KB Output is correct
52 Correct 225 ms 16468 KB Output is correct
53 Correct 227 ms 16720 KB Output is correct
54 Correct 222 ms 16848 KB Output is correct
55 Correct 225 ms 15956 KB Output is correct
56 Correct 227 ms 16852 KB Output is correct
57 Correct 222 ms 16724 KB Output is correct
58 Correct 232 ms 16596 KB Output is correct
59 Correct 225 ms 15956 KB Output is correct
60 Correct 230 ms 17364 KB Output is correct
61 Correct 227 ms 16084 KB Output is correct
62 Correct 228 ms 16784 KB Output is correct
63 Correct 232 ms 16340 KB Output is correct
64 Incorrect 247 ms 16596 KB Output isn't correct
65 Halted 0 ms 0 KB -