oj.uz

답안 #949432

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949432 2024-03-19T08:46:10 Z gaga999 Cubeword (CEOI19_cubeword) C++17
50 / 100
 1100 ms 104048 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

int ct[15][62][62], dp[15][62][62][62];

inline int gv(char c)
{
    if (isdigit(c))
        return c - '0';
    if ('a' <= c && c <= 'z')
        return c - 'a' + 10;
    return c - 'A' + 36;
}

char s[15], *p;
int tr[62][1000005], ctd;
bool ed[1000005];

inline void add()
{
    int cr = 0;
    for (char *i = s; i < p; i++)
    {
        if (!tr[*i][cr])
            tr[*i][cr] = ++ctd;
        cr = tr[*i][cr];
    }
    ed[cr] = 1;
}

void dfs(int cr, int d)
{
    d++;
    for (int i = 0; i < 62; i++)
    {
        if (tr[i][cr])
        {
            if (ed[tr[i][cr]])
                ct[d][*p][i]++;
            dfs(tr[i][cr], d);
        }
    }
}

signed main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%s", s);
        for (p = s; *p; p++)
            *p = gv(*p);
        add();
        reverse(s, p);
        add();
    }
    for (int i = 0; i < 62; i++)
        if (tr[i][0])
            *p = i, dfs(tr[i][0], 1);
    int ans = 0;
    for (int l = 3; l <= 10; l++)
    {
        for (int i = 0; i < 62; i++)
        {
            for (int a = 0; a < 62; a++)
            {
                for (int b = 0; b < 62; b++)
                {
                    for (int c = 0; c < 62; c++)
                    {
                        (dp[l][a][b][c] += 1ll * ct[l][i][a] * ct[l][i][b] % M * ct[l][i][c] % M) %= M;
                    }
                }
            }
        }
        for (int i = 0; i < 62; i++)
        {
            for (int a = 0; a < 62; a++)
            {
                for (int b = 0; b < 62; b++)
                {
                    for (int c = 0; c < 62; c++)
                    {
                        (ans += (1ll * dp[l][a][b][c] * dp[l][a][b][i]) % M * (1ll * dp[l][i][c][a] * dp[l][i][c][b] % M) % M) %= M;
                    }
                }
            }
        }
    }
    printf("%d\n", ans);
}

Compilation message

cubeword.cpp: In function 'void add()':
cubeword.cpp:133:17: warning: array subscript has type 'char' [-Wchar-subscripts]
  133 |         if (!tr[*i][cr])
      |                 ^~
cubeword.cpp:134:16: warning: array subscript has type 'char' [-Wchar-subscripts]
  134 |             tr[*i][cr] = ++ctd;
      |                ^~
cubeword.cpp:135:17: warning: array subscript has type 'char' [-Wchar-subscripts]
  135 |         cr = tr[*i][cr];
      |                 ^~
cubeword.cpp: In function 'void dfs(int, int)':
cubeword.cpp:148:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  148 |                 ct[d][*p][i]++;
      |                       ^~
cubeword.cpp: In function 'int main()':
cubeword.cpp:157:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  157 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
cubeword.cpp:160:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  160 |         scanf("%s", s);
      |         ~~~~~^~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 936 ms 20816 KB Output is correct
