oj.uz

Submission #949553

# Submission time Handle Problem Language Result Execution time Memory
949553 2024-03-19T10:37:16 Z gaga999 Cubeword (CEOI19_cubeword) C++17
100 / 100
 889 ms 25248 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[8][62][62], dp[8][62][62][62];
bool ok[8];

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

signed main()
{
    AC;
    int n;
    cin >> n;
    set<string> st[8][62][62];
    string s;
    for (int i = 0; i < n; i++)
    {
        cin >> s;
        int ln = s.length() - 3;
        for (char &c : s)
            c = gv(c);
        ok[ln] = 1;
        st[ln][s.front()][s.back()].insert(s);
        reverse(iter(s));
        st[ln][s.front()][s.back()].insert(s);
    }
    for (int l = 0; l < 8; l++)
        for (int i = 0; i < 62; i++)
            for (int j = 0; j < 62; j++)
                ct[l][i][j] = size(st[l][i][j]);
    int ans = 0;
    for (int l = 0; l < 8; 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;
                    }
                }
            }
        }
    }
    cout << ans << '\n';
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:138:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  138 |         st[ln][s.front()][s.back()].insert(s);
      |                ~~~~~~~^~
cubeword.cpp:138:33: warning: array subscript has type 'char' [-Wchar-subscripts]
  138 |         st[ln][s.front()][s.back()].insert(s);
      |                           ~~~~~~^~
cubeword.cpp:140:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  140 |         st[ln][s.front()][s.back()].insert(s);
      |                ~~~~~~~^~
cubeword.cpp:140:33: warning: array subscript has type 'char' [-Wchar-subscripts]
  140 |         st[ln][s.front()][s.back()].insert(s);
      |                           ~~~~~~^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 16784 KB Output is correct
