oj.uz

Submission #658577

# Submission time Handle Problem Language Result Execution time Memory
658577 2022-11-13T15:01:14 Z mychecksedad Cubeword (CEOI19_cubeword) C++17
50 / 100
 1040 ms 9124 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 = 62;
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 1040 ms 9016 KB Output is correct
2 Correct 1010 ms 8984 KB Output is correct
3 Correct 1006 ms 9048 KB Output is correct
4 Correct 988 ms 8896 KB Output is correct
5 Correct 1004 ms 8892 KB Output is correct
6 Correct 983 ms 8852 KB Output is correct
7 Correct 980 ms 8912 KB Output is correct
8 Correct 1008 ms 9068 KB Output is correct
9 Correct 989 ms 8952 KB Output is correct
10 Correct 973 ms 8980 KB Output is correct
11 Correct 991 ms 8816 KB Output is correct
12 Correct 1016 ms 8936 KB Output is correct
13 Correct 1004 ms 9036 KB Output is correct
14 Correct 1000 ms 9028 KB Output is correct
15 Correct 988 ms 9124 KB Output is correct
16 Correct 975 ms 9004 KB Output is correct
17 Correct 990 ms 8928 KB Output is correct
18 Correct 1002 ms 8980 KB Output is correct
19 Correct 985 ms 8956 KB Output is correct
20 Correct 996 ms 8940 KB Output is correct
21 Correct 1004 ms 8912 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1040 ms 9016 KB Output is correct
2 Correct 1010 ms 8984 KB Output is correct
3 Correct 1006 ms 9048 KB Output is correct
4 Correct 988 ms 8896 KB Output is correct
5 Correct 1004 ms 8892 KB Output is correct
6 Correct 983 ms 8852 KB Output is correct
7 Correct 980 ms 8912 KB Output is correct
8 Correct 1008 ms 9068 KB Output is correct
9 Correct 989 ms 8952 KB Output is correct
10 Correct 973 ms 8980 KB Output is correct
11 Correct 991 ms 8816 KB Output is correct
12 Correct 1016 ms 8936 KB Output is correct
13 Correct 1004 ms 9036 KB Output is correct
14 Correct 1000 ms 9028 KB Output is correct
15 Correct 988 ms 9124 KB Output is correct
16 Correct 975 ms 9004 KB Output is correct
17 Correct 990 ms 8928 KB Output is correct
18 Correct 1002 ms 8980 KB Output is correct
19 Correct 985 ms 8956 KB Output is correct
20 Correct 996 ms 8940 KB Output is correct
21 Correct 1004 ms 8912 KB Output is correct
22 Correct 983 ms 8208 KB Output is correct
23 Correct 983 ms 8136 KB Output is correct
24 Correct 1002 ms 8072 KB Output is correct
25 Correct 1022 ms 8164 KB Output is correct
26 Correct 1018 ms 8080 KB Output is correct
27 Correct 1014 ms 8132 KB Output is correct
28 Correct 1018 ms 8212 KB Output is correct
29 Correct 990 ms 8088 KB Output is correct
30 Correct 991 ms 8200 KB Output is correct
31 Correct 996 ms 8076 KB Output is correct
32 Correct 1012 ms 8084 KB Output is correct
33 Correct 1010 ms 8112 KB Output is correct
34 Correct 1004 ms 8144 KB Output is correct
35 Correct 996 ms 8116 KB Output is correct
36 Correct 989 ms 8088 KB Output is correct
37 Correct 990 ms 8148 KB Output is correct
38 Correct 985 ms 8104 KB Output is correct
39 Correct 1008 ms 8064 KB Output is correct
40 Correct 1004 ms 8088 KB Output is correct
41 Correct 997 ms 8196 KB Output is correct
42 Correct 985 ms 8232 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1040 ms 9016 KB Output is correct
2 Correct 1010 ms 8984 KB Output is correct
3 Correct 1006 ms 9048 KB Output is correct
4 Correct 988 ms 8896 KB Output is correct
5 Correct 1004 ms 8892 KB Output is correct
6 Correct 983 ms 8852 KB Output is correct
7 Correct 980 ms 8912 KB Output is correct
8 Correct 1008 ms 9068 KB Output is correct
9 Correct 989 ms 8952 KB Output is correct
10 Correct 973 ms 8980 KB Output is correct
11 Correct 991 ms 8816 KB Output is correct
12 Correct 1016 ms 8936 KB Output is correct
13 Correct 1004 ms 9036 KB Output is correct
14 Correct 1000 ms 9028 KB Output is correct
15 Correct 988 ms 9124 KB Output is correct
16 Correct 975 ms 9004 KB Output is correct
17 Correct 990 ms 8928 KB Output is correct
18 Correct 1002 ms 8980 KB Output is correct
19 Correct 985 ms 8956 KB Output is correct
20 Correct 996 ms 8940 KB Output is correct
21 Correct 1004 ms 8912 KB Output is correct
22 Correct 983 ms 8208 KB Output is correct
23 Correct 983 ms 8136 KB Output is correct
24 Correct 1002 ms 8072 KB Output is correct
25 Correct 1022 ms 8164 KB Output is correct
26 Correct 1018 ms 8080 KB Output is correct
27 Correct 1014 ms 8132 KB Output is correct
28 Correct 1018 ms 8212 KB Output is correct
29 Correct 990 ms 8088 KB Output is correct
30 Correct 991 ms 8200 KB Output is correct
31 Correct 996 ms 8076 KB Output is correct
32 Correct 1012 ms 8084 KB Output is correct
33 Correct 1010 ms 8112 KB Output is correct
34 Correct 1004 ms 8144 KB Output is correct
35 Correct 996 ms 8116 KB Output is correct
36 Correct 989 ms 8088 KB Output is correct
37 Correct 990 ms 8148 KB Output is correct
38 Correct 985 ms 8104 KB Output is correct
39 Correct 1008 ms 8064 KB Output is correct
40 Correct 1004 ms 8088 KB Output is correct
41 Correct 997 ms 8196 KB Output is correct
42 Correct 985 ms 8232 KB Output is correct
43 Incorrect 997 ms 7972 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1040 ms 9016 KB Output is correct
2 Correct 1010 ms 8984 KB Output is correct
3 Correct 1006 ms 9048 KB Output is correct
4 Correct 988 ms 8896 KB Output is correct
5 Correct 1004 ms 8892 KB Output is correct
6 Correct 983 ms 8852 KB Output is correct
7 Correct 980 ms 8912 KB Output is correct
8 Correct 1008 ms 9068 KB Output is correct
9 Correct 989 ms 8952 KB Output is correct
10 Correct 973 ms 8980 KB Output is correct
11 Correct 991 ms 8816 KB Output is correct
12 Correct 1016 ms 8936 KB Output is correct
13 Correct 1004 ms 9036 KB Output is correct
14 Correct 1000 ms 9028 KB Output is correct
15 Correct 988 ms 9124 KB Output is correct
16 Correct 975 ms 9004 KB Output is correct
17 Correct 990 ms 8928 KB Output is correct
18 Correct 1002 ms 8980 KB Output is correct
19 Correct 985 ms 8956 KB Output is correct
20 Correct 996 ms 8940 KB Output is correct
21 Correct 1004 ms 8912 KB Output is correct
22 Correct 983 ms 8208 KB Output is correct
23 Correct 983 ms 8136 KB Output is correct
24 Correct 1002 ms 8072 KB Output is correct
25 Correct 1022 ms 8164 KB Output is correct
26 Correct 1018 ms 8080 KB Output is correct
27 Correct 1014 ms 8132 KB Output is correct
28 Correct 1018 ms 8212 KB Output is correct
29 Correct 990 ms 8088 KB Output is correct
30 Correct 991 ms 8200 KB Output is correct
31 Correct 996 ms 8076 KB Output is correct
32 Correct 1012 ms 8084 KB Output is correct
33 Correct 1010 ms 8112 KB Output is correct
34 Correct 1004 ms 8144 KB Output is correct
35 Correct 996 ms 8116 KB Output is correct
36 Correct 989 ms 8088 KB Output is correct
37 Correct 990 ms 8148 KB Output is correct
38 Correct 985 ms 8104 KB Output is correct
39 Correct 1008 ms 8064 KB Output is correct
40 Correct 1004 ms 8088 KB Output is correct
41 Correct 997 ms 8196 KB Output is correct
42 Correct 985 ms 8232 KB Output is correct
43 Incorrect 997 ms 7972 KB Output isn't correct
44 Halted 0 ms 0 KB -