oj.uz

답안 #949452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949452 2024-03-19T08:58:04 Z gaga999 Cubeword (CEOI19_cubeword) C++17
84 / 100
 1100 ms 214808 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;
}
const int N = 1e6 + 6;
char s[15], *p;
int tr[62][N], ctd;
bitset<N> ed;
bool ok[15];

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]++, ok[d] = 1;
            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++)
    {
        if (!ok[l])
            continue;
        for (int i = 0; i < 62; i++)
        {
            for (int a = 0; a < 62; a++)
            {
                if (!ct[l][i][a])
                    continue;
                for (int b = 0; b < 62; b++)
                {
                    if (!ct[l][i][b])
                        continue;
                    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:134:17: warning: array subscript has type 'char' [-Wchar-subscripts]
  134 |         if (!tr[*i][cr])
      |                 ^~
cubeword.cpp:135:16: warning: array subscript has type 'char' [-Wchar-subscripts]
  135 |             tr[*i][cr] = ++ctd;
      |                ^~
cubeword.cpp:136:17: warning: array subscript has type 'char' [-Wchar-subscripts]
  136 |         cr = tr[*i][cr];
      |                 ^~
cubeword.cpp: In function 'void dfs(int, int)':
cubeword.cpp:149:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  149 |                 ct[d][*p][i]++, ok[d] = 1;
      |                       ^~
cubeword.cpp: In function 'int main()':
cubeword.cpp:158:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  158 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
cubeword.cpp:161:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  161 |         scanf("%s", s);
      |         ~~~~~^~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 694 ms 13140 KB Output is correct
2 Correct 696 ms 13256 KB Output is correct
3 Correct 705 ms 13240 KB Output is correct
4 Correct 704 ms 13276 KB Output is correct
5 Correct 705 ms 13332 KB Output is correct
6 Correct 709 ms 13404 KB Output is correct
7 Correct 688 ms 13256 KB Output is correct
8 Correct 716 ms 13264 KB Output is correct
9 Correct 689 ms 13136 KB Output is correct
10 Correct 707 ms 13204 KB Output is correct
11 Correct 692 ms 13328 KB Output is correct
12 Correct 705 ms 13144 KB Output is correct
13 Correct 710 ms 13392 KB Output is correct
14 Correct 706 ms 13240 KB Output is correct
15 Correct 716 ms 13144 KB Output is correct
16 Correct 705 ms 13228 KB Output is correct
17 Correct 692 ms 13208 KB Output is correct
18 Correct 697 ms 13248 KB Output is correct
19 Correct 697 ms 13040 KB Output is correct
20 Correct 721 ms 13244 KB Output is correct
21 Correct 700 ms 13296 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 694 ms 13140 KB Output is correct
2 Correct 696 ms 13256 KB Output is correct
3 Correct 705 ms 13240 KB Output is correct
4 Correct 704 ms 13276 KB Output is correct
5 Correct 705 ms 13332 KB Output is correct
6 Correct 709 ms 13404 KB Output is correct
7 Correct 688 ms 13256 KB Output is correct
8 Correct 716 ms 13264 KB Output is correct
9 Correct 689 ms 13136 KB Output is correct
10 Correct 707 ms 13204 KB Output is correct
11 Correct 692 ms 13328 KB Output is correct
12 Correct 705 ms 13144 KB Output is correct
13 Correct 710 ms 13392 KB Output is correct
14 Correct 706 ms 13240 KB Output is correct
15 Correct 716 ms 13144 KB Output is correct
16 Correct 705 ms 13228 KB Output is correct
17 Correct 692 ms 13208 KB Output is correct
18 Correct 697 ms 13248 KB Output is correct
19 Correct 697 ms 13040 KB Output is correct
20 Correct 721 ms 13244 KB Output is correct
21 Correct 700 ms 13296 KB Output is correct
22 Correct 792 ms 44476 KB Output is correct
23 Correct 756 ms 44488 KB Output is correct
24 Correct 752 ms 44388 KB Output is correct
25 Correct 787 ms 44300 KB Output is correct
26 Correct 795 ms 44532 KB Output is correct
27 Correct 764 ms 44564 KB Output is correct
28 Correct 783 ms 44492 KB Output is correct
29 Correct 779 ms 44472 KB Output is correct
30 Correct 777 ms 44700 KB Output is correct
31 Correct 760 ms 44340 KB Output is correct
32 Correct 783 ms 44524 KB Output is correct
33 Correct 776 ms 44624 KB Output is correct
34 Correct 770 ms 44716 KB Output is correct
35 Correct 793 ms 44692 KB Output is correct
36 Correct 762 ms 44524 KB Output is correct
37 Correct 766 ms 44372 KB Output is correct
38 Correct 762 ms 44624 KB Output is correct
39 Correct 791 ms 44480 KB Output is correct
40 Correct 769 ms 44460 KB Output is correct
41 Correct 806 ms 44548 KB Output is correct
42 Correct 772 ms 44348 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 694 ms 13140 KB Output is correct
2 Correct 696 ms 13256 KB Output is correct
3 Correct 705 ms 13240 KB Output is correct
4 Correct 704 ms 13276 KB Output is correct
5 Correct 705 ms 13332 KB Output is correct
6 Correct 709 ms 13404 KB Output is correct
7 Correct 688 ms 13256 KB Output is correct
8 Correct 716 ms 13264 KB Output is correct
9 Correct 689 ms 13136 KB Output is correct
10 Correct 707 ms 13204 KB Output is correct
11 Correct 692 ms 13328 KB Output is correct
12 Correct 705 ms 13144 KB Output is correct
13 Correct 710 ms 13392 KB Output is correct
14 Correct 706 ms 13240 KB Output is correct
15 Correct 716 ms 13144 KB Output is correct
16 Correct 705 ms 13228 KB Output is correct
17 Correct 692 ms 13208 KB Output is correct
18 Correct 697 ms 13248 KB Output is correct
19 Correct 697 ms 13040 KB Output is correct
20 Correct 721 ms 13244 KB Output is correct
21 Correct 700 ms 13296 KB Output is correct
22 Correct 792 ms 44476 KB Output is correct
23 Correct 756 ms 44488 KB Output is correct
24 Correct 752 ms 44388 KB Output is correct
25 Correct 787 ms 44300 KB Output is correct
26 Correct 795 ms 44532 KB Output is correct
27 Correct 764 ms 44564 KB Output is correct
28 Correct 783 ms 44492 KB Output is correct
29 Correct 779 ms 44472 KB Output is correct
30 Correct 777 ms 44700 KB Output is correct
31 Correct 760 ms 44340 KB Output is correct
32 Correct 783 ms 44524 KB Output is correct
33 Correct 776 ms 44624 KB Output is correct
34 Correct 770 ms 44716 KB Output is correct
35 Correct 793 ms 44692 KB Output is correct
36 Correct 762 ms 44524 KB Output is correct
37 Correct 766 ms 44372 KB Output is correct
38 Correct 762 ms 44624 KB Output is correct
39 Correct 791 ms 44480 KB Output is correct
40 Correct 769 ms 44460 KB Output is correct
41 Correct 806 ms 44548 KB Output is correct
42 Correct 772 ms 44348 KB Output is correct
43 Correct 862 ms 99396 KB Output is correct
44 Correct 858 ms 99664 KB Output is correct
45 Correct 871 ms 99464 KB Output is correct
46 Correct 862 ms 99544 KB Output is correct
47 Correct 864 ms 99412 KB Output is correct
48 Correct 858 ms 99576 KB Output is correct
49 Correct 858 ms 99368 KB Output is correct
50 Correct 875 ms 99556 KB Output is correct
51 Correct 865 ms 99420 KB Output is correct
52 Correct 912 ms 99668 KB Output is correct
53 Correct 861 ms 99400 KB Output is correct
54 Correct 857 ms 99864 KB Output is correct
55 Correct 852 ms 99412 KB Output is correct
56 Correct 905 ms 99696 KB Output is correct
57 Correct 871 ms 99260 KB Output is correct
58 Correct 859 ms 99404 KB Output is correct
59 Correct 859 ms 99408 KB Output is correct
60 Correct 900 ms 99232 KB Output is correct
61 Correct 947 ms 99432 KB Output is correct
62 Correct 900 ms 99388 KB Output is correct
63 Correct 880 ms 99256 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 694 ms 13140 KB Output is correct
2 Correct 696 ms 13256 KB Output is correct
3 Correct 705 ms 13240 KB Output is correct
4 Correct 704 ms 13276 KB Output is correct
5 Correct 705 ms 13332 KB Output is correct
6 Correct 709 ms 13404 KB Output is correct
7 Correct 688 ms 13256 KB Output is correct
8 Correct 716 ms 13264 KB Output is correct
9 Correct 689 ms 13136 KB Output is correct
10 Correct 707 ms 13204 KB Output is correct
11 Correct 692 ms 13328 KB Output is correct
12 Correct 705 ms 13144 KB Output is correct
13 Correct 710 ms 13392 KB Output is correct
14 Correct 706 ms 13240 KB Output is correct
15 Correct 716 ms 13144 KB Output is correct
16 Correct 705 ms 13228 KB Output is correct
17 Correct 692 ms 13208 KB Output is correct
18 Correct 697 ms 13248 KB Output is correct
19 Correct 697 ms 13040 KB Output is correct
20 Correct 721 ms 13244 KB Output is correct
21 Correct 700 ms 13296 KB Output is correct
22 Correct 792 ms 44476 KB Output is correct
23 Correct 756 ms 44488 KB Output is correct
24 Correct 752 ms 44388 KB Output is correct
25 Correct 787 ms 44300 KB Output is correct
26 Correct 795 ms 44532 KB Output is correct
27 Correct 764 ms 44564 KB Output is correct
28 Correct 783 ms 44492 KB Output is correct
29 Correct 779 ms 44472 KB Output is correct
30 Correct 777 ms 44700 KB Output is correct
31 Correct 760 ms 44340 KB Output is correct
32 Correct 783 ms 44524 KB Output is correct
33 Correct 776 ms 44624 KB Output is correct
34 Correct 770 ms 44716 KB Output is correct
35 Correct 793 ms 44692 KB Output is correct
36 Correct 762 ms 44524 KB Output is correct
37 Correct 766 ms 44372 KB Output is correct
38 Correct 762 ms 44624 KB Output is correct
39 Correct 791 ms 44480 KB Output is correct
40 Correct 769 ms 44460 KB Output is correct
41 Correct 806 ms 44548 KB Output is correct
42 Correct 772 ms 44348 KB Output is correct
43 Correct 862 ms 99396 KB Output is correct
44 Correct 858 ms 99664 KB Output is correct
45 Correct 871 ms 99464 KB Output is correct
46 Correct 862 ms 99544 KB Output is correct
47 Correct 864 ms 99412 KB Output is correct
48 Correct 858 ms 99576 KB Output is correct
49 Correct 858 ms 99368 KB Output is correct
50 Correct 875 ms 99556 KB Output is correct
51 Correct 865 ms 99420 KB Output is correct
52 Correct 912 ms 99668 KB Output is correct
53 Correct 861 ms 99400 KB Output is correct
54 Correct 857 ms 99864 KB Output is correct
55 Correct 852 ms 99412 KB Output is correct
56 Correct 905 ms 99696 KB Output is correct
57 Correct 871 ms 99260 KB Output is correct
58 Correct 859 ms 99404 KB Output is correct
59 Correct 859 ms 99408 KB Output is correct
60 Correct 900 ms 99232 KB Output is correct
61 Correct 947 ms 99432 KB Output is correct
62 Correct 900 ms 99388 KB Output is correct
63 Correct 880 ms 99256 KB Output is correct
64 Execution timed out 1143 ms 214808 KB Time limit exceeded
65 Halted 0 ms 0 KB -