oj.uz

Submission #949531

# Submission time Handle Problem Language Result Execution time Memory
949531 2024-03-19T10:20:21 Z gaga999 Cubeword (CEOI19_cubeword) C++17
84 / 100
 1100 ms 213992 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 * dp[l][i][c][a] % M * dp[l][i][c][b] + ans) % 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

# Verdict Execution time Memory Grader output
1 Correct 625 ms 13228 KB Output is correct
2 Correct 628 ms 13256 KB Output is correct
3 Correct 596 ms 13088 KB Output is correct
4 Correct 656 ms 13228 KB Output is correct
5 Correct 628 ms 13256 KB Output is correct
6 Correct 593 ms 13248 KB Output is correct
7 Correct 593 ms 13212 KB Output is correct
8 Correct 606 ms 13236 KB Output is correct
9 Correct 631 ms 13048 KB Output is correct
10 Correct 611 ms 13420 KB Output is correct
11 Correct 600 ms 13252 KB Output is correct
12 Correct 630 ms 13240 KB Output is correct
13 Correct 597 ms 13076 KB Output is correct
14 Correct 605 ms 13220 KB Output is correct
15 Correct 598 ms 13204 KB Output is correct
16 Correct 591 ms 13152 KB Output is correct
17 Correct 598 ms 13128 KB Output is correct
18 Correct 600 ms 13140 KB Output is correct
19 Correct 585 ms 13224 KB Output is correct
20 Correct 585 ms 13136 KB Output is correct
21 Correct 592 ms 13172 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 13228 KB Output is correct
2 Correct 628 ms 13256 KB Output is correct
3 Correct 596 ms 13088 KB Output is correct
4 Correct 656 ms 13228 KB Output is correct
5 Correct 628 ms 13256 KB Output is correct
6 Correct 593 ms 13248 KB Output is correct
7 Correct 593 ms 13212 KB Output is correct
8 Correct 606 ms 13236 KB Output is correct
9 Correct 631 ms 13048 KB Output is correct
10 Correct 611 ms 13420 KB Output is correct
11 Correct 600 ms 13252 KB Output is correct
12 Correct 630 ms 13240 KB Output is correct
13 Correct 597 ms 13076 KB Output is correct
14 Correct 605 ms 13220 KB Output is correct
15 Correct 598 ms 13204 KB Output is correct
16 Correct 591 ms 13152 KB Output is correct
17 Correct 598 ms 13128 KB Output is correct
18 Correct 600 ms 13140 KB Output is correct
19 Correct 585 ms 13224 KB Output is correct
20 Correct 585 ms 13136 KB Output is correct
21 Correct 592 ms 13172 KB Output is correct
22 Correct 686 ms 44612 KB Output is correct
23 Correct 666 ms 44648 KB Output is correct
24 Correct 663 ms 44240 KB Output is correct
25 Correct 687 ms 44396 KB Output is correct
26 Correct 669 ms 44552 KB Output is correct
27 Correct 670 ms 44608 KB Output is correct
28 Correct 675 ms 44588 KB Output is correct
29 Correct 664 ms 44368 KB Output is correct
30 Correct 664 ms 44600 KB Output is correct
31 Correct 672 ms 44244 KB Output is correct
32 Correct 669 ms 44728 KB Output is correct
33 Correct 672 ms 44580 KB Output is correct
34 Correct 663 ms 44624 KB Output is correct
35 Correct 669 ms 44372 KB Output is correct
36 Correct 691 ms 44784 KB Output is correct
37 Correct 700 ms 44484 KB Output is correct
38 Correct 704 ms 44612 KB Output is correct
39 Correct 681 ms 44364 KB Output is correct
40 Correct 704 ms 44580 KB Output is correct
41 Correct 687 ms 44652 KB Output is correct
42 Correct 672 ms 44376 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 13228 KB Output is correct
2 Correct 628 ms 13256 KB Output is correct
3 Correct 596 ms 13088 KB Output is correct
4 Correct 656 ms 13228 KB Output is correct
5 Correct 628 ms 13256 KB Output is correct
6 Correct 593 ms 13248 KB Output is correct
7 Correct 593 ms 13212 KB Output is correct
8 Correct 606 ms 13236 KB Output is correct
9 Correct 631 ms 13048 KB Output is correct
10 Correct 611 ms 13420 KB Output is correct
11 Correct 600 ms 13252 KB Output is correct
12 Correct 630 ms 13240 KB Output is correct
13 Correct 597 ms 13076 KB Output is correct
14 Correct 605 ms 13220 KB Output is correct
15 Correct 598 ms 13204 KB Output is correct
16 Correct 591 ms 13152 KB Output is correct
17 Correct 598 ms 13128 KB Output is correct
18 Correct 600 ms 13140 KB Output is correct
19 Correct 585 ms 13224 KB Output is correct
20 Correct 585 ms 13136 KB Output is correct
21 Correct 592 ms 13172 KB Output is correct
22 Correct 686 ms 44612 KB Output is correct
23 Correct 666 ms 44648 KB Output is correct
24 Correct 663 ms 44240 KB Output is correct
25 Correct 687 ms 44396 KB Output is correct
26 Correct 669 ms 44552 KB Output is correct
27 Correct 670 ms 44608 KB Output is correct
28 Correct 675 ms 44588 KB Output is correct
29 Correct 664 ms 44368 KB Output is correct
30 Correct 664 ms 44600 KB Output is correct
31 Correct 672 ms 44244 KB Output is correct
32 Correct 669 ms 44728 KB Output is correct
33 Correct 672 ms 44580 KB Output is correct
34 Correct 663 ms 44624 KB Output is correct
35 Correct 669 ms 44372 KB Output is correct
36 Correct 691 ms 44784 KB Output is correct
37 Correct 700 ms 44484 KB Output is correct
38 Correct 704 ms 44612 KB Output is correct
39 Correct 681 ms 44364 KB Output is correct
40 Correct 704 ms 44580 KB Output is correct
41 Correct 687 ms 44652 KB Output is correct
42 Correct 672 ms 44376 KB Output is correct
43 Correct 782 ms 99436 KB Output is correct
44 Correct 792 ms 99416 KB Output is correct
45 Correct 774 ms 99456 KB Output is correct
46 Correct 775 ms 99592 KB Output is correct
47 Correct 810 ms 98812 KB Output is correct
48 Correct 813 ms 98640 KB Output is correct
49 Correct 773 ms 98636 KB Output is correct
50 Correct 805 ms 98896 KB Output is correct
51 Correct 778 ms 98640 KB Output is correct
52 Correct 784 ms 98804 KB Output is correct
53 Correct 788 ms 98964 KB Output is correct
54 Correct 790 ms 99016 KB Output is correct
55 Correct 773 ms 98640 KB Output is correct
56 Correct 778 ms 99072 KB Output is correct
57 Correct 789 ms 98644 KB Output is correct
58 Correct 779 ms 98896 KB Output is correct
59 Correct 779 ms 98756 KB Output is correct
60 Correct 776 ms 98848 KB Output is correct
61 Correct 783 ms 98732 KB Output is correct
62 Correct 776 ms 98644 KB Output is correct
63 Correct 776 ms 98424 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 13228 KB Output is correct
2 Correct 628 ms 13256 KB Output is correct
3 Correct 596 ms 13088 KB Output is correct
4 Correct 656 ms 13228 KB Output is correct
5 Correct 628 ms 13256 KB Output is correct
6 Correct 593 ms 13248 KB Output is correct
7 Correct 593 ms 13212 KB Output is correct
8 Correct 606 ms 13236 KB Output is correct
9 Correct 631 ms 13048 KB Output is correct
10 Correct 611 ms 13420 KB Output is correct
11 Correct 600 ms 13252 KB Output is correct
12 Correct 630 ms 13240 KB Output is correct
13 Correct 597 ms 13076 KB Output is correct
14 Correct 605 ms 13220 KB Output is correct
15 Correct 598 ms 13204 KB Output is correct
16 Correct 591 ms 13152 KB Output is correct
17 Correct 598 ms 13128 KB Output is correct
18 Correct 600 ms 13140 KB Output is correct
19 Correct 585 ms 13224 KB Output is correct
20 Correct 585 ms 13136 KB Output is correct
21 Correct 592 ms 13172 KB Output is correct
22 Correct 686 ms 44612 KB Output is correct
23 Correct 666 ms 44648 KB Output is correct
24 Correct 663 ms 44240 KB Output is correct
25 Correct 687 ms 44396 KB Output is correct
26 Correct 669 ms 44552 KB Output is correct
27 Correct 670 ms 44608 KB Output is correct
28 Correct 675 ms 44588 KB Output is correct
29 Correct 664 ms 44368 KB Output is correct
30 Correct 664 ms 44600 KB Output is correct
31 Correct 672 ms 44244 KB Output is correct
32 Correct 669 ms 44728 KB Output is correct
33 Correct 672 ms 44580 KB Output is correct
34 Correct 663 ms 44624 KB Output is correct
35 Correct 669 ms 44372 KB Output is correct
36 Correct 691 ms 44784 KB Output is correct
37 Correct 700 ms 44484 KB Output is correct
38 Correct 704 ms 44612 KB Output is correct
39 Correct 681 ms 44364 KB Output is correct
40 Correct 704 ms 44580 KB Output is correct
41 Correct 687 ms 44652 KB Output is correct
42 Correct 672 ms 44376 KB Output is correct
43 Correct 782 ms 99436 KB Output is correct
44 Correct 792 ms 99416 KB Output is correct
45 Correct 774 ms 99456 KB Output is correct
46 Correct 775 ms 99592 KB Output is correct
47 Correct 810 ms 98812 KB Output is correct
48 Correct 813 ms 98640 KB Output is correct
49 Correct 773 ms 98636 KB Output is correct
50 Correct 805 ms 98896 KB Output is correct
51 Correct 778 ms 98640 KB Output is correct
52 Correct 784 ms 98804 KB Output is correct
53 Correct 788 ms 98964 KB Output is correct
54 Correct 790 ms 99016 KB Output is correct
55 Correct 773 ms 98640 KB Output is correct
56 Correct 778 ms 99072 KB Output is correct
57 Correct 789 ms 98644 KB Output is correct
58 Correct 779 ms 98896 KB Output is correct
59 Correct 779 ms 98756 KB Output is correct
60 Correct 776 ms 98848 KB Output is correct
61 Correct 783 ms 98732 KB Output is correct
62 Correct 776 ms 98644 KB Output is correct
63 Correct 776 ms 98424 KB Output is correct
64 Execution timed out 1147 ms 213992 KB Time limit exceeded
65 Halted 0 ms 0 KB -