oj.uz

Submission #1038348

# Submission time Handle Problem Language Result Execution time Memory
1038348 2024-07-29T17:16:32 Z vjudge1 Cubeword (CEOI19_cubeword) C++17
50 / 100
 1100 ms 312316 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,isudgh=b;i<isudgh;i++)
#define SZ(x) ((int)(x).size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto jhglkdfjg:v)cout<<jhglkdfjg<<" ";cout<<"\n";}
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MOD=998244353,MAXA=62;

ll add(ll a, ll b){a+=b;if(a>=MOD)a-=MOD;return a;}
ll sub(ll a, ll b){a-=b;if(a<0)a+=MOD;return a;}
ll mul(ll a, ll b){return a*b%MOD;}

ll A; //alphabet
vector<vector<ll>> q,g={
	{},
	{0},
	{0},
	{0},
	{1,2},
	{1,3},
	{2,3},
	{4,5,6}
};
vector<ll>bor={0,0,0,1,0,1,2,4},tam={1,2,3,3,4,4,3,0};
vector<ll>pot(6);

vector<ll>dp[8];

ll get(ll i, ll j, ll h){
	ll p=i-1-j;
	ll ret=h/pot[p]%A;
	// cout<<"get "<<i<<" "<<j<<" "<<h<<": "<<p<<": "<<ret<<"\n";
	return ret;
}
ll go(ll i, ll h, ll c){
	return (h*A+c)%pot[tam[i]];
}
vector<ii>vis;
ll f(ll i, ll h){
	if(i==8)return 1;
	ll &res=dp[i][h];
	if(res!=-1)return res;
	res=0;
	vis.pb({i,h});
	fore(c,0,A){// pongo c
		ll resi=1;
		for(auto j:g[i]){
			ll d=get(i,j,h);
			resi=mul(resi,q[c][d]);
		}
		// cout<<i<<""
		if(resi)res=add(res,mul(resi,f(i+1,go(i,h,c))));
	}
	// cout<<i<<" "<<h<<": "<<res<<"\n";
	return res;
}
ll solve(vector<string>&a){
	// cout<<"solve "; imp(a);
	ll n=SZ(a);
	vector<char>c;
	fore(i,0,n)for(auto j:a[i])c.pb(j);
	sort(ALL(c));
	vector<char> ci;
	fore(i,0,SZ(c))if(!i||c[i]!=c[i-1])ci.pb(c[i]);
	c=ci;
	fore(i,0,n){
		for(auto &j:a[i]){
			ll p=lower_bound(ALL(c),j)-c.begin();
			j=p;
		}
	}
	// imp(a);
	A=SZ(c);
	q=vector<vector<ll>>(A,vector<ll>(A));
	set<string> st[A][A];
	for(auto s:a){
		st[s[0]][s.back()].insert(s);
		reverse(ALL(s));
		st[s[0]][s.back()].insert(s);
	}
	fore(i,0,A)fore(j,0,A)q[i][j]=SZ(st[i][j]);
	/*fore(i,0,A){
		imp(q[i]);
	}*/
	pot[0]=1;
	fore(i,1,6)pot[i]=pot[i-1]*A;
	ll res=f(0,0);
	for(auto [i,j]:vis)dp[i][j]=-1;
	vis.clear();
	return res;
}
const ll MAXV=1e5+5;
int main(){FIN;
	ll n; cin>>n;
	vector<string> b[MAXV];
	fore(i,0,n){
		string s;cin>>s;
		b[SZ(s)].pb(s);
	}
	vector<ll>POT={1};
	fore(i,0,5)POT.pb(POT.back()*MAXA);
	fore(i,0,8){
		dp[i]=vector<ll>(POT[(i?tam[i-1]:0)],-1);
		// cout<<i<<": "<<SZ(dp[i])<<"\n";
	}
	// imp(POT); cout<<endl;
	ll res=0;
	fore(i,0,MAXV){
		res=add(res,solve(b[i]));
	}
	// res=solve(b[5]);
	cout<<res<<"\n";
	return 0;
}

Compilation message

cubeword.cpp: In function 'll solve(std::vector<std::__cxx11::basic_string<char> >&)':
cubeword.cpp:84:10: warning: array subscript has type 'char' [-Wchar-subscripts]
   84 |   st[s[0]][s.back()].insert(s);
      |          ^
