oj.uz

Submission #658579

# Submission time Handle Problem Language Result Execution time Memory
658579 2022-11-13T15:06:14 Z mychecksedad Cubeword (CEOI19_cubeword) C++17
50 / 100
 626 ms 8524 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD1 (1000000000+7)
#define MOD (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

int n, S = 54;
ll dp[100][100], d[70][70][70];
vector<string> s[15];
bool is_palindrome(string &a){
    bool ok = 1;
    int x = a.length();
    for(int i = 0; i < x / 2; ++i) ok &= (a[i] == a[x - i - 1]);

    return ok;
}
void solve(){
    cin >> n;
    for(int i = 0; i < n; ++i){
        string a; cin >> a;
        for(char &c: a){
            if(c >= '0' && c <= '9'){
                c = 'z' + 26 + (c - '0') + 1;
            }
            else if(!(c >= 'a' && c <= 'z')){
                c = 'z' + (c - 'A') + 1;
            }
        }
        s[a.length()].pb(a);
    }
    ll ans = 0;
    for(int i = 1; i < 15; ++i){
        if(s[i].empty()) continue;
        for(int j = 0; j < S; ++j) for(int k = 0; k < S; ++k) dp[j][k] = 0;
        
        map<string, bool> used;
        for(auto a: s[i]){
            if(used[a]) continue;
            if(is_palindrome(a)){
                dp[a[0] - 'a'][a[0] - 'a']++;
            }else{
                dp[a[0] - 'a'][a.back() - 'a']++;
                dp[a.back() - 'a'][a[0] - 'a']++;
            }
            reverse(all(a));
            used[a] = 1;
        }


        for(int a = 0; a < S; ++a){
            for(int b = 0; b < S; ++b){
                for(int c = 0; c < S; ++c){
                    d[a][b][c] = 0;
                    for(int l = 0; l < S; ++l){
                        (d[a][b][c] += dp[a][l] * dp[b][l] * dp[c][l]) %= MOD;
                    }   
                }
            }
        }

        for(int a = 0; a < S; ++a){
            for(int b = 0; b < S; ++b){
                for(int c = 0; c < S; ++c){
                    for(int e = 0; e < S; ++e){
                        (ans += (d[a][b][c] * d[a][b][e] % MOD) * (d[a][c][e] * d[b][c][e] % MOD)) %= MOD;
                    }   
                }
            }
        }

    }
    cout << ans;
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
    }
    return 0;
 
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:91:16: warning: unused variable 'aa' [-Wunused-variable]
   91 |     int T = 1, aa;
      |                ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 8364 KB Output is correct