2 Correct 934 ms 20896 KB Output is correct
3 Correct 917 ms 20916 KB Output is correct
4 Correct 915 ms 20820 KB Output is correct
5 Correct 956 ms 21240 KB Output is correct
6 Correct 912 ms 20992 KB Output is correct
7 Correct 912 ms 21072 KB Output is correct
8 Correct 943 ms 21060 KB Output is correct
9 Correct 917 ms 20936 KB Output is correct
10 Correct 917 ms 20948 KB Output is correct
11 Correct 914 ms 21036 KB Output is correct
12 Correct 942 ms 20844 KB Output is correct
13 Correct 918 ms 20988 KB Output is correct
14 Correct 915 ms 20940 KB Output is correct
15 Correct 948 ms 20840 KB Output is correct
16 Correct 930 ms 20960 KB Output is correct
17 Correct 923 ms 21028 KB Output is correct
18 Correct 924 ms 21016 KB Output is correct
19 Correct 910 ms 20820 KB Output is correct
20 Correct 918 ms 21108 KB Output is correct
21 Correct 936 ms 20852 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 936 ms 20816 KB Output is correct
2 Correct 934 ms 20896 KB Output is correct
3 Correct 917 ms 20916 KB Output is correct
4 Correct 915 ms 20820 KB Output is correct
5 Correct 956 ms 21240 KB Output is correct
6 Correct 912 ms 20992 KB Output is correct
7 Correct 912 ms 21072 KB Output is correct
8 Correct 943 ms 21060 KB Output is correct
9 Correct 917 ms 20936 KB Output is correct
10 Correct 917 ms 20948 KB Output is correct
11 Correct 914 ms 21036 KB Output is correct
12 Correct 942 ms 20844 KB Output is correct
13 Correct 918 ms 20988 KB Output is correct
14 Correct 915 ms 20940 KB Output is correct
15 Correct 948 ms 20840 KB Output is correct
16 Correct 930 ms 20960 KB Output is correct
17 Correct 923 ms 21028 KB Output is correct
18 Correct 924 ms 21016 KB Output is correct
19 Correct 910 ms 20820 KB Output is correct
20 Correct 918 ms 21108 KB Output is correct
21 Correct 936 ms 20852 KB Output is correct
22 Correct 1000 ms 51536 KB Output is correct
23 Correct 1018 ms 51864 KB Output is correct
24 Correct 1012 ms 51548 KB Output is correct
25 Correct 1002 ms 51636 KB Output is correct
26 Correct 989 ms 51944 KB Output is correct
27 Correct 1012 ms 52104 KB Output is correct
28 Correct 999 ms 52048 KB Output is correct
29 Correct 1018 ms 51752 KB Output is correct
30 Correct 1008 ms 51976 KB Output is correct
31 Correct 1004 ms 51736 KB Output is correct
32 Correct 1031 ms 51628 KB Output is correct
33 Correct 985 ms 51728 KB Output is correct
34 Correct 1041 ms 52060 KB Output is correct
35 Correct 1077 ms 51576 KB Output is correct
36 Correct 1053 ms 51652 KB Output is correct
37 Correct 1039 ms 51708 KB Output is correct
38 Correct 996 ms 51868 KB Output is correct
39 Correct 1006 ms 51700 KB Output is correct
40 Correct 1030 ms 51724 KB Output is correct
41 Correct 1020 ms 51792 KB Output is correct
42 Correct 1012 ms 51544 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 936 ms 20816 KB Output is correct
2 Correct 934 ms 20896 KB Output is correct
3 Correct 917 ms 20916 KB Output is correct
4 Correct 915 ms 20820 KB Output is correct
5 Correct 956 ms 21240 KB Output is correct
6 Correct 912 ms 20992 KB Output is correct
7 Correct 912 ms 21072 KB Output is correct
8 Correct 943 ms 21060 KB Output is correct
9 Correct 917 ms 20936 KB Output is correct
10 Correct 917 ms 20948 KB Output is correct
11 Correct 914 ms 21036 KB Output is correct
12 Correct 942 ms 20844 KB Output is correct
13 Correct 918 ms 20988 KB Output is correct
14 Correct 915 ms 20940 KB Output is correct
15 Correct 948 ms 20840 KB Output is correct
16 Correct 930 ms 20960 KB Output is correct
17 Correct 923 ms 21028 KB Output is correct
18 Correct 924 ms 21016 KB Output is correct
19 Correct 910 ms 20820 KB Output is correct
20 Correct 918 ms 21108 KB Output is correct
21 Correct 936 ms 20852 KB Output is correct
22 Correct 1000 ms 51536 KB Output is correct
23 Correct 1018 ms 51864 KB Output is correct
24 Correct 1012 ms 51548 KB Output is correct
25 Correct 1002 ms 51636 KB Output is correct
26 Correct 989 ms 51944 KB Output is correct
27 Correct 1012 ms 52104 KB Output is correct
28 Correct 999 ms 52048 KB Output is correct
29 Correct 1018 ms 51752 KB Output is correct
30 Correct 1008 ms 51976 KB Output is correct
31 Correct 1004 ms 51736 KB Output is correct
32 Correct 1031 ms 51628 KB Output is correct
33 Correct 985 ms 51728 KB Output is correct
34 Correct 1041 ms 52060 KB Output is correct
35 Correct 1077 ms 51576 KB Output is correct
36 Correct 1053 ms 51652 KB Output is correct
37 Correct 1039 ms 51708 KB Output is correct
38 Correct 996 ms 51868 KB Output is correct
39 Correct 1006 ms 51700 KB Output is correct
40 Correct 1030 ms 51724 KB Output is correct
41 Correct 1020 ms 51792 KB Output is correct
42 Correct 1012 ms 51544 KB Output is correct
43 Execution timed out 1114 ms 104048 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 936 ms 20816 KB Output is correct
2 Correct 934 ms 20896 KB Output is correct
3 Correct 917 ms 20916 KB Output is correct
4 Correct 915 ms 20820 KB Output is correct
5 Correct 956 ms 21240 KB Output is correct
6 Correct 912 ms 20992 KB Output is correct
7 Correct 912 ms 21072 KB Output is correct
8 Correct 943 ms 21060 KB Output is correct
9 Correct 917 ms 20936 KB Output is correct
10 Correct 917 ms 20948 KB Output is correct
11 Correct 914 ms 21036 KB Output is correct
12 Correct 942 ms 20844 KB Output is correct
13 Correct 918 ms 20988 KB Output is correct
14 Correct 915 ms 20940 KB Output is correct
15 Correct 948 ms 20840 KB Output is correct
16 Correct 930 ms 20960 KB Output is correct
17 Correct 923 ms 21028 KB Output is correct
18 Correct 924 ms 21016 KB Output is correct
19 Correct 910 ms 20820 KB Output is correct
20 Correct 918 ms 21108 KB Output is correct
21 Correct 936 ms 20852 KB Output is correct
22 Correct 1000 ms 51536 KB Output is correct
23 Correct 1018 ms 51864 KB Output is correct
24 Correct 1012 ms 51548 KB Output is correct
25 Correct 1002 ms 51636 KB Output is correct
26 Correct 989 ms 51944 KB Output is correct
27 Correct 1012 ms 52104 KB Output is correct
28 Correct 999 ms 52048 KB Output is correct
29 Correct 1018 ms 51752 KB Output is correct
30 Correct 1008 ms 51976 KB Output is correct
31 Correct 1004 ms 51736 KB Output is correct
32 Correct 1031 ms 51628 KB Output is correct
33 Correct 985 ms 51728 KB Output is correct
34 Correct 1041 ms 52060 KB Output is correct
35 Correct 1077 ms 51576 KB Output is correct
36 Correct 1053 ms 51652 KB Output is correct
37 Correct 1039 ms 51708 KB Output is correct
38 Correct 996 ms 51868 KB Output is correct
39 Correct 1006 ms 51700 KB Output is correct
40 Correct 1030 ms 51724 KB Output is correct
41 Correct 1020 ms 51792 KB Output is correct
42 Correct 1012 ms 51544 KB Output is correct
43 Execution timed out 1114 ms 104048 KB Time limit exceeded
44 Halted 0 ms 0 KB -