oj.uz

Submission #446994

# Submission time Handle Problem Language Result Execution time Memory
446994 2021-07-24T07:57:15 Z fhvirus Cubeword (CEOI19_cubeword) C++17
84 / 100
 430 ms 36880 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;} 
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#pragma GCC optimize("Ofast")
#define debug(...) ((void)0)
#endif

const int kC = 42;
const int MOD = 998244353;
inline int ci(char c){ return c >= 'a' ? c - 'a' : (c >= 'A' ? c - 'A' + 26 : c - '0' + 52); }
inline void mad(int &a, int b){ a += b - MOD; a += (a>>31) & MOD; }

int adj[kC][kC];
int tri[kC][kC][kC];
int qua[kC][kC][kC][kC];
void init(){
	memset(adj, 0, sizeof(adj));
	memset(tri, 0, sizeof(tri));
	memset(qua, 0, sizeof(qua));
}

bool isPalim(string s){
	int n = s.size();
	for(int l = 0, r = n-1; l < r; ++l, --r)
		if(s[l] != s[r]) return false;
	return true;
}

int solve(vector<string> &s){
	debug(s);
	if(s.empty()) return 0;
	init();
	set<string> ss;
	for(auto i: s){
		if(ss.count(i)) continue;
		int a = ci(i.front()), b = ci(i.back());
		ss.insert(i);
		++adj[a][b];
		debug(a, b);
		if(isPalim(i)) continue;
		reverse(AI(i));
		ss.insert(i);
		++adj[b][a];
		debug(b, a);
	}

//	for(int i = 0; i < kC; ++i){
//		for(int j = 0; j < kC; ++j)
//			cout << adj[i][j] << ' ';
//		cout << '\n';
//	}

	// construct tri
	for(int i = 0; i < kC; ++i)
		for(int j = 0; j < kC; ++j)
			for(int k = 0; k < kC; ++k)
				for(int u = 0; u < kC; ++u){
					ll v = adj[i][u] * adj[j][u] * adj[k][u];
					mad(tri[i][j][k], (v % MOD));
				}

	// construct qua
	for(int i = 0; i < kC; ++i)
		for(int j = 0; j < kC; ++j)
			for(int k = 0; k < kC; ++k)
				for(int l = 0; l < kC; ++l)
					mad(qua[i][j][k][l], 1ll * tri[i][j][k] * tri[j][k][l] % MOD);

	int ans = 0;
	for(int i = 0; i < kC; ++i)
		for(int j = 0; j < kC; ++j)
			for(int k = 0; k < kC; ++k)
				for(int l = 0; l < kC; ++l)
					mad(ans, 1ll * qua[i][j][k][l] * qua[j][i][l][k] % MOD);

	debug(ans);
	return ans;
}

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n; cin >> n;
	vector<vector<string>> bkt(11);
	for(int i = 1; i <= n; ++i){
		string s; cin >> s;
		bkt[s.length()].push_back(s);
	}

	int ans = 0;
	for(int i = 3; i <= 10; ++i)
		mad(ans, solve(bkt[i]));
	cout << ans;
	return 0;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 18860 KB Output is correct
