oj.uz

답안 #658576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
658576 2022-11-13T14:59:30 Z mychecksedad Cubeword (CEOI19_cubeword) C++17
50 / 100
 980 ms 9056 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 = 61;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 8848 KB Output is correct
2 Correct 964 ms 8908 KB Output is correct
3 Correct 929 ms 9056 KB Output is correct
4 Correct 945 ms 8952 KB Output is correct
5 Correct 980 ms 8932 KB Output is correct
6 Correct 933 ms 8820 KB Output is correct
7 Correct 933 ms 8972 KB Output is correct
8 Correct 945 ms 8884 KB Output is correct
9 Correct 942 ms 8856 KB Output is correct
10 Correct 945 ms 8952 KB Output is correct
11 Correct 971 ms 8896 KB Output is correct
12 Correct 925 ms 8856 KB Output is correct
13 Correct 935 ms 8928 KB Output is correct
14 Correct 926 ms 8904 KB Output is correct
15 Correct 930 ms 8844 KB Output is correct
16 Correct 927 ms 8832 KB Output is correct
17 Correct 933 ms 8976 KB Output is correct
18 Correct 941 ms 8812 KB Output is correct
19 Correct 932 ms 8872 KB Output is correct
20 Correct 927 ms 8900 KB Output is correct
21 Correct 940 ms 8892 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 8848 KB Output is correct
2 Correct 964 ms 8908 KB Output is correct
3 Correct 929 ms 9056 KB Output is correct
4 Correct 945 ms 8952 KB Output is correct
5 Correct 980 ms 8932 KB Output is correct
6 Correct 933 ms 8820 KB Output is correct
7 Correct 933 ms 8972 KB Output is correct
8 Correct 945 ms 8884 KB Output is correct
9 Correct 942 ms 8856 KB Output is correct
10 Correct 945 ms 8952 KB Output is correct
11 Correct 971 ms 8896 KB Output is correct
12 Correct 925 ms 8856 KB Output is correct
13 Correct 935 ms 8928 KB Output is correct
14 Correct 926 ms 8904 KB Output is correct
15 Correct 930 ms 8844 KB Output is correct
16 Correct 927 ms 8832 KB Output is correct
17 Correct 933 ms 8976 KB Output is correct
18 Correct 941 ms 8812 KB Output is correct
19 Correct 932 ms 8872 KB Output is correct
20 Correct 927 ms 8900 KB Output is correct
21 Correct 940 ms 8892 KB Output is correct
22 Correct 933 ms 8064 KB Output is correct
23 Correct 939 ms 8048 KB Output is correct
24 Correct 936 ms 8132 KB Output is correct
25 Correct 963 ms 8092 KB Output is correct
26 Correct 972 ms 8008 KB Output is correct
27 Correct 957 ms 8004 KB Output is correct
28 Correct 931 ms 8148 KB Output is correct
29 Correct 970 ms 8036 KB Output is correct
30 Correct 958 ms 8008 KB Output is correct
31 Correct 951 ms 8104 KB Output is correct
32 Correct 945 ms 8108 KB Output is correct
33 Correct 939 ms 8052 KB Output is correct
34 Correct 959 ms 8116 KB Output is correct
35 Correct 923 ms 8040 KB Output is correct
36 Correct 949 ms 8016 KB Output is correct
37 Correct 948 ms 8060 KB Output is correct
38 Correct 940 ms 8036 KB Output is correct
39 Correct 923 ms 7996 KB Output is correct
40 Correct 940 ms 8092 KB Output is correct
41 Correct 920 ms 8140 KB Output is correct
42 Correct 940 ms 8084 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 8848 KB Output is correct
2 Correct 964 ms 8908 KB Output is correct
3 Correct 929 ms 9056 KB Output is correct
4 Correct 945 ms 8952 KB Output is correct
5 Correct 980 ms 8932 KB Output is correct
6 Correct 933 ms 8820 KB Output is correct
7 Correct 933 ms 8972 KB Output is correct
8 Correct 945 ms 8884 KB Output is correct
9 Correct 942 ms 8856 KB Output is correct
10 Correct 945 ms 8952 KB Output is correct
11 Correct 971 ms 8896 KB Output is correct
12 Correct 925 ms 8856 KB Output is correct
13 Correct 935 ms 8928 KB Output is correct
14 Correct 926 ms 8904 KB Output is correct
15 Correct 930 ms 8844 KB Output is correct
16 Correct 927 ms 8832 KB Output is correct
17 Correct 933 ms 8976 KB Output is correct
18 Correct 941 ms 8812 KB Output is correct
19 Correct 932 ms 8872 KB Output is correct
20 Correct 927 ms 8900 KB Output is correct
21 Correct 940 ms 8892 KB Output is correct
22 Correct 933 ms 8064 KB Output is correct
23 Correct 939 ms 8048 KB Output is correct
24 Correct 936 ms 8132 KB Output is correct
25 Correct 963 ms 8092 KB Output is correct
26 Correct 972 ms 8008 KB Output is correct
27 Correct 957 ms 8004 KB Output is correct
28 Correct 931 ms 8148 KB Output is correct
29 Correct 970 ms 8036 KB Output is correct
30 Correct 958 ms 8008 KB Output is correct
31 Correct 951 ms 8104 KB Output is correct
32 Correct 945 ms 8108 KB Output is correct
33 Correct 939 ms 8052 KB Output is correct
34 Correct 959 ms 8116 KB Output is correct
35 Correct 923 ms 8040 KB Output is correct
36 Correct 949 ms 8016 KB Output is correct
37 Correct 948 ms 8060 KB Output is correct
38 Correct 940 ms 8036 KB Output is correct
39 Correct 923 ms 7996 KB Output is correct
40 Correct 940 ms 8092 KB Output is correct
41 Correct 920 ms 8140 KB Output is correct
42 Correct 940 ms 8084 KB Output is correct
43 Incorrect 919 ms 7872 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 8848 KB Output is correct
2 Correct 964 ms 8908 KB Output is correct
3 Correct 929 ms 9056 KB Output is correct
4 Correct 945 ms 8952 KB Output is correct
5 Correct 980 ms 8932 KB Output is correct
6 Correct 933 ms 8820 KB Output is correct
7 Correct 933 ms 8972 KB Output is correct
8 Correct 945 ms 8884 KB Output is correct
9 Correct 942 ms 8856 KB Output is correct
10 Correct 945 ms 8952 KB Output is correct
11 Correct 971 ms 8896 KB Output is correct
12 Correct 925 ms 8856 KB Output is correct
13 Correct 935 ms 8928 KB Output is correct
14 Correct 926 ms 8904 KB Output is correct
15 Correct 930 ms 8844 KB Output is correct
16 Correct 927 ms 8832 KB Output is correct
17 Correct 933 ms 8976 KB Output is correct
18 Correct 941 ms 8812 KB Output is correct
19 Correct 932 ms 8872 KB Output is correct
20 Correct 927 ms 8900 KB Output is correct
21 Correct 940 ms 8892 KB Output is correct
22 Correct 933 ms 8064 KB Output is correct
23 Correct 939 ms 8048 KB Output is correct
24 Correct 936 ms 8132 KB Output is correct
25 Correct 963 ms 8092 KB Output is correct
26 Correct 972 ms 8008 KB Output is correct
27 Correct 957 ms 8004 KB Output is correct
28 Correct 931 ms 8148 KB Output is correct
29 Correct 970 ms 8036 KB Output is correct
30 Correct 958 ms 8008 KB Output is correct
31 Correct 951 ms 8104 KB Output is correct
32 Correct 945 ms 8108 KB Output is correct
33 Correct 939 ms 8052 KB Output is correct
34 Correct 959 ms 8116 KB Output is correct
35 Correct 923 ms 8040 KB Output is correct
36 Correct 949 ms 8016 KB Output is correct
37 Correct 948 ms 8060 KB Output is correct
38 Correct 940 ms 8036 KB Output is correct
39 Correct 923 ms 7996 KB Output is correct
40 Correct 940 ms 8092 KB Output is correct
41 Correct 920 ms 8140 KB Output is correct
42 Correct 940 ms 8084 KB Output is correct
43 Incorrect 919 ms 7872 KB Output isn't correct
44 Halted 0 ms 0 KB -