oj.uz

답안 #309731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309731 2020-10-04T12:01:24 Z AmineWeslati Cubeword (CEOI19_cubeword) C++14
21 / 100
 734 ms 32148 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;
#define int 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; //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
}


int32_t main() {
	boost; 

	int N; cin>>N;
	vs vec;
	map <str,bool> vis;
	FOR(i,0,N){
		str s; cin>>s;
		if(!vis.count(s)){vec.pb(s); vis[s]=true;}
		reverse(all(s));
		if(!vis.count(s)){vec.pb(s); vis[s]=true;}
	}


	int cnt[11][6][6]; FOR(i,0,11) FOR(j,0,6) FOR(k,0,6) cnt[i][j][k]=0;
	FOR(i,0,sz(vec)){
		str s=vec[i];
		cnt[sz(s)][s[0]-'a'][s.back()-'a']++;
	}

	int ans=0;

	FOR(n,3,11)
	FOR(a,0,6)
	FOR(b,0,6)
	FOR(c,0,6)
	FOR(d,0,6)
	FOR(e,0,6)
	FOR(f,0,6)
	FOR(g,0,6)
	FOR(h,0,6){
		int x=1;
		x*=cnt[n][a][b]; x%=MOD;
		x*=cnt[n][c][d]; x%=MOD;
		x*=cnt[n][e][f]; x%=MOD;
		x*=cnt[n][g][h]; x%=MOD;
		x*=cnt[n][a][c]; x%=MOD;
		x*=cnt[n][b][d]; x%=MOD;
		x*=cnt[n][c][e]; x%=MOD;
		x*=cnt[n][d][f]; x%=MOD;
		x*=cnt[n][e][g]; x%=MOD;
		x*=cnt[n][f][h]; x%=MOD;
		x*=cnt[n][g][a]; x%=MOD;
		x*=cnt[n][h][b]; x%=MOD;

		ans+=x; ans%=MOD;
	}



	cout << ans << endl;

	return 0;
}
/*
2
bafbab
bfb

4097
*/

/* 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:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
cubeword.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   51 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 20816 KB Output is correct
2 Correct 710 ms 21588 KB Output is correct
3 Correct 723 ms 21724 KB Output is correct
4 Correct 722 ms 21744 KB Output is correct
5 Correct 717 ms 21592 KB Output is correct
6 Correct 717 ms 21456 KB Output is correct
7 Correct 713 ms 21460 KB Output is correct
8 Correct 724 ms 21484 KB Output is correct
9 Correct 719 ms 21456 KB Output is correct
10 Correct 721 ms 21460 KB Output is correct
11 Correct 721 ms 21456 KB Output is correct
12 Correct 730 ms 21456 KB Output is correct
13 Correct 724 ms 21480 KB Output is correct
14 Correct 711 ms 21456 KB Output is correct
15 Correct 711 ms 21460 KB Output is correct
16 Correct 715 ms 21584 KB Output is correct
17 Correct 720 ms 21456 KB Output is correct
18 Correct 724 ms 21456 KB Output is correct
19 Correct 725 ms 21456 KB Output is correct
20 Correct 723 ms 21456 KB Output is correct
21 Correct 717 ms 21584 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 20816 KB Output is correct
2 Correct 710 ms 21588 KB Output is correct
3 Correct 723 ms 21724 KB Output is correct
4 Correct 722 ms 21744 KB Output is correct
5 Correct 717 ms 21592 KB Output is correct
6 Correct 717 ms 21456 KB Output is correct
7 Correct 713 ms 21460 KB Output is correct
8 Correct 724 ms 21484 KB Output is correct
9 Correct 719 ms 21456 KB Output is correct
10 Correct 721 ms 21460 KB Output is correct
11 Correct 721 ms 21456 KB Output is correct
12 Correct 730 ms 21456 KB Output is correct
13 Correct 724 ms 21480 KB Output is correct
14 Correct 711 ms 21456 KB Output is correct
15 Correct 711 ms 21460 KB Output is correct
16 Correct 715 ms 21584 KB Output is correct
17 Correct 720 ms 21456 KB Output is correct
18 Correct 724 ms 21456 KB Output is correct
19 Correct 725 ms 21456 KB Output is correct
20 Correct 723 ms 21456 KB Output is correct
21 Correct 717 ms 21584 KB Output is correct
22 Runtime error 734 ms 32148 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 20816 KB Output is correct
2 Correct 710 ms 21588 KB Output is correct
3 Correct 723 ms 21724 KB Output is correct
4 Correct 722 ms 21744 KB Output is correct
5 Correct 717 ms 21592 KB Output is correct
6 Correct 717 ms 21456 KB Output is correct
7 Correct 713 ms 21460 KB Output is correct
8 Correct 724 ms 21484 KB Output is correct
9 Correct 719 ms 21456 KB Output is correct
10 Correct 721 ms 21460 KB Output is correct
11 Correct 721 ms 21456 KB Output is correct
12 Correct 730 ms 21456 KB Output is correct
13 Correct 724 ms 21480 KB Output is correct
14 Correct 711 ms 21456 KB Output is correct
15 Correct 711 ms 21460 KB Output is correct
16 Correct 715 ms 21584 KB Output is correct
17 Correct 720 ms 21456 KB Output is correct
18 Correct 724 ms 21456 KB Output is correct
19 Correct 725 ms 21456 KB Output is correct
20 Correct 723 ms 21456 KB Output is correct
21 Correct 717 ms 21584 KB Output is correct
22 Runtime error 734 ms 32148 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 709 ms 20816 KB Output is correct
2 Correct 710 ms 21588 KB Output is correct
3 Correct 723 ms 21724 KB Output is correct
4 Correct 722 ms 21744 KB Output is correct
5 Correct 717 ms 21592 KB Output is correct
6 Correct 717 ms 21456 KB Output is correct
7 Correct 713 ms 21460 KB Output is correct
8 Correct 724 ms 21484 KB Output is correct
9 Correct 719 ms 21456 KB Output is correct
10 Correct 721 ms 21460 KB Output is correct
11 Correct 721 ms 21456 KB Output is correct
12 Correct 730 ms 21456 KB Output is correct
13 Correct 724 ms 21480 KB Output is correct
14 Correct 711 ms 21456 KB Output is correct
15 Correct 711 ms 21460 KB Output is correct
16 Correct 715 ms 21584 KB Output is correct
17 Correct 720 ms 21456 KB Output is correct
18 Correct 724 ms 21456 KB Output is correct
19 Correct 725 ms 21456 KB Output is correct
20 Correct 723 ms 21456 KB Output is correct
21 Correct 717 ms 21584 KB Output is correct
22 Runtime error 734 ms 32148 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -