oj.uz

답안 #198638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
198638 2020-01-27T06:03:02 Z arnold518 Cubeword (CEOI19_cubeword) C++14
21 / 100
 1100 ms 18640 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

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 18104 KB Output is correct
2 Correct 275 ms 16964 KB Output is correct
3 Correct 277 ms 18388 KB Output is correct
4 Correct 283 ms 18616 KB Output is correct
5 Correct 273 ms 18260 KB Output is correct
6 Correct 274 ms 17872 KB Output is correct
7 Correct 277 ms 17872 KB Output is correct
8 Correct 286 ms 17748 KB Output is correct
9 Correct 282 ms 18640 KB Output is correct
10 Correct 287 ms 18004 KB Output is correct
11 Correct 275 ms 17652 KB Output is correct
12 Correct 274 ms 17492 KB Output is correct
13 Correct 277 ms 17232 KB Output is correct
14 Correct 278 ms 18384 KB Output is correct
15 Correct 271 ms 17744 KB Output is correct
16 Correct 276 ms 18256 KB Output is correct
17 Correct 275 ms 17744 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 272 ms 17080 KB Output is correct
20 Correct 287 ms 18492 KB Output is correct
21 Correct 271 ms 17488 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 18104 KB Output is correct
2 Correct 275 ms 16964 KB Output is correct
3 Correct 277 ms 18388 KB Output is correct
4 Correct 283 ms 18616 KB Output is correct
5 Correct 273 ms 18260 KB Output is correct
6 Correct 274 ms 17872 KB Output is correct
7 Correct 277 ms 17872 KB Output is correct
8 Correct 286 ms 17748 KB Output is correct
9 Correct 282 ms 18640 KB Output is correct
10 Correct 287 ms 18004 KB Output is correct
11 Correct 275 ms 17652 KB Output is correct
12 Correct 274 ms 17492 KB Output is correct
13 Correct 277 ms 17232 KB Output is correct
14 Correct 278 ms 18384 KB Output is correct
15 Correct 271 ms 17744 KB Output is correct
16 Correct 276 ms 18256 KB Output is correct
17 Correct 275 ms 17744 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 272 ms 17080 KB Output is correct
20 Correct 287 ms 18492 KB Output is correct
21 Correct 271 ms 17488 KB Output is correct
22 Correct 274 ms 15184 KB Output is correct
23 Correct 265 ms 16184 KB Output is correct
24 Correct 280 ms 16080 KB Output is correct
25 Correct 278 ms 16728 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 270 ms 16976 KB Output is correct
28 Correct 270 ms 17104 KB Output is correct
29 Correct 273 ms 17232 KB Output is correct
30 Correct 263 ms 16464 KB Output is correct
31 Correct 271 ms 16336 KB Output is correct
32 Correct 272 ms 15440 KB Output is correct
33 Correct 273 ms 16212 KB Output is correct
34 Correct 266 ms 16336 KB Output is correct
35 Correct 269 ms 16488 KB Output is correct
36 Correct 267 ms 15184 KB Output is correct
37 Correct 266 ms 16076 KB Output is correct
38 Correct 274 ms 16468 KB Output is correct
39 Correct 274 ms 16464 KB Output is correct
40 Correct 277 ms 15604 KB Output is correct
41 Correct 270 ms 16208 KB Output is correct
42 Execution timed out 1122 ms 16208 KB Time limit exceeded

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 18104 KB Output is correct
2 Correct 275 ms 16964 KB Output is correct
3 Correct 277 ms 18388 KB Output is correct
4 Correct 283 ms 18616 KB Output is correct
5 Correct 273 ms 18260 KB Output is correct
6 Correct 274 ms 17872 KB Output is correct
7 Correct 277 ms 17872 KB Output is correct
8 Correct 286 ms 17748 KB Output is correct
9 Correct 282 ms 18640 KB Output is correct
10 Correct 287 ms 18004 KB Output is correct
11 Correct 275 ms 17652 KB Output is correct
12 Correct 274 ms 17492 KB Output is correct
13 Correct 277 ms 17232 KB Output is correct
14 Correct 278 ms 18384 KB Output is correct
15 Correct 271 ms 17744 KB Output is correct
16 Correct 276 ms 18256 KB Output is correct
17 Correct 275 ms 17744 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 272 ms 17080 KB Output is correct
20 Correct 287 ms 18492 KB Output is correct
21 Correct 271 ms 17488 KB Output is correct
22 Correct 274 ms 15184 KB Output is correct
23 Correct 265 ms 16184 KB Output is correct
24 Correct 280 ms 16080 KB Output is correct
25 Correct 278 ms 16728 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 270 ms 16976 KB Output is correct
28 Correct 270 ms 17104 KB Output is correct
29 Correct 273 ms 17232 KB Output is correct
30 Correct 263 ms 16464 KB Output is correct
31 Correct 271 ms 16336 KB Output is correct
32 Correct 272 ms 15440 KB Output is correct
33 Correct 273 ms 16212 KB Output is correct
34 Correct 266 ms 16336 KB Output is correct
35 Correct 269 ms 16488 KB Output is correct
36 Correct 267 ms 15184 KB Output is correct
37 Correct 266 ms 16076 KB Output is correct
38 Correct 274 ms 16468 KB Output is correct
39 Correct 274 ms 16464 KB Output is correct
40 Correct 277 ms 15604 KB Output is correct
41 Correct 270 ms 16208 KB Output is correct
42 Execution timed out 1122 ms 16208 KB Time limit exceeded

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 284 ms 18104 KB Output is correct
2 Correct 275 ms 16964 KB Output is correct
3 Correct 277 ms 18388 KB Output is correct
4 Correct 283 ms 18616 KB Output is correct
5 Correct 273 ms 18260 KB Output is correct
6 Correct 274 ms 17872 KB Output is correct
7 Correct 277 ms 17872 KB Output is correct
8 Correct 286 ms 17748 KB Output is correct
9 Correct 282 ms 18640 KB Output is correct
10 Correct 287 ms 18004 KB Output is correct
11 Correct 275 ms 17652 KB Output is correct
12 Correct 274 ms 17492 KB Output is correct
13 Correct 277 ms 17232 KB Output is correct
14 Correct 278 ms 18384 KB Output is correct
15 Correct 271 ms 17744 KB Output is correct
16 Correct 276 ms 18256 KB Output is correct
17 Correct 275 ms 17744 KB Output is correct
18 Correct 276 ms 17616 KB Output is correct
19 Correct 272 ms 17080 KB Output is correct
20 Correct 287 ms 18492 KB Output is correct
21 Correct 271 ms 17488 KB Output is correct
22 Correct 274 ms 15184 KB Output is correct
23 Correct 265 ms 16184 KB Output is correct
24 Correct 280 ms 16080 KB Output is correct
25 Correct 278 ms 16728 KB Output is correct
26 Correct 272 ms 16312 KB Output is correct
27 Correct 270 ms 16976 KB Output is correct
28 Correct 270 ms 17104 KB Output is correct
29 Correct 273 ms 17232 KB Output is correct
30 Correct 263 ms 16464 KB Output is correct
31 Correct 271 ms 16336 KB Output is correct
32 Correct 272 ms 15440 KB Output is correct
33 Correct 273 ms 16212 KB Output is correct
34 Correct 266 ms 16336 KB Output is correct
35 Correct 269 ms 16488 KB Output is correct
36 Correct 267 ms 15184 KB Output is correct
37 Correct 266 ms 16076 KB Output is correct
38 Correct 274 ms 16468 KB Output is correct
39 Correct 274 ms 16464 KB Output is correct
40 Correct 277 ms 15604 KB Output is correct
41 Correct 270 ms 16208 KB Output is correct
42 Execution timed out 1122 ms 16208 KB Time limit exceeded