oj.uz

Submission #316740

# Submission time Handle Problem Language Result Execution time Memory
316740 2020-10-27T18:15:59 Z AmineWeslati Cubeword (CEOI19_cubeword) C++14
100 / 100
 285 ms 9396 KB 
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
 
typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
 
const int MOD = 998244353;
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
 
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
 
#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
 
void IO() {
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}
 
int mp(char c){
	if(c>='a' && c<='z') return (c-'a');
	if(c>='A' && c<='Z') return (c-'A')+26; 
	return (c-'0') + 52;
}
 
int permu(int a, int b, int c, int d){
	if(a==b && b==c && c==d) return 1;
	if((a==b && b==c) || (a==b && b==d) || (a==c && c==d) || (b==c && c==d)) return 4;
	if((a==b && c==d) || (a==c && b==d) || (a==d && b==c)) return 6;
	if(a==b || a==c || a==d || b==c || b==d || c==d) return 12;
	return 24;
	/*vi vec; vec.pb(a); vec.pb(b); vec.pb(c); vec.pb(d);
	int cnt=0;
	do{
		cnt++;
	}
	while(next_permutation(all(vec)));
	return cnt;*/
}
 
int main() {
	boost; IO();
 
	int N; cin>>N;
	vs vec[11];
	FOR(i,0,N){
		str s; cin>>s;
		vec[sz(s)].pb(s);
		reverse(all(s));
		vec[sz(s)].pb(s);
	}
 
	FOR(x,3,11){
		sort(all(vec[x]));
		vec[x].erase(unique(all(vec[x])),vec[x].end());
	}
	
 
	ll ans=0;
	FOR(x,3,11){
		if(vec[x].empty()) continue;
 
		int cnt[62][62]; FOR(i,0,62) FOR(j,0,62) cnt[i][j]=0;
		for(auto s: vec[x]) cnt[mp(s[0])][mp(s.back())]++;
 
		ll D[62][62][62];
		FOR(i,0,62) FOR(j,i,62) FOR(k,j,62){
			D[i][j][k]=0;
			FOR(l,0,62){
				D[i][j][k]+=(((cnt[l][i]*cnt[l][j])%MOD)*cnt[l][k])%MOD;
				D[i][j][k]%=MOD;
			}
		}
		FOR(i,0,62) FOR(j,i,62) FOR(k,j,62) FOR(l,k,62){
			ll val=(((D[i][j][k]*D[i][j][l])%MOD)*((D[i][k][l]*D[j][k][l])%MOD))%MOD;
			val*=permu(i,j,k,l); val%=MOD;
			ans+=val; ans%=MOD;
		}
	}
	
	cout << ans << endl;
 
 
	return 0;
}
 
/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input
 
   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

