oj.uz

Submission #315769

# Submission time Handle Problem Language Result Execution time Memory
315769 2020-10-23T22:13:41 Z AmineWeslati Cubeword (CEOI19_cubeword) C++14
84 / 100
 890 ms 9264 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() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

int mp(char c){
	if(c>='a' && c<='z') return (c-'a');
	return (c-'A')+26; 
}

int main() {
	boost; 

	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){

		ll cnt[52][52]; FOR(i,0,52) FOR(j,0,52) cnt[i][j]=0;
		for(auto s: vec[x]) cnt[mp(s[0])][mp(s.back())]++;

		ll D[52][52][52];
		FOR(i,0,52) FOR(j,0,52) FOR(k,0,52){
			D[i][j][k]=0;
			FOR(l,0,52){
				D[i][j][k]+=(((cnt[l][i]*cnt[l][j])%MOD)*cnt[l][k])%MOD;
				D[i][j][k]%=MOD;
			}
		}
		FOR(i,0,52) FOR(j,0,52) FOR(k,0,52) FOR(l,0,52){
			ans+=(((D[i][j][k]*D[i][j][l])%MOD)*((D[i][k][l]*D[j][k][l])%MOD))%MOD;
			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")
      | 
cubeword.cpp: In function 'void IO()':
cubeword.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cubeword.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 8304 KB Output is correct
2 Correct 873 ms 9008 KB Output is correct
3 Correct 878 ms 9080 KB Output is correct
4 Correct 877 ms 9052 KB Output is correct
5 Correct 870 ms 9156 KB Output is correct
6 Correct 880 ms 9056 KB Output is correct
7 Correct 875 ms 9088 KB Output is correct
8 Correct 878 ms 9164 KB Output is correct
9 Correct 878 ms 8928 KB Output is correct
10 Correct 877 ms 9092 KB Output is correct
11 Correct 890 ms 9164 KB Output is correct
12 Correct 876 ms 9100 KB Output is correct
13 Correct 874 ms 9040 KB Output is correct
14 Correct 875 ms 9108 KB Output is correct
15 Correct 873 ms 8972 KB Output is correct
16 Correct 874 ms 9088 KB Output is correct
17 Correct 876 ms 9100 KB Output is correct
18 Correct 873 ms 9128 KB Output is correct
19 Correct 877 ms 9128 KB Output is correct
20 Correct 884 ms 8904 KB Output is correct
21 Correct 871 ms 9088 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 8304 KB Output is correct
2 Correct 873 ms 9008 KB Output is correct
3 Correct 878 ms 9080 KB Output is correct
4 Correct 877 ms 9052 KB Output is correct
5 Correct 870 ms 9156 KB Output is correct
6 Correct 880 ms 9056 KB Output is correct
7 Correct 875 ms 9088 KB Output is correct
8 Correct 878 ms 9164 KB Output is correct
9 Correct 878 ms 8928 KB Output is correct
10 Correct 877 ms 9092 KB Output is correct
11 Correct 890 ms 9164 KB Output is correct
12 Correct 876 ms 9100 KB Output is correct
13 Correct 874 ms 9040 KB Output is correct
14 Correct 875 ms 9108 KB Output is correct
15 Correct 873 ms 8972 KB Output is correct
16 Correct 874 ms 9088 KB Output is correct
17 Correct 876 ms 9100 KB Output is correct
18 Correct 873 ms 9128 KB Output is correct
19 Correct 877 ms 9128 KB Output is correct
20 Correct 884 ms 8904 KB Output is correct
21 Correct 871 ms 9088 KB Output is correct
22 Correct 875 ms 8712 KB Output is correct
23 Correct 869 ms 8748 KB Output is correct
24 Correct 873 ms 8884 KB Output is correct
25 Correct 867 ms 8792 KB Output is correct
26 Correct 870 ms 8820 KB Output is correct
27 Correct 862 ms 8752 KB Output is correct
28 Correct 865 ms 8656 KB Output is correct
29 Correct 870 ms 8916 KB Output is correct
30 Correct 868 ms 8768 KB Output is correct
31 Correct 872 ms 9008 KB Output is correct
32 Correct 873 ms 8772 KB Output is correct
33 Correct 869 ms 9008 KB Output is correct
34 Correct 864 ms 8720 KB Output is correct
35 Correct 874 ms 8784 KB Output is correct
36 Correct 871 ms 8868 KB Output is correct
37 Correct 869 ms 8824 KB Output is correct
38 Correct 868 ms 8740 KB Output is correct
39 Correct 869 ms 8852 KB Output is correct
40 Correct 873 ms 8880 KB Output is correct
41 Correct 868 ms 8956 KB Output is correct
42 Correct 866 ms 8864 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 8304 KB Output is correct
2 Correct 873 ms 9008 KB Output is correct
3 Correct 878 ms 9080 KB Output is correct
4 Correct 877 ms 9052 KB Output is correct
5 Correct 870 ms 9156 KB Output is correct
6 Correct 880 ms 9056 KB Output is correct
7 Correct 875 ms 9088 KB Output is correct
8 Correct 878 ms 9164 KB Output is correct
9 Correct 878 ms 8928 KB Output is correct
10 Correct 877 ms 9092 KB Output is correct
11 Correct 890 ms 9164 KB Output is correct
12 Correct 876 ms 9100 KB Output is correct
13 Correct 874 ms 9040 KB Output is correct
14 Correct 875 ms 9108 KB Output is correct
15 Correct 873 ms 8972 KB Output is correct
16 Correct 874 ms 9088 KB Output is correct
17 Correct 876 ms 9100 KB Output is correct
18 Correct 873 ms 9128 KB Output is correct
19 Correct 877 ms 9128 KB Output is correct
20 Correct 884 ms 8904 KB Output is correct
21 Correct 871 ms 9088 KB Output is correct
22 Correct 875 ms 8712 KB Output is correct
23 Correct 869 ms 8748 KB Output is correct
24 Correct 873 ms 8884 KB Output is correct
25 Correct 867 ms 8792 KB Output is correct
26 Correct 870 ms 8820 KB Output is correct
27 Correct 862 ms 8752 KB Output is correct
28 Correct 865 ms 8656 KB Output is correct
29 Correct 870 ms 8916 KB Output is correct
30 Correct 868 ms 8768 KB Output is correct
31 Correct 872 ms 9008 KB Output is correct
32 Correct 873 ms 8772 KB Output is correct
33 Correct 869 ms 9008 KB Output is correct
34 Correct 864 ms 8720 KB Output is correct
35 Correct 874 ms 8784 KB Output is correct
36 Correct 871 ms 8868 KB Output is correct
37 Correct 869 ms 8824 KB Output is correct
38 Correct 868 ms 8740 KB Output is correct
39 Correct 869 ms 8852 KB Output is correct
40 Correct 873 ms 8880 KB Output is correct
41 Correct 868 ms 8956 KB Output is correct
42 Correct 866 ms 8864 KB Output is correct
43 Correct 863 ms 9264 KB Output is correct
44 Correct 863 ms 8872 KB Output is correct
45 Correct 863 ms 8804 KB Output is correct
46 Correct 873 ms 9192 KB Output is correct
47 Correct 878 ms 8948 KB Output is correct
48 Correct 872 ms 9076 KB Output is correct
49 Correct 863 ms 8728 KB Output is correct
50 Correct 866 ms 8752 KB Output is correct
51 Correct 869 ms 8616 KB Output is correct
52 Correct 867 ms 8740 KB Output is correct
53 Correct 869 ms 8788 KB Output is correct
54 Correct 869 ms 8800 KB Output is correct
55 Correct 873 ms 8880 KB Output is correct
56 Correct 868 ms 8864 KB Output is correct
57 Correct 862 ms 8948 KB Output is correct
58 Correct 865 ms 8644 KB Output is correct
59 Correct 874 ms 8804 KB Output is correct
60 Correct 877 ms 8996 KB Output is correct
61 Correct 876 ms 9084 KB Output is correct
62 Correct 864 ms 8676 KB Output is correct
63 Correct 865 ms 8884 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 8304 KB Output is correct
2 Correct 873 ms 9008 KB Output is correct
3 Correct 878 ms 9080 KB Output is correct
4 Correct 877 ms 9052 KB Output is correct
5 Correct 870 ms 9156 KB Output is correct
6 Correct 880 ms 9056 KB Output is correct
7 Correct 875 ms 9088 KB Output is correct
8 Correct 878 ms 9164 KB Output is correct
9 Correct 878 ms 8928 KB Output is correct
10 Correct 877 ms 9092 KB Output is correct
11 Correct 890 ms 9164 KB Output is correct
12 Correct 876 ms 9100 KB Output is correct
13 Correct 874 ms 9040 KB Output is correct
14 Correct 875 ms 9108 KB Output is correct
15 Correct 873 ms 8972 KB Output is correct
16 Correct 874 ms 9088 KB Output is correct
17 Correct 876 ms 9100 KB Output is correct
18 Correct 873 ms 9128 KB Output is correct
19 Correct 877 ms 9128 KB Output is correct
20 Correct 884 ms 8904 KB Output is correct
21 Correct 871 ms 9088 KB Output is correct
22 Correct 875 ms 8712 KB Output is correct
23 Correct 869 ms 8748 KB Output is correct
24 Correct 873 ms 8884 KB Output is correct
25 Correct 867 ms 8792 KB Output is correct
26 Correct 870 ms 8820 KB Output is correct
27 Correct 862 ms 8752 KB Output is correct
28 Correct 865 ms 8656 KB Output is correct
29 Correct 870 ms 8916 KB Output is correct
30 Correct 868 ms 8768 KB Output is correct
31 Correct 872 ms 9008 KB Output is correct
32 Correct 873 ms 8772 KB Output is correct
33 Correct 869 ms 9008 KB Output is correct
34 Correct 864 ms 8720 KB Output is correct
35 Correct 874 ms 8784 KB Output is correct
36 Correct 871 ms 8868 KB Output is correct
37 Correct 869 ms 8824 KB Output is correct
38 Correct 868 ms 8740 KB Output is correct
39 Correct 869 ms 8852 KB Output is correct
40 Correct 873 ms 8880 KB Output is correct
41 Correct 868 ms 8956 KB Output is correct
42 Correct 866 ms 8864 KB Output is correct
43 Correct 863 ms 9264 KB Output is correct
44 Correct 863 ms 8872 KB Output is correct
45 Correct 863 ms 8804 KB Output is correct
46 Correct 873 ms 9192 KB Output is correct
47 Correct 878 ms 8948 KB Output is correct
48 Correct 872 ms 9076 KB Output is correct
49 Correct 863 ms 8728 KB Output is correct
50 Correct 866 ms 8752 KB Output is correct
51 Correct 869 ms 8616 KB Output is correct
52 Correct 867 ms 8740 KB Output is correct
53 Correct 869 ms 8788 KB Output is correct
54 Correct 869 ms 8800 KB Output is correct
55 Correct 873 ms 8880 KB Output is correct
56 Correct 868 ms 8864 KB Output is correct
57 Correct 862 ms 8948 KB Output is correct
58 Correct 865 ms 8644 KB Output is correct
59 Correct 874 ms 8804 KB Output is correct
60 Correct 877 ms 8996 KB Output is correct
61 Correct 876 ms 9084 KB Output is correct
62 Correct 864 ms 8676 KB Output is correct
63 Correct 865 ms 8884 KB Output is correct
64 Incorrect 869 ms 8880 KB Output isn't correct
65 Halted 0 ms 0 KB -