oj.uz

Submission #198642

# Submission time Handle Problem Language Result Execution time Memory
198642 2020-01-27T06:06:04 Z arnold518 Cubeword (CEOI19_cubeword) C++14
84 / 100
 290 ms 18644 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;

	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:40: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:48: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 275 ms 18000 KB Output is correct
2 Correct 275 ms 16824 KB Output is correct
3 Correct 284 ms 18332 KB Output is correct
4 Correct 279 ms 18640 KB Output is correct
5 Correct 285 ms 18344 KB Output is correct
6 Correct 276 ms 17744 KB Output is correct
7 Correct 266 ms 17872 KB Output is correct
8 Correct 277 ms 17744 KB Output is correct
9 Correct 277 ms 18644 KB Output is correct
10 Correct 290 ms 18232 KB Output is correct
11 Correct 281 ms 17664 KB Output is correct
12 Correct 280 ms 17616 KB Output is correct
13 Correct 271 ms 17376 KB Output is correct
14 Correct 279 ms 18388 KB Output is correct
15 Correct 276 ms 17748 KB Output is correct
16 Correct 273 ms 18256 KB Output is correct
17 Correct 275 ms 17712 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 269 ms 17060 KB Output is correct
20 Correct 284 ms 18512 KB Output is correct
21 Correct 281 ms 17592 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 18000 KB Output is correct
2 Correct 275 ms 16824 KB Output is correct
3 Correct 284 ms 18332 KB Output is correct
4 Correct 279 ms 18640 KB Output is correct
5 Correct 285 ms 18344 KB Output is correct
6 Correct 276 ms 17744 KB Output is correct
7 Correct 266 ms 17872 KB Output is correct
8 Correct 277 ms 17744 KB Output is correct
9 Correct 277 ms 18644 KB Output is correct
10 Correct 290 ms 18232 KB Output is correct
11 Correct 281 ms 17664 KB Output is correct
12 Correct 280 ms 17616 KB Output is correct
13 Correct 271 ms 17376 KB Output is correct
14 Correct 279 ms 18388 KB Output is correct
15 Correct 276 ms 17748 KB Output is correct
16 Correct 273 ms 18256 KB Output is correct
17 Correct 275 ms 17712 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 269 ms 17060 KB Output is correct
20 Correct 284 ms 18512 KB Output is correct
21 Correct 281 ms 17592 KB Output is correct
22 Correct 280 ms 15220 KB Output is correct
23 Correct 272 ms 16208 KB Output is correct
24 Correct 270 ms 16080 KB Output is correct
25 Correct 272 ms 16824 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 271 ms 16920 KB Output is correct
28 Correct 267 ms 16976 KB Output is correct
29 Correct 268 ms 17232 KB Output is correct
30 Correct 267 ms 16696 KB Output is correct
31 Correct 263 ms 16268 KB Output is correct
32 Correct 271 ms 15328 KB Output is correct
33 Correct 274 ms 16208 KB Output is correct
34 Correct 265 ms 16336 KB Output is correct
35 Correct 269 ms 16588 KB Output is correct
36 Correct 266 ms 15184 KB Output is correct
37 Correct 271 ms 16208 KB Output is correct
38 Correct 268 ms 16340 KB Output is correct
39 Correct 268 ms 16464 KB Output is correct
40 Correct 269 ms 15824 KB Output is correct
41 Correct 262 ms 16080 KB Output is correct
42 Correct 271 ms 16080 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 18000 KB Output is correct
2 Correct 275 ms 16824 KB Output is correct
3 Correct 284 ms 18332 KB Output is correct
4 Correct 279 ms 18640 KB Output is correct
5 Correct 285 ms 18344 KB Output is correct
6 Correct 276 ms 17744 KB Output is correct
7 Correct 266 ms 17872 KB Output is correct
8 Correct 277 ms 17744 KB Output is correct
9 Correct 277 ms 18644 KB Output is correct
10 Correct 290 ms 18232 KB Output is correct
11 Correct 281 ms 17664 KB Output is correct
12 Correct 280 ms 17616 KB Output is correct
13 Correct 271 ms 17376 KB Output is correct
14 Correct 279 ms 18388 KB Output is correct
15 Correct 276 ms 17748 KB Output is correct
16 Correct 273 ms 18256 KB Output is correct
17 Correct 275 ms 17712 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 269 ms 17060 KB Output is correct
20 Correct 284 ms 18512 KB Output is correct
21 Correct 281 ms 17592 KB Output is correct
22 Correct 280 ms 15220 KB Output is correct
23 Correct 272 ms 16208 KB Output is correct
24 Correct 270 ms 16080 KB Output is correct
25 Correct 272 ms 16824 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 271 ms 16920 KB Output is correct
28 Correct 267 ms 16976 KB Output is correct
29 Correct 268 ms 17232 KB Output is correct
30 Correct 267 ms 16696 KB Output is correct
31 Correct 263 ms 16268 KB Output is correct
32 Correct 271 ms 15328 KB Output is correct
33 Correct 274 ms 16208 KB Output is correct
34 Correct 265 ms 16336 KB Output is correct
35 Correct 269 ms 16588 KB Output is correct
36 Correct 266 ms 15184 KB Output is correct
37 Correct 271 ms 16208 KB Output is correct
38 Correct 268 ms 16340 KB Output is correct
39 Correct 268 ms 16464 KB Output is correct
40 Correct 269 ms 15824 KB Output is correct
41 Correct 262 ms 16080 KB Output is correct
42 Correct 271 ms 16080 KB Output is correct
43 Correct 268 ms 17104 KB Output is correct
44 Correct 266 ms 16720 KB Output is correct
45 Correct 271 ms 17388 KB Output is correct
46 Correct 261 ms 16664 KB Output is correct
47 Correct 264 ms 16980 KB Output is correct
48 Correct 270 ms 17232 KB Output is correct
49 Correct 267 ms 16592 KB Output is correct
50 Correct 268 ms 16336 KB Output is correct
51 Correct 260 ms 16080 KB Output is correct
52 Correct 268 ms 16592 KB Output is correct
53 Correct 266 ms 16628 KB Output is correct
54 Correct 268 ms 16696 KB Output is correct
55 Correct 281 ms 15952 KB Output is correct
56 Correct 263 ms 16720 KB Output is correct
57 Correct 268 ms 16592 KB Output is correct
58 Correct 274 ms 16720 KB Output is correct
59 Correct 269 ms 15820 KB Output is correct
60 Correct 273 ms 17476 KB Output is correct
61 Correct 269 ms 15824 KB Output is correct
62 Correct 259 ms 16592 KB Output is correct
63 Correct 269 ms 16336 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 18000 KB Output is correct
2 Correct 275 ms 16824 KB Output is correct
3 Correct 284 ms 18332 KB Output is correct
4 Correct 279 ms 18640 KB Output is correct
5 Correct 285 ms 18344 KB Output is correct
6 Correct 276 ms 17744 KB Output is correct
7 Correct 266 ms 17872 KB Output is correct
8 Correct 277 ms 17744 KB Output is correct
9 Correct 277 ms 18644 KB Output is correct
10 Correct 290 ms 18232 KB Output is correct
11 Correct 281 ms 17664 KB Output is correct
12 Correct 280 ms 17616 KB Output is correct
13 Correct 271 ms 17376 KB Output is correct
14 Correct 279 ms 18388 KB Output is correct
15 Correct 276 ms 17748 KB Output is correct
16 Correct 273 ms 18256 KB Output is correct
17 Correct 275 ms 17712 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 269 ms 17060 KB Output is correct
20 Correct 284 ms 18512 KB Output is correct
21 Correct 281 ms 17592 KB Output is correct
22 Correct 280 ms 15220 KB Output is correct
23 Correct 272 ms 16208 KB Output is correct
24 Correct 270 ms 16080 KB Output is correct
25 Correct 272 ms 16824 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 271 ms 16920 KB Output is correct
28 Correct 267 ms 16976 KB Output is correct
29 Correct 268 ms 17232 KB Output is correct
30 Correct 267 ms 16696 KB Output is correct
31 Correct 263 ms 16268 KB Output is correct
32 Correct 271 ms 15328 KB Output is correct
33 Correct 274 ms 16208 KB Output is correct
34 Correct 265 ms 16336 KB Output is correct
35 Correct 269 ms 16588 KB Output is correct
36 Correct 266 ms 15184 KB Output is correct
37 Correct 271 ms 16208 KB Output is correct
38 Correct 268 ms 16340 KB Output is correct
39 Correct 268 ms 16464 KB Output is correct
40 Correct 269 ms 15824 KB Output is correct
41 Correct 262 ms 16080 KB Output is correct
42 Correct 271 ms 16080 KB Output is correct
43 Correct 268 ms 17104 KB Output is correct
44 Correct 266 ms 16720 KB Output is correct
45 Correct 271 ms 17388 KB Output is correct
46 Correct 261 ms 16664 KB Output is correct
47 Correct 264 ms 16980 KB Output is correct
48 Correct 270 ms 17232 KB Output is correct
49 Correct 267 ms 16592 KB Output is correct
50 Correct 268 ms 16336 KB Output is correct
51 Correct 260 ms 16080 KB Output is correct
52 Correct 268 ms 16592 KB Output is correct
53 Correct 266 ms 16628 KB Output is correct
54 Correct 268 ms 16696 KB Output is correct
55 Correct 281 ms 15952 KB Output is correct
56 Correct 263 ms 16720 KB Output is correct
57 Correct 268 ms 16592 KB Output is correct
58 Correct 274 ms 16720 KB Output is correct
59 Correct 269 ms 15820 KB Output is correct
60 Correct 273 ms 17476 KB Output is correct
61 Correct 269 ms 15824 KB Output is correct
62 Correct 259 ms 16592 KB Output is correct
63 Correct 269 ms 16336 KB Output is correct
64 Incorrect 266 ms 16596 KB Output isn't correct
65 Halted 0 ms 0 KB -