oj.uz

답안 #948513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948513 2024-03-18T07:26:03 Z GrandTiger1729 Cubeword (CEOI19_cubeword) C++17
0 / 100
 1100 ms 17756 KB 
#include <bits/stdc++.h>
using namespace std;

namespace
{
const int N = 11, K = 128, MOD = 998244353;
int a[N][K][K]{};
long long res[K][K][K]{};
}
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        string ss = s;
        reverse(ss.begin(), ss.end());
        if (s == ss)
        {
            a[s.size()][s[0]][ss[0]]++;
        }
        else
        {
            a[s.size()][s[0]][ss[0]]++;
            a[s.size()][ss[0]][s[0]]++;
        }
    }
    long long ans = 0;
    for (int t = 3; t < N; t++)
    {
        fill_n(&res[0][0][0], sizeof(res) / sizeof(long long), 0);
        for (int i = '0'; i <= 'z'; i++)
        {
            for (int j = '0'; j <= 'z'; j++)
            {
                for (int k = '0'; k <= 'z'; k++)
                {
                    for (int l = '0'; l <= 'z'; l++)
                    {
                        (res[i][j][k] += 1ll * a[t][i][l] * a[t][j][l] * a[t][k][l]) %= MOD;
                    }
                }
            }
        }
        for (int i = '0'; i <= 'z'; i++)
        {
            for (int j = '0'; j <= 'z'; j++)
            {
                for (int k = '0'; k <= 'z'; k++)
                {
                    for (int l = '0'; l <= 'z'; l++)
                    {
                        (ans += res[i][j][k] * res[i][j][l] % MOD * res[i][k][l] % MOD * res[j][k][l]) %= MOD;
                    }
                }
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:23:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   23 |             a[s.size()][s[0]][ss[0]]++;
      |                             ^
cubeword.cpp:23:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   23 |             a[s.size()][s[0]][ss[0]]++;
      |                                    ^
cubeword.cpp:27:29: warning: array subscript has type 'char' [-Wchar-subscripts]
   27 |             a[s.size()][s[0]][ss[0]]++;
      |                             ^
cubeword.cpp:27:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   27 |             a[s.size()][s[0]][ss[0]]++;
      |                                    ^
cubeword.cpp:28:30: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |             a[s.size()][ss[0]][s[0]]++;
      |                              ^
cubeword.cpp:28:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |             a[s.size()][ss[0]][s[0]]++;
      |                                    ^

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1155 ms 17756 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1155 ms 17756 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1155 ms 17756 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1155 ms 17756 KB Time limit exceeded
2 Halted 0 ms 0 KB -