2 Correct 602 ms 16532 KB Output is correct
3 Correct 605 ms 16768 KB Output is correct
4 Correct 601 ms 16800 KB Output is correct
5 Correct 602 ms 16620 KB Output is correct
6 Correct 602 ms 16584 KB Output is correct
7 Correct 601 ms 16856 KB Output is correct
8 Correct 609 ms 16992 KB Output is correct
9 Correct 596 ms 16760 KB Output is correct
10 Correct 596 ms 16736 KB Output is correct
11 Correct 602 ms 16772 KB Output is correct
12 Correct 604 ms 16980 KB Output is correct
13 Correct 608 ms 16888 KB Output is correct
14 Correct 597 ms 16660 KB Output is correct
15 Correct 602 ms 16724 KB Output is correct
16 Correct 606 ms 16980 KB Output is correct
17 Correct 598 ms 16768 KB Output is correct
18 Correct 612 ms 16608 KB Output is correct
19 Correct 603 ms 16536 KB Output is correct
20 Correct 613 ms 16772 KB Output is correct
21 Correct 601 ms 16720 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 16784 KB Output is correct
2 Correct 602 ms 16532 KB Output is correct
3 Correct 605 ms 16768 KB Output is correct
4 Correct 601 ms 16800 KB Output is correct
5 Correct 602 ms 16620 KB Output is correct
6 Correct 602 ms 16584 KB Output is correct
7 Correct 601 ms 16856 KB Output is correct
8 Correct 609 ms 16992 KB Output is correct
9 Correct 596 ms 16760 KB Output is correct
10 Correct 596 ms 16736 KB Output is correct
11 Correct 602 ms 16772 KB Output is correct
12 Correct 604 ms 16980 KB Output is correct
13 Correct 608 ms 16888 KB Output is correct
14 Correct 597 ms 16660 KB Output is correct
15 Correct 602 ms 16724 KB Output is correct
16 Correct 606 ms 16980 KB Output is correct
17 Correct 598 ms 16768 KB Output is correct
18 Correct 612 ms 16608 KB Output is correct
19 Correct 603 ms 16536 KB Output is correct
20 Correct 613 ms 16772 KB Output is correct
21 Correct 601 ms 16720 KB Output is correct
22 Correct 609 ms 17908 KB Output is correct
23 Correct 602 ms 18028 KB Output is correct
24 Correct 602 ms 18000 KB Output is correct
25 Correct 608 ms 18008 KB Output is correct
26 Correct 597 ms 18108 KB Output is correct
27 Correct 604 ms 17856 KB Output is correct
28 Correct 605 ms 18124 KB Output is correct
29 Correct 595 ms 17884 KB Output is correct
30 Correct 597 ms 17900 KB Output is correct
31 Correct 600 ms 17884 KB Output is correct
32 Correct 605 ms 18144 KB Output is correct
33 Correct 602 ms 18004 KB Output is correct
34 Correct 601 ms 18028 KB Output is correct
35 Correct 600 ms 18004 KB Output is correct
36 Correct 604 ms 18132 KB Output is correct
37 Correct 601 ms 18124 KB Output is correct
38 Correct 601 ms 17876 KB Output is correct
39 Correct 599 ms 18368 KB Output is correct
40 Correct 605 ms 18000 KB Output is correct
41 Correct 594 ms 18004 KB Output is correct
42 Correct 605 ms 17976 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 16784 KB Output is correct
2 Correct 602 ms 16532 KB Output is correct
3 Correct 605 ms 16768 KB Output is correct
4 Correct 601 ms 16800 KB Output is correct
5 Correct 602 ms 16620 KB Output is correct
6 Correct 602 ms 16584 KB Output is correct
7 Correct 601 ms 16856 KB Output is correct
8 Correct 609 ms 16992 KB Output is correct
9 Correct 596 ms 16760 KB Output is correct
10 Correct 596 ms 16736 KB Output is correct
11 Correct 602 ms 16772 KB Output is correct
12 Correct 604 ms 16980 KB Output is correct
13 Correct 608 ms 16888 KB Output is correct
14 Correct 597 ms 16660 KB Output is correct
15 Correct 602 ms 16724 KB Output is correct
16 Correct 606 ms 16980 KB Output is correct
17 Correct 598 ms 16768 KB Output is correct
18 Correct 612 ms 16608 KB Output is correct
19 Correct 603 ms 16536 KB Output is correct
20 Correct 613 ms 16772 KB Output is correct
21 Correct 601 ms 16720 KB Output is correct
22 Correct 609 ms 17908 KB Output is correct
23 Correct 602 ms 18028 KB Output is correct
24 Correct 602 ms 18000 KB Output is correct
25 Correct 608 ms 18008 KB Output is correct
26 Correct 597 ms 18108 KB Output is correct
27 Correct 604 ms 17856 KB Output is correct
28 Correct 605 ms 18124 KB Output is correct
29 Correct 595 ms 17884 KB Output is correct
30 Correct 597 ms 17900 KB Output is correct
31 Correct 600 ms 17884 KB Output is correct
32 Correct 605 ms 18144 KB Output is correct
33 Correct 602 ms 18004 KB Output is correct
34 Correct 601 ms 18028 KB Output is correct
35 Correct 600 ms 18004 KB Output is correct
36 Correct 604 ms 18132 KB Output is correct
37 Correct 601 ms 18124 KB Output is correct
38 Correct 601 ms 17876 KB Output is correct
39 Correct 599 ms 18368 KB Output is correct
40 Correct 605 ms 18000 KB Output is correct
41 Correct 594 ms 18004 KB Output is correct
42 Correct 605 ms 17976 KB Output is correct
43 Correct 628 ms 20820 KB Output is correct
44 Correct 626 ms 21076 KB Output is correct
45 Correct 630 ms 20816 KB Output is correct
46 Correct 635 ms 20956 KB Output is correct
47 Correct 625 ms 20816 KB Output is correct
48 Correct 631 ms 20980 KB Output is correct
49 Correct 630 ms 21000 KB Output is correct
50 Correct 627 ms 20816 KB Output is correct
51 Correct 629 ms 20812 KB Output is correct
52 Correct 628 ms 21016 KB Output is correct
53 Correct 626 ms 21076 KB Output is correct
54 Correct 624 ms 20992 KB Output is correct
55 Correct 626 ms 20788 KB Output is correct
56 Correct 634 ms 20784 KB Output is correct
57 Correct 645 ms 20820 KB Output is correct
58 Correct 619 ms 20820 KB Output is correct
59 Correct 633 ms 20752 KB Output is correct
60 Correct 626 ms 20816 KB Output is correct
61 Correct 627 ms 20820 KB Output is correct
62 Correct 636 ms 20832 KB Output is correct
63 Correct 633 ms 20988 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 601 ms 16784 KB Output is correct
2 Correct 602 ms 16532 KB Output is correct
3 Correct 605 ms 16768 KB Output is correct
4 Correct 601 ms 16800 KB Output is correct
5 Correct 602 ms 16620 KB Output is correct
6 Correct 602 ms 16584 KB Output is correct
7 Correct 601 ms 16856 KB Output is correct
8 Correct 609 ms 16992 KB Output is correct
9 Correct 596 ms 16760 KB Output is correct
10 Correct 596 ms 16736 KB Output is correct
11 Correct 602 ms 16772 KB Output is correct
12 Correct 604 ms 16980 KB Output is correct
13 Correct 608 ms 16888 KB Output is correct
14 Correct 597 ms 16660 KB Output is correct
15 Correct 602 ms 16724 KB Output is correct
16 Correct 606 ms 16980 KB Output is correct
17 Correct 598 ms 16768 KB Output is correct
18 Correct 612 ms 16608 KB Output is correct
19 Correct 603 ms 16536 KB Output is correct
20 Correct 613 ms 16772 KB Output is correct
21 Correct 601 ms 16720 KB Output is correct
22 Correct 609 ms 17908 KB Output is correct
23 Correct 602 ms 18028 KB Output is correct
24 Correct 602 ms 18000 KB Output is correct
25 Correct 608 ms 18008 KB Output is correct
26 Correct 597 ms 18108 KB Output is correct
27 Correct 604 ms 17856 KB Output is correct
28 Correct 605 ms 18124 KB Output is correct
29 Correct 595 ms 17884 KB Output is correct
30 Correct 597 ms 17900 KB Output is correct
31 Correct 600 ms 17884 KB Output is correct
32 Correct 605 ms 18144 KB Output is correct
33 Correct 602 ms 18004 KB Output is correct
34 Correct 601 ms 18028 KB Output is correct
35 Correct 600 ms 18004 KB Output is correct
36 Correct 604 ms 18132 KB Output is correct
37 Correct 601 ms 18124 KB Output is correct
38 Correct 601 ms 17876 KB Output is correct
39 Correct 599 ms 18368 KB Output is correct
40 Correct 605 ms 18000 KB Output is correct
41 Correct 594 ms 18004 KB Output is correct
42 Correct 605 ms 17976 KB Output is correct
43 Correct 628 ms 20820 KB Output is correct
44 Correct 626 ms 21076 KB Output is correct
45 Correct 630 ms 20816 KB Output is correct
46 Correct 635 ms 20956 KB Output is correct
47 Correct 625 ms 20816 KB Output is correct
48 Correct 631 ms 20980 KB Output is correct
49 Correct 630 ms 21000 KB Output is correct
50 Correct 627 ms 20816 KB Output is correct
51 Correct 629 ms 20812 KB Output is correct
52 Correct 628 ms 21016 KB Output is correct
53 Correct 626 ms 21076 KB Output is correct
54 Correct 624 ms 20992 KB Output is correct
55 Correct 626 ms 20788 KB Output is correct
56 Correct 634 ms 20784 KB Output is correct
57 Correct 645 ms 20820 KB Output is correct
58 Correct 619 ms 20820 KB Output is correct
59 Correct 633 ms 20752 KB Output is correct
60 Correct 626 ms 20816 KB Output is correct
61 Correct 627 ms 20820 KB Output is correct
62 Correct 636 ms 20832 KB Output is correct
63 Correct 633 ms 20988 KB Output is correct
64 Correct 879 ms 24976 KB Output is correct
65 Correct 856 ms 24916 KB Output is correct
66 Correct 856 ms 24908 KB Output is correct
67 Correct 853 ms 24996 KB Output is correct
68 Correct 864 ms 24912 KB Output is correct
69 Correct 863 ms 24840 KB Output is correct
70 Correct 857 ms 25040 KB Output is correct
71 Correct 864 ms 24916 KB Output is correct
72 Correct 874 ms 24912 KB Output is correct
73 Correct 856 ms 24828 KB Output is correct
74 Correct 860 ms 24916 KB Output is correct
75 Correct 857 ms 24844 KB Output is correct
76 Correct 857 ms 24912 KB Output is correct
77 Correct 858 ms 24924 KB Output is correct
78 Correct 865 ms 25168 KB Output is correct
79 Correct 861 ms 25180 KB Output is correct
80 Correct 889 ms 25168 KB Output is correct
81 Correct 860 ms 25172 KB Output is correct
82 Correct 878 ms 25248 KB Output is correct
83 Correct 865 ms 25056 KB Output is correct
84 Correct 871 ms 25172 KB Output is correct