2 Correct 606 ms 8312 KB Output is correct
3 Correct 597 ms 8328 KB Output is correct
4 Correct 601 ms 8524 KB Output is correct
5 Correct 597 ms 8404 KB Output is correct
6 Correct 597 ms 8328 KB Output is correct
7 Correct 602 ms 8292 KB Output is correct
8 Correct 603 ms 8420 KB Output is correct
9 Correct 594 ms 8388 KB Output is correct
10 Correct 596 ms 8368 KB Output is correct
11 Correct 601 ms 8356 KB Output is correct
12 Correct 595 ms 8344 KB Output is correct
13 Correct 594 ms 8352 KB Output is correct
14 Correct 589 ms 8364 KB Output is correct
15 Correct 601 ms 8436 KB Output is correct
16 Correct 612 ms 8360 KB Output is correct
17 Correct 599 ms 8376 KB Output is correct
18 Correct 598 ms 8436 KB Output is correct
19 Correct 598 ms 8284 KB Output is correct
20 Correct 617 ms 8352 KB Output is correct
21 Correct 592 ms 8268 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 8364 KB Output is correct
2 Correct 606 ms 8312 KB Output is correct
3 Correct 597 ms 8328 KB Output is correct
4 Correct 601 ms 8524 KB Output is correct
5 Correct 597 ms 8404 KB Output is correct
6 Correct 597 ms 8328 KB Output is correct
7 Correct 602 ms 8292 KB Output is correct
8 Correct 603 ms 8420 KB Output is correct
9 Correct 594 ms 8388 KB Output is correct
10 Correct 596 ms 8368 KB Output is correct
11 Correct 601 ms 8356 KB Output is correct
12 Correct 595 ms 8344 KB Output is correct
13 Correct 594 ms 8352 KB Output is correct
14 Correct 589 ms 8364 KB Output is correct
15 Correct 601 ms 8436 KB Output is correct
16 Correct 612 ms 8360 KB Output is correct
17 Correct 599 ms 8376 KB Output is correct
18 Correct 598 ms 8436 KB Output is correct
19 Correct 598 ms 8284 KB Output is correct
20 Correct 617 ms 8352 KB Output is correct
21 Correct 592 ms 8268 KB Output is correct
22 Correct 615 ms 7544 KB Output is correct
23 Correct 620 ms 7544 KB Output is correct
24 Correct 626 ms 7536 KB Output is correct
25 Correct 606 ms 7516 KB Output is correct
26 Correct 612 ms 7456 KB Output is correct
27 Correct 614 ms 7400 KB Output is correct
28 Correct 612 ms 7488 KB Output is correct
29 Correct 608 ms 7660 KB Output is correct
30 Correct 606 ms 7548 KB Output is correct
31 Correct 609 ms 7576 KB Output is correct
32 Correct 620 ms 7448 KB Output is correct
33 Correct 601 ms 7528 KB Output is correct
34 Correct 605 ms 7584 KB Output is correct
35 Correct 615 ms 7656 KB Output is correct
36 Correct 600 ms 7504 KB Output is correct
37 Correct 602 ms 7464 KB Output is correct
38 Correct 609 ms 7656 KB Output is correct
39 Correct 594 ms 7612 KB Output is correct
40 Correct 600 ms 7448 KB Output is correct
41 Correct 607 ms 7540 KB Output is correct
42 Correct 594 ms 7604 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 8364 KB Output is correct
2 Correct 606 ms 8312 KB Output is correct
3 Correct 597 ms 8328 KB Output is correct
4 Correct 601 ms 8524 KB Output is correct
5 Correct 597 ms 8404 KB Output is correct
6 Correct 597 ms 8328 KB Output is correct
7 Correct 602 ms 8292 KB Output is correct
8 Correct 603 ms 8420 KB Output is correct
9 Correct 594 ms 8388 KB Output is correct
10 Correct 596 ms 8368 KB Output is correct
11 Correct 601 ms 8356 KB Output is correct
12 Correct 595 ms 8344 KB Output is correct
13 Correct 594 ms 8352 KB Output is correct
14 Correct 589 ms 8364 KB Output is correct
15 Correct 601 ms 8436 KB Output is correct
16 Correct 612 ms 8360 KB Output is correct
17 Correct 599 ms 8376 KB Output is correct
18 Correct 598 ms 8436 KB Output is correct
19 Correct 598 ms 8284 KB Output is correct
20 Correct 617 ms 8352 KB Output is correct
21 Correct 592 ms 8268 KB Output is correct
22 Correct 615 ms 7544 KB Output is correct
23 Correct 620 ms 7544 KB Output is correct
24 Correct 626 ms 7536 KB Output is correct
25 Correct 606 ms 7516 KB Output is correct
26 Correct 612 ms 7456 KB Output is correct
27 Correct 614 ms 7400 KB Output is correct
28 Correct 612 ms 7488 KB Output is correct
29 Correct 608 ms 7660 KB Output is correct
30 Correct 606 ms 7548 KB Output is correct
31 Correct 609 ms 7576 KB Output is correct
32 Correct 620 ms 7448 KB Output is correct
33 Correct 601 ms 7528 KB Output is correct
34 Correct 605 ms 7584 KB Output is correct
35 Correct 615 ms 7656 KB Output is correct
36 Correct 600 ms 7504 KB Output is correct
37 Correct 602 ms 7464 KB Output is correct
38 Correct 609 ms 7656 KB Output is correct
39 Correct 594 ms 7612 KB Output is correct
40 Correct 600 ms 7448 KB Output is correct
41 Correct 607 ms 7540 KB Output is correct
42 Correct 594 ms 7604 KB Output is correct
43 Incorrect 607 ms 7464 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 8364 KB Output is correct
2 Correct 606 ms 8312 KB Output is correct
3 Correct 597 ms 8328 KB Output is correct
4 Correct 601 ms 8524 KB Output is correct
5 Correct 597 ms 8404 KB Output is correct
6 Correct 597 ms 8328 KB Output is correct
7 Correct 602 ms 8292 KB Output is correct
8 Correct 603 ms 8420 KB Output is correct
9 Correct 594 ms 8388 KB Output is correct
10 Correct 596 ms 8368 KB Output is correct
11 Correct 601 ms 8356 KB Output is correct
12 Correct 595 ms 8344 KB Output is correct
13 Correct 594 ms 8352 KB Output is correct
14 Correct 589 ms 8364 KB Output is correct
15 Correct 601 ms 8436 KB Output is correct
16 Correct 612 ms 8360 KB Output is correct
17 Correct 599 ms 8376 KB Output is correct
18 Correct 598 ms 8436 KB Output is correct
19 Correct 598 ms 8284 KB Output is correct
20 Correct 617 ms 8352 KB Output is correct
21 Correct 592 ms 8268 KB Output is correct
22 Correct 615 ms 7544 KB Output is correct
23 Correct 620 ms 7544 KB Output is correct
24 Correct 626 ms 7536 KB Output is correct
25 Correct 606 ms 7516 KB Output is correct
26 Correct 612 ms 7456 KB Output is correct
27 Correct 614 ms 7400 KB Output is correct
28 Correct 612 ms 7488 KB Output is correct
29 Correct 608 ms 7660 KB Output is correct
30 Correct 606 ms 7548 KB Output is correct
31 Correct 609 ms 7576 KB Output is correct
32 Correct 620 ms 7448 KB Output is correct
33 Correct 601 ms 7528 KB Output is correct
34 Correct 605 ms 7584 KB Output is correct
35 Correct 615 ms 7656 KB Output is correct
36 Correct 600 ms 7504 KB Output is correct
37 Correct 602 ms 7464 KB Output is correct
38 Correct 609 ms 7656 KB Output is correct
39 Correct 594 ms 7612 KB Output is correct
40 Correct 600 ms 7448 KB Output is correct
41 Correct 607 ms 7540 KB Output is correct
42 Correct 594 ms 7604 KB Output is correct
43 Incorrect 607 ms 7464 KB Output isn't correct
44 Halted 0 ms 0 KB -