2 Correct 361 ms 18988 KB Output is correct
3 Correct 357 ms 18968 KB Output is correct
4 Correct 408 ms 18952 KB Output is correct
5 Correct 367 ms 18868 KB Output is correct
6 Correct 368 ms 19016 KB Output is correct
7 Correct 369 ms 18988 KB Output is correct
8 Correct 384 ms 18956 KB Output is correct
9 Correct 389 ms 18956 KB Output is correct
10 Correct 390 ms 18964 KB Output is correct
11 Correct 373 ms 18904 KB Output is correct
12 Correct 363 ms 18968 KB Output is correct
13 Correct 379 ms 18960 KB Output is correct
14 Correct 370 ms 19092 KB Output is correct
15 Correct 395 ms 18984 KB Output is correct
16 Correct 361 ms 18948 KB Output is correct
17 Correct 411 ms 19024 KB Output is correct
18 Correct 369 ms 18948 KB Output is correct
19 Correct 367 ms 19040 KB Output is correct
20 Correct 396 ms 18968 KB Output is correct
21 Correct 404 ms 18944 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 18860 KB Output is correct
2 Correct 361 ms 18988 KB Output is correct
3 Correct 357 ms 18968 KB Output is correct
4 Correct 408 ms 18952 KB Output is correct
5 Correct 367 ms 18868 KB Output is correct
6 Correct 368 ms 19016 KB Output is correct
7 Correct 369 ms 18988 KB Output is correct
8 Correct 384 ms 18956 KB Output is correct
9 Correct 389 ms 18956 KB Output is correct
10 Correct 390 ms 18964 KB Output is correct
11 Correct 373 ms 18904 KB Output is correct
12 Correct 363 ms 18968 KB Output is correct
13 Correct 379 ms 18960 KB Output is correct
14 Correct 370 ms 19092 KB Output is correct
15 Correct 395 ms 18984 KB Output is correct
16 Correct 361 ms 18948 KB Output is correct
17 Correct 411 ms 19024 KB Output is correct
18 Correct 369 ms 18948 KB Output is correct
19 Correct 367 ms 19040 KB Output is correct
20 Correct 396 ms 18968 KB Output is correct
21 Correct 404 ms 18944 KB Output is correct
22 Correct 359 ms 18248 KB Output is correct
23 Correct 368 ms 18200 KB Output is correct
24 Correct 367 ms 18252 KB Output is correct
25 Correct 401 ms 18140 KB Output is correct
26 Correct 372 ms 18072 KB Output is correct
27 Correct 359 ms 18188 KB Output is correct
28 Correct 360 ms 18148 KB Output is correct
29 Correct 362 ms 18236 KB Output is correct
30 Correct 376 ms 18148 KB Output is correct
31 Correct 366 ms 18140 KB Output is correct
32 Correct 365 ms 18096 KB Output is correct
33 Correct 360 ms 18120 KB Output is correct
34 Correct 357 ms 18064 KB Output is correct
35 Correct 358 ms 18248 KB Output is correct
36 Correct 358 ms 18140 KB Output is correct
37 Correct 361 ms 18072 KB Output is correct
38 Correct 363 ms 18268 KB Output is correct
39 Correct 366 ms 18124 KB Output is correct
40 Correct 362 ms 18184 KB Output is correct
41 Correct 366 ms 18100 KB Output is correct
42 Correct 359 ms 18136 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 18860 KB Output is correct
2 Correct 361 ms 18988 KB Output is correct
3 Correct 357 ms 18968 KB Output is correct
4 Correct 408 ms 18952 KB Output is correct
5 Correct 367 ms 18868 KB Output is correct
6 Correct 368 ms 19016 KB Output is correct
7 Correct 369 ms 18988 KB Output is correct
8 Correct 384 ms 18956 KB Output is correct
9 Correct 389 ms 18956 KB Output is correct
10 Correct 390 ms 18964 KB Output is correct
11 Correct 373 ms 18904 KB Output is correct
12 Correct 363 ms 18968 KB Output is correct
13 Correct 379 ms 18960 KB Output is correct
14 Correct 370 ms 19092 KB Output is correct
15 Correct 395 ms 18984 KB Output is correct
16 Correct 361 ms 18948 KB Output is correct
17 Correct 411 ms 19024 KB Output is correct
18 Correct 369 ms 18948 KB Output is correct
19 Correct 367 ms 19040 KB Output is correct
20 Correct 396 ms 18968 KB Output is correct
21 Correct 404 ms 18944 KB Output is correct
22 Correct 359 ms 18248 KB Output is correct
23 Correct 368 ms 18200 KB Output is correct
24 Correct 367 ms 18252 KB Output is correct
25 Correct 401 ms 18140 KB Output is correct
26 Correct 372 ms 18072 KB Output is correct
27 Correct 359 ms 18188 KB Output is correct
28 Correct 360 ms 18148 KB Output is correct
29 Correct 362 ms 18236 KB Output is correct
30 Correct 376 ms 18148 KB Output is correct
31 Correct 366 ms 18140 KB Output is correct
32 Correct 365 ms 18096 KB Output is correct
33 Correct 360 ms 18120 KB Output is correct
34 Correct 357 ms 18064 KB Output is correct
35 Correct 358 ms 18248 KB Output is correct
36 Correct 358 ms 18140 KB Output is correct
37 Correct 361 ms 18072 KB Output is correct
38 Correct 363 ms 18268 KB Output is correct
39 Correct 366 ms 18124 KB Output is correct
40 Correct 362 ms 18184 KB Output is correct
41 Correct 366 ms 18100 KB Output is correct
42 Correct 359 ms 18136 KB Output is correct
43 Correct 373 ms 18064 KB Output is correct
44 Correct 359 ms 18892 KB Output is correct
45 Correct 357 ms 18712 KB Output is correct
46 Correct 368 ms 18820 KB Output is correct
47 Correct 360 ms 18704 KB Output is correct
48 Correct 364 ms 18752 KB Output is correct
49 Correct 356 ms 18804 KB Output is correct
50 Correct 367 ms 18788 KB Output is correct
51 Correct 361 ms 18768 KB Output is correct
52 Correct 390 ms 18908 KB Output is correct
53 Correct 361 ms 18824 KB Output is correct
54 Correct 364 ms 18824 KB Output is correct
55 Correct 365 ms 18712 KB Output is correct
56 Correct 371 ms 18884 KB Output is correct
57 Correct 430 ms 18708 KB Output is correct
58 Correct 365 ms 18696 KB Output is correct
59 Correct 359 ms 18700 KB Output is correct
60 Correct 366 ms 18700 KB Output is correct
61 Correct 363 ms 18728 KB Output is correct
62 Correct 365 ms 18692 KB Output is correct
63 Correct 371 ms 18604 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 371 ms 18860 KB Output is correct
2 Correct 361 ms 18988 KB Output is correct
3 Correct 357 ms 18968 KB Output is correct
4 Correct 408 ms 18952 KB Output is correct
5 Correct 367 ms 18868 KB Output is correct
6 Correct 368 ms 19016 KB Output is correct
7 Correct 369 ms 18988 KB Output is correct
8 Correct 384 ms 18956 KB Output is correct
9 Correct 389 ms 18956 KB Output is correct
10 Correct 390 ms 18964 KB Output is correct
11 Correct 373 ms 18904 KB Output is correct
12 Correct 363 ms 18968 KB Output is correct
13 Correct 379 ms 18960 KB Output is correct
14 Correct 370 ms 19092 KB Output is correct
15 Correct 395 ms 18984 KB Output is correct
16 Correct 361 ms 18948 KB Output is correct
17 Correct 411 ms 19024 KB Output is correct
18 Correct 369 ms 18948 KB Output is correct
19 Correct 367 ms 19040 KB Output is correct
20 Correct 396 ms 18968 KB Output is correct
21 Correct 404 ms 18944 KB Output is correct
22 Correct 359 ms 18248 KB Output is correct
23 Correct 368 ms 18200 KB Output is correct
24 Correct 367 ms 18252 KB Output is correct
25 Correct 401 ms 18140 KB Output is correct
26 Correct 372 ms 18072 KB Output is correct
27 Correct 359 ms 18188 KB Output is correct
28 Correct 360 ms 18148 KB Output is correct
29 Correct 362 ms 18236 KB Output is correct
30 Correct 376 ms 18148 KB Output is correct
31 Correct 366 ms 18140 KB Output is correct
32 Correct 365 ms 18096 KB Output is correct
33 Correct 360 ms 18120 KB Output is correct
34 Correct 357 ms 18064 KB Output is correct
35 Correct 358 ms 18248 KB Output is correct
36 Correct 358 ms 18140 KB Output is correct
37 Correct 361 ms 18072 KB Output is correct
38 Correct 363 ms 18268 KB Output is correct
39 Correct 366 ms 18124 KB Output is correct
40 Correct 362 ms 18184 KB Output is correct
41 Correct 366 ms 18100 KB Output is correct
42 Correct 359 ms 18136 KB Output is correct
43 Correct 373 ms 18064 KB Output is correct
44 Correct 359 ms 18892 KB Output is correct
45 Correct 357 ms 18712 KB Output is correct
46 Correct 368 ms 18820 KB Output is correct
47 Correct 360 ms 18704 KB Output is correct
48 Correct 364 ms 18752 KB Output is correct
49 Correct 356 ms 18804 KB Output is correct
50 Correct 367 ms 18788 KB Output is correct
51 Correct 361 ms 18768 KB Output is correct
52 Correct 390 ms 18908 KB Output is correct
53 Correct 361 ms 18824 KB Output is correct
54 Correct 364 ms 18824 KB Output is correct
55 Correct 365 ms 18712 KB Output is correct
56 Correct 371 ms 18884 KB Output is correct
57 Correct 430 ms 18708 KB Output is correct
58 Correct 365 ms 18696 KB Output is correct
59 Correct 359 ms 18700 KB Output is correct
60 Correct 366 ms 18700 KB Output is correct
61 Correct 363 ms 18728 KB Output is correct
62 Correct 365 ms 18692 KB Output is correct
63 Correct 371 ms 18604 KB Output is correct
64 Runtime error 382 ms 36880 KB Execution killed with signal 11
65 Halted 0 ms 0 KB -