cubeword.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
cubeword.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 9068 KB Output is correct
2 Correct 278 ms 8876 KB Output is correct
3 Correct 276 ms 9044 KB Output is correct
4 Correct 281 ms 9052 KB Output is correct
5 Correct 285 ms 9204 KB Output is correct
6 Correct 278 ms 9052 KB Output is correct
7 Correct 281 ms 8960 KB Output is correct
8 Correct 276 ms 9112 KB Output is correct
9 Correct 280 ms 8924 KB Output is correct
10 Correct 278 ms 9180 KB Output is correct
11 Correct 276 ms 8988 KB Output is correct
12 Correct 285 ms 9188 KB Output is correct
13 Correct 276 ms 9044 KB Output is correct
14 Correct 278 ms 9112 KB Output is correct
15 Correct 283 ms 8972 KB Output is correct
16 Correct 277 ms 9008 KB Output is correct
17 Correct 278 ms 9228 KB Output is correct
18 Correct 282 ms 9128 KB Output is correct
19 Correct 277 ms 8968 KB Output is correct
20 Correct 276 ms 9032 KB Output is correct
21 Correct 277 ms 8960 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 9068 KB Output is correct
2 Correct 278 ms 8876 KB Output is correct
3 Correct 276 ms 9044 KB Output is correct
4 Correct 281 ms 9052 KB Output is correct
5 Correct 285 ms 9204 KB Output is correct
6 Correct 278 ms 9052 KB Output is correct
7 Correct 281 ms 8960 KB Output is correct
8 Correct 276 ms 9112 KB Output is correct
9 Correct 280 ms 8924 KB Output is correct
10 Correct 278 ms 9180 KB Output is correct
11 Correct 276 ms 8988 KB Output is correct
12 Correct 285 ms 9188 KB Output is correct
13 Correct 276 ms 9044 KB Output is correct
14 Correct 278 ms 9112 KB Output is correct
15 Correct 283 ms 8972 KB Output is correct
16 Correct 277 ms 9008 KB Output is correct
17 Correct 278 ms 9228 KB Output is correct
18 Correct 282 ms 9128 KB Output is correct
19 Correct 277 ms 8968 KB Output is correct
20 Correct 276 ms 9032 KB Output is correct
21 Correct 277 ms 8960 KB Output is correct
22 Correct 273 ms 8880 KB Output is correct
23 Correct 271 ms 8876 KB Output is correct
24 Correct 270 ms 8884 KB Output is correct
25 Correct 275 ms 8764 KB Output is correct
26 Correct 271 ms 8812 KB Output is correct
27 Correct 269 ms 8624 KB Output is correct
28 Correct 272 ms 8908 KB Output is correct
29 Correct 274 ms 8784 KB Output is correct
30 Correct 273 ms 8748 KB Output is correct
31 Correct 272 ms 9008 KB Output is correct
32 Correct 269 ms 8788 KB Output is correct
33 Correct 269 ms 8876 KB Output is correct
34 Correct 271 ms 8976 KB Output is correct
35 Correct 269 ms 8664 KB Output is correct
36 Correct 277 ms 8988 KB Output is correct
37 Correct 272 ms 8840 KB Output is correct
38 Correct 273 ms 8868 KB Output is correct
39 Correct 270 ms 8800 KB Output is correct
40 Correct 272 ms 8884 KB Output is correct
41 Correct 274 ms 9004 KB Output is correct
42 Correct 275 ms 8852 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 9068 KB Output is correct
2 Correct 278 ms 8876 KB Output is correct
3 Correct 276 ms 9044 KB Output is correct
4 Correct 281 ms 9052 KB Output is correct
5 Correct 285 ms 9204 KB Output is correct
6 Correct 278 ms 9052 KB Output is correct
7 Correct 281 ms 8960 KB Output is correct
8 Correct 276 ms 9112 KB Output is correct
9 Correct 280 ms 8924 KB Output is correct
10 Correct 278 ms 9180 KB Output is correct
11 Correct 276 ms 8988 KB Output is correct
12 Correct 285 ms 9188 KB Output is correct
13 Correct 276 ms 9044 KB Output is correct
14 Correct 278 ms 9112 KB Output is correct
15 Correct 283 ms 8972 KB Output is correct
16 Correct 277 ms 9008 KB Output is correct
17 Correct 278 ms 9228 KB Output is correct
18 Correct 282 ms 9128 KB Output is correct
19 Correct 277 ms 8968 KB Output is correct
20 Correct 276 ms 9032 KB Output is correct
21 Correct 277 ms 8960 KB Output is correct
22 Correct 273 ms 8880 KB Output is correct
23 Correct 271 ms 8876 KB Output is correct
24 Correct 270 ms 8884 KB Output is correct
25 Correct 275 ms 8764 KB Output is correct
26 Correct 271 ms 8812 KB Output is correct
27 Correct 269 ms 8624 KB Output is correct
28 Correct 272 ms 8908 KB Output is correct
29 Correct 274 ms 8784 KB Output is correct
30 Correct 273 ms 8748 KB Output is correct
31 Correct 272 ms 9008 KB Output is correct
32 Correct 269 ms 8788 KB Output is correct
33 Correct 269 ms 8876 KB Output is correct
34 Correct 271 ms 8976 KB Output is correct
35 Correct 269 ms 8664 KB Output is correct
36 Correct 277 ms 8988 KB Output is correct
37 Correct 272 ms 8840 KB Output is correct
38 Correct 273 ms 8868 KB Output is correct
39 Correct 270 ms 8800 KB Output is correct
40 Correct 272 ms 8884 KB Output is correct
41 Correct 274 ms 9004 KB Output is correct
42 Correct 275 ms 8852 KB Output is correct
43 Correct 271 ms 9396 KB Output is correct
44 Correct 271 ms 9000 KB Output is correct
45 Correct 270 ms 8928 KB Output is correct
46 Correct 270 ms 9204 KB Output is correct
47 Correct 278 ms 8904 KB Output is correct
48 Correct 272 ms 9272 KB Output is correct
49 Correct 270 ms 8612 KB Output is correct
50 Correct 270 ms 8664 KB Output is correct
51 Correct 270 ms 8608 KB Output is correct
52 Correct 270 ms 8616 KB Output is correct
53 Correct 273 ms 8908 KB Output is correct
54 Correct 272 ms 8788 KB Output is correct
55 Correct 277 ms 8880 KB Output is correct
56 Correct 269 ms 8972 KB Output is correct
57 Correct 273 ms 8880 KB Output is correct
58 Correct 273 ms 8724 KB Output is correct
59 Correct 275 ms 8924 KB Output is correct
60 Correct 277 ms 8876 KB Output is correct
61 Correct 271 ms 8880 KB Output is correct
62 Correct 269 ms 8820 KB Output is correct
63 Correct 269 ms 8888 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 9068 KB Output is correct
2 Correct 278 ms 8876 KB Output is correct
3 Correct 276 ms 9044 KB Output is correct
4 Correct 281 ms 9052 KB Output is correct
5 Correct 285 ms 9204 KB Output is correct
6 Correct 278 ms 9052 KB Output is correct
7 Correct 281 ms 8960 KB Output is correct
8 Correct 276 ms 9112 KB Output is correct
9 Correct 280 ms 8924 KB Output is correct
10 Correct 278 ms 9180 KB Output is correct
11 Correct 276 ms 8988 KB Output is correct
12 Correct 285 ms 9188 KB Output is correct
13 Correct 276 ms 9044 KB Output is correct
14 Correct 278 ms 9112 KB Output is correct
15 Correct 283 ms 8972 KB Output is correct
16 Correct 277 ms 9008 KB Output is correct
17 Correct 278 ms 9228 KB Output is correct
18 Correct 282 ms 9128 KB Output is correct
19 Correct 277 ms 8968 KB Output is correct
20 Correct 276 ms 9032 KB Output is correct
21 Correct 277 ms 8960 KB Output is correct
22 Correct 273 ms 8880 KB Output is correct
23 Correct 271 ms 8876 KB Output is correct
24 Correct 270 ms 8884 KB Output is correct
25 Correct 275 ms 8764 KB Output is correct
26 Correct 271 ms 8812 KB Output is correct
27 Correct 269 ms 8624 KB Output is correct
28 Correct 272 ms 8908 KB Output is correct
29 Correct 274 ms 8784 KB Output is correct
30 Correct 273 ms 8748 KB Output is correct
31 Correct 272 ms 9008 KB Output is correct
32 Correct 269 ms 8788 KB Output is correct
33 Correct 269 ms 8876 KB Output is correct
34 Correct 271 ms 8976 KB Output is correct
35 Correct 269 ms 8664 KB Output is correct
36 Correct 277 ms 8988 KB Output is correct
37 Correct 272 ms 8840 KB Output is correct
38 Correct 273 ms 8868 KB Output is correct
39 Correct 270 ms 8800 KB Output is correct
40 Correct 272 ms 8884 KB Output is correct
41 Correct 274 ms 9004 KB Output is correct
42 Correct 275 ms 8852 KB Output is correct
43 Correct 271 ms 9396 KB Output is correct
44 Correct 271 ms 9000 KB Output is correct
45 Correct 270 ms 8928 KB Output is correct
46 Correct 270 ms 9204 KB Output is correct
47 Correct 278 ms 8904 KB Output is correct
48 Correct 272 ms 9272 KB Output is correct
49 Correct 270 ms 8612 KB Output is correct
50 Correct 270 ms 8664 KB Output is correct
51 Correct 270 ms 8608 KB Output is correct
52 Correct 270 ms 8616 KB Output is correct
53 Correct 273 ms 8908 KB Output is correct
54 Correct 272 ms 8788 KB Output is correct
55 Correct 277 ms 8880 KB Output is correct
56 Correct 269 ms 8972 KB Output is correct
57 Correct 273 ms 8880 KB Output is correct
58 Correct 273 ms 8724 KB Output is correct
59 Correct 275 ms 8924 KB Output is correct
60 Correct 277 ms 8876 KB Output is correct
61 Correct 271 ms 8880 KB Output is correct
62 Correct 269 ms 8820 KB Output is correct
63 Correct 269 ms 8888 KB Output is correct
64 Correct 270 ms 8876 KB Output is correct
65 Correct 271 ms 9036 KB Output is correct
66 Correct 270 ms 8656 KB Output is correct
67 Correct 270 ms 9132 KB Output is correct
68 Correct 270 ms 8760 KB Output is correct
69 Correct 269 ms 8756 KB Output is correct
70 Correct 272 ms 8876 KB Output is correct
71 Correct 270 ms 8612 KB Output is correct
72 Correct 272 ms 8884 KB Output is correct
73 Correct 270 ms 8648 KB Output is correct
74 Correct 269 ms 8908 KB Output is correct
75 Correct 271 ms 9012 KB Output is correct
76 Correct 271 ms 8648 KB Output is correct
77 Correct 271 ms 9064 KB Output is correct
78 Correct 270 ms 8720 KB Output is correct
79 Correct 269 ms 9012 KB Output is correct
80 Correct 272 ms 8604 KB Output is correct
81 Correct 272 ms 8608 KB Output is correct
82 Correct 269 ms 9012 KB Output is correct
83 Correct 268 ms 8608 KB Output is correct
84 Correct 268 ms 8792 KB Output is correct