cubeword.cpp:84:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   84 |   st[s[0]][s.back()].insert(s);
      |            ~~~~~~^~
cubeword.cpp:86:10: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |   st[s[0]][s.back()].insert(s);
      |          ^
cubeword.cpp:86:18: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |   st[s[0]][s.back()].insert(s);
      |            ~~~~~~^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 246304 KB Output is correct
2 Correct 107 ms 247008 KB Output is correct
3 Correct 106 ms 246972 KB Output is correct
4 Correct 107 ms 247076 KB Output is correct
5 Correct 107 ms 246824 KB Output is correct
6 Correct 108 ms 246772 KB Output is correct
7 Correct 110 ms 246832 KB Output is correct
8 Correct 110 ms 246956 KB Output is correct
9 Correct 107 ms 246864 KB Output is correct
10 Correct 108 ms 246972 KB Output is correct
11 Correct 107 ms 246952 KB Output is correct
12 Correct 111 ms 247000 KB Output is correct
13 Correct 118 ms 246780 KB Output is correct
14 Correct 119 ms 247000 KB Output is correct
15 Correct 109 ms 247012 KB Output is correct
16 Correct 101 ms 246872 KB Output is correct
17 Correct 109 ms 246820 KB Output is correct
18 Correct 124 ms 247036 KB Output is correct
19 Correct 108 ms 246992 KB Output is correct
20 Correct 109 ms 246992 KB Output is correct
21 Correct 108 ms 246860 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 246304 KB Output is correct
2 Correct 107 ms 247008 KB Output is correct
3 Correct 106 ms 246972 KB Output is correct
4 Correct 107 ms 247076 KB Output is correct
5 Correct 107 ms 246824 KB Output is correct
6 Correct 108 ms 246772 KB Output is correct
7 Correct 110 ms 246832 KB Output is correct
8 Correct 110 ms 246956 KB Output is correct
9 Correct 107 ms 246864 KB Output is correct
10 Correct 108 ms 246972 KB Output is correct
11 Correct 107 ms 246952 KB Output is correct
12 Correct 111 ms 247000 KB Output is correct
13 Correct 118 ms 246780 KB Output is correct
14 Correct 119 ms 247000 KB Output is correct
15 Correct 109 ms 247012 KB Output is correct
16 Correct 101 ms 246872 KB Output is correct
17 Correct 109 ms 246820 KB Output is correct
18 Correct 124 ms 247036 KB Output is correct
19 Correct 108 ms 246992 KB Output is correct
20 Correct 109 ms 246992 KB Output is correct
21 Correct 108 ms 246860 KB Output is correct
22 Correct 354 ms 249536 KB Output is correct
23 Correct 352 ms 249632 KB Output is correct
24 Correct 371 ms 248148 KB Output is correct
25 Correct 337 ms 250132 KB Output is correct
26 Correct 364 ms 248556 KB Output is correct
27 Correct 365 ms 248808 KB Output is correct
28 Correct 365 ms 249452 KB Output is correct
29 Correct 355 ms 249908 KB Output is correct
30 Correct 371 ms 248676 KB Output is correct
31 Correct 342 ms 248860 KB Output is correct
32 Correct 374 ms 250148 KB Output is correct
33 Correct 362 ms 248664 KB Output is correct
34 Correct 364 ms 249616 KB Output is correct
35 Correct 348 ms 249888 KB Output is correct
36 Correct 364 ms 248928 KB Output is correct
37 Correct 360 ms 250116 KB Output is correct
38 Correct 364 ms 249256 KB Output is correct
39 Correct 366 ms 249492 KB Output is correct
40 Correct 365 ms 249952 KB Output is correct
41 Correct 355 ms 249012 KB Output is correct
42 Correct 363 ms 248572 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 246304 KB Output is correct
2 Correct 107 ms 247008 KB Output is correct
3 Correct 106 ms 246972 KB Output is correct
4 Correct 107 ms 247076 KB Output is correct
5 Correct 107 ms 246824 KB Output is correct
6 Correct 108 ms 246772 KB Output is correct
7 Correct 110 ms 246832 KB Output is correct
8 Correct 110 ms 246956 KB Output is correct
9 Correct 107 ms 246864 KB Output is correct
10 Correct 108 ms 246972 KB Output is correct
11 Correct 107 ms 246952 KB Output is correct
12 Correct 111 ms 247000 KB Output is correct
13 Correct 118 ms 246780 KB Output is correct
14 Correct 119 ms 247000 KB Output is correct
15 Correct 109 ms 247012 KB Output is correct
16 Correct 101 ms 246872 KB Output is correct
17 Correct 109 ms 246820 KB Output is correct
18 Correct 124 ms 247036 KB Output is correct
19 Correct 108 ms 246992 KB Output is correct
20 Correct 109 ms 246992 KB Output is correct
21 Correct 108 ms 246860 KB Output is correct
22 Correct 354 ms 249536 KB Output is correct
23 Correct 352 ms 249632 KB Output is correct
24 Correct 371 ms 248148 KB Output is correct
25 Correct 337 ms 250132 KB Output is correct
26 Correct 364 ms 248556 KB Output is correct
27 Correct 365 ms 248808 KB Output is correct
28 Correct 365 ms 249452 KB Output is correct
29 Correct 355 ms 249908 KB Output is correct
30 Correct 371 ms 248676 KB Output is correct
31 Correct 342 ms 248860 KB Output is correct
32 Correct 374 ms 250148 KB Output is correct
33 Correct 362 ms 248664 KB Output is correct
34 Correct 364 ms 249616 KB Output is correct
35 Correct 348 ms 249888 KB Output is correct
36 Correct 364 ms 248928 KB Output is correct
37 Correct 360 ms 250116 KB Output is correct
38 Correct 364 ms 249256 KB Output is correct
39 Correct 366 ms 249492 KB Output is correct
40 Correct 365 ms 249952 KB Output is correct
41 Correct 355 ms 249012 KB Output is correct
42 Correct 363 ms 248572 KB Output is correct
43 Execution timed out 1132 ms 312316 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 246304 KB Output is correct
2 Correct 107 ms 247008 KB Output is correct
3 Correct 106 ms 246972 KB Output is correct
4 Correct 107 ms 247076 KB Output is correct
5 Correct 107 ms 246824 KB Output is correct
6 Correct 108 ms 246772 KB Output is correct
7 Correct 110 ms 246832 KB Output is correct
8 Correct 110 ms 246956 KB Output is correct
9 Correct 107 ms 246864 KB Output is correct
10 Correct 108 ms 246972 KB Output is correct
11 Correct 107 ms 246952 KB Output is correct
12 Correct 111 ms 247000 KB Output is correct
13 Correct 118 ms 246780 KB Output is correct
14 Correct 119 ms 247000 KB Output is correct
15 Correct 109 ms 247012 KB Output is correct
16 Correct 101 ms 246872 KB Output is correct
17 Correct 109 ms 246820 KB Output is correct
18 Correct 124 ms 247036 KB Output is correct
19 Correct 108 ms 246992 KB Output is correct
20 Correct 109 ms 246992 KB Output is correct
21 Correct 108 ms 246860 KB Output is correct
22 Correct 354 ms 249536 KB Output is correct
23 Correct 352 ms 249632 KB Output is correct
24 Correct 371 ms 248148 KB Output is correct
25 Correct 337 ms 250132 KB Output is correct
26 Correct 364 ms 248556 KB Output is correct
27 Correct 365 ms 248808 KB Output is correct
28 Correct 365 ms 249452 KB Output is correct
29 Correct 355 ms 249908 KB Output is correct
30 Correct 371 ms 248676 KB Output is correct
31 Correct 342 ms 248860 KB Output is correct
32 Correct 374 ms 250148 KB Output is correct
33 Correct 362 ms 248664 KB Output is correct
34 Correct 364 ms 249616 KB Output is correct
35 Correct 348 ms 249888 KB Output is correct
36 Correct 364 ms 248928 KB Output is correct
37 Correct 360 ms 250116 KB Output is correct
38 Correct 364 ms 249256 KB Output is correct
39 Correct 366 ms 249492 KB Output is correct
40 Correct 365 ms 249952 KB Output is correct
41 Correct 355 ms 249012 KB Output is correct
42 Correct 363 ms 248572 KB Output is correct
43 Execution timed out 1132 ms 312316 KB Time limit exceeded
44 Halted 0 ms 0 KB -