oj.uz

Submission #949554

# Submission time Handle Problem Language Result Execution time Memory
949554 2024-03-19T10:38:55 Z gaga999 Cubeword (CEOI19_cubeword) C++17
100 / 100
 886 ms 25232 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()
{
    int n;
    scanf("%d", &n);
    set<string> st[8][62][62];
    string s;
    char ss[15];
    for (int i = 0; i < n; i++)
    {
        scanf("%s", ss);
        int ln = strlen(ss);
        s = string(ss, ss + ln);
        for (char &c : s)
            c = gv(c);
        ok[ln -= 3] = 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;
                    }
                }
            }
        }
    }
    printf("%d\n", ans);
}

Compilation message

cubeword.cpp: In function 'int main()':
cubeword.cpp:139:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  139 |         st[ln][s.front()][s.back()].insert(s);
      |                ~~~~~~~^~
cubeword.cpp:139:33: warning: array subscript has type 'char' [-Wchar-subscripts]
  139 |         st[ln][s.front()][s.back()].insert(s);
      |                           ~~~~~~^~
cubeword.cpp:141:23: warning: array subscript has type 'char' [-Wchar-subscripts]
  141 |         st[ln][s.front()][s.back()].insert(s);
      |                ~~~~~~~^~
cubeword.cpp:141:33: warning: array subscript has type 'char' [-Wchar-subscripts]
  141 |         st[ln][s.front()][s.back()].insert(s);
      |                           ~~~~~~^~
cubeword.cpp:127:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  127 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
cubeword.cpp:133:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  133 |         scanf("%s", ss);
      |         ~~~~~^~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 16580 KB Output is correct
2 Correct 608 ms 16792 KB Output is correct
3 Correct 607 ms 16756 KB Output is correct
4 Correct 623 ms 16728 KB Output is correct
5 Correct 607 ms 16724 KB Output is correct
6 Correct 618 ms 17004 KB Output is correct
7 Correct 613 ms 16604 KB Output is correct
8 Correct 613 ms 16752 KB Output is correct
9 Correct 627 ms 16588 KB Output is correct
10 Correct 618 ms 16808 KB Output is correct
11 Correct 607 ms 16720 KB Output is correct
12 Correct 613 ms 16840 KB Output is correct
13 Correct 605 ms 16764 KB Output is correct
14 Correct 613 ms 16748 KB Output is correct
15 Correct 617 ms 16828 KB Output is correct
16 Correct 616 ms 16696 KB Output is correct
17 Correct 609 ms 16720 KB Output is correct
18 Correct 609 ms 16728 KB Output is correct
19 Correct 633 ms 16748 KB Output is correct
20 Correct 614 ms 16928 KB Output is correct
21 Correct 637 ms 16620 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 16580 KB Output is correct
2 Correct 608 ms 16792 KB Output is correct
3 Correct 607 ms 16756 KB Output is correct
4 Correct 623 ms 16728 KB Output is correct
5 Correct 607 ms 16724 KB Output is correct
6 Correct 618 ms 17004 KB Output is correct
7 Correct 613 ms 16604 KB Output is correct
8 Correct 613 ms 16752 KB Output is correct
9 Correct 627 ms 16588 KB Output is correct
10 Correct 618 ms 16808 KB Output is correct
11 Correct 607 ms 16720 KB Output is correct
12 Correct 613 ms 16840 KB Output is correct
13 Correct 605 ms 16764 KB Output is correct
14 Correct 613 ms 16748 KB Output is correct
15 Correct 617 ms 16828 KB Output is correct
16 Correct 616 ms 16696 KB Output is correct
17 Correct 609 ms 16720 KB Output is correct
18 Correct 609 ms 16728 KB Output is correct
19 Correct 633 ms 16748 KB Output is correct
20 Correct 614 ms 16928 KB Output is correct
21 Correct 637 ms 16620 KB Output is correct
22 Correct 614 ms 17988 KB Output is correct
23 Correct 616 ms 17880 KB Output is correct
24 Correct 601 ms 18108 KB Output is correct
25 Correct 611 ms 18004 KB Output is correct
26 Correct 599 ms 17848 KB Output is correct
27 Correct 604 ms 18220 KB Output is correct
28 Correct 607 ms 18252 KB Output is correct
29 Correct 608 ms 18096 KB Output is correct
30 Correct 614 ms 18004 KB Output is correct
31 Correct 609 ms 18000 KB Output is correct
32 Correct 614 ms 17972 KB Output is correct
33 Correct 599 ms 17972 KB Output is correct
34 Correct 602 ms 18092 KB Output is correct
35 Correct 606 ms 18180 KB Output is correct
36 Correct 611 ms 18084 KB Output is correct
37 Correct 606 ms 18000 KB Output is correct
38 Correct 600 ms 18004 KB Output is correct
39 Correct 603 ms 18000 KB Output is correct
40 Correct 613 ms 18004 KB Output is correct
41 Correct 602 ms 18260 KB Output is correct
42 Correct 600 ms 18104 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 16580 KB Output is correct
2 Correct 608 ms 16792 KB Output is correct
3 Correct 607 ms 16756 KB Output is correct
4 Correct 623 ms 16728 KB Output is correct
5 Correct 607 ms 16724 KB Output is correct
6 Correct 618 ms 17004 KB Output is correct
7 Correct 613 ms 16604 KB Output is correct
8 Correct 613 ms 16752 KB Output is correct
9 Correct 627 ms 16588 KB Output is correct
10 Correct 618 ms 16808 KB Output is correct
11 Correct 607 ms 16720 KB Output is correct
12 Correct 613 ms 16840 KB Output is correct
13 Correct 605 ms 16764 KB Output is correct
14 Correct 613 ms 16748 KB Output is correct
15 Correct 617 ms 16828 KB Output is correct
16 Correct 616 ms 16696 KB Output is correct
17 Correct 609 ms 16720 KB Output is correct
18 Correct 609 ms 16728 KB Output is correct
19 Correct 633 ms 16748 KB Output is correct
20 Correct 614 ms 16928 KB Output is correct
21 Correct 637 ms 16620 KB Output is correct
22 Correct 614 ms 17988 KB Output is correct
23 Correct 616 ms 17880 KB Output is correct
24 Correct 601 ms 18108 KB Output is correct
25 Correct 611 ms 18004 KB Output is correct
26 Correct 599 ms 17848 KB Output is correct
27 Correct 604 ms 18220 KB Output is correct
28 Correct 607 ms 18252 KB Output is correct
29 Correct 608 ms 18096 KB Output is correct
30 Correct 614 ms 18004 KB Output is correct
31 Correct 609 ms 18000 KB Output is correct
32 Correct 614 ms 17972 KB Output is correct
33 Correct 599 ms 17972 KB Output is correct
34 Correct 602 ms 18092 KB Output is correct
35 Correct 606 ms 18180 KB Output is correct
36 Correct 611 ms 18084 KB Output is correct
37 Correct 606 ms 18000 KB Output is correct
38 Correct 600 ms 18004 KB Output is correct
39 Correct 603 ms 18000 KB Output is correct
40 Correct 613 ms 18004 KB Output is correct
41 Correct 602 ms 18260 KB Output is correct
42 Correct 600 ms 18104 KB Output is correct
43 Correct 630 ms 20744 KB Output is correct
44 Correct 625 ms 20988 KB Output is correct
45 Correct 626 ms 20820 KB Output is correct
46 Correct 627 ms 20960 KB Output is correct
47 Correct 633 ms 20816 KB Output is correct
48 Correct 635 ms 21112 KB Output is correct
49 Correct 632 ms 20900 KB Output is correct
50 Correct 627 ms 20928 KB Output is correct
51 Correct 631 ms 20876 KB Output is correct
52 Correct 639 ms 20728 KB Output is correct
53 Correct 640 ms 20968 KB Output is correct
54 Correct 632 ms 20972 KB Output is correct
55 Correct 626 ms 20760 KB Output is correct
56 Correct 637 ms 20860 KB Output is correct
57 Correct 629 ms 20912 KB Output is correct
58 Correct 635 ms 20820 KB Output is correct
59 Correct 626 ms 20960 KB Output is correct
60 Correct 633 ms 21048 KB Output is correct
61 Correct 631 ms 20756 KB Output is correct
62 Correct 630 ms 20764 KB Output is correct
63 Correct 635 ms 20872 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 16580 KB Output is correct
2 Correct 608 ms 16792 KB Output is correct
3 Correct 607 ms 16756 KB Output is correct
4 Correct 623 ms 16728 KB Output is correct
5 Correct 607 ms 16724 KB Output is correct
6 Correct 618 ms 17004 KB Output is correct
7 Correct 613 ms 16604 KB Output is correct
8 Correct 613 ms 16752 KB Output is correct
9 Correct 627 ms 16588 KB Output is correct
10 Correct 618 ms 16808 KB Output is correct
11 Correct 607 ms 16720 KB Output is correct
12 Correct 613 ms 16840 KB Output is correct
13 Correct 605 ms 16764 KB Output is correct
14 Correct 613 ms 16748 KB Output is correct
15 Correct 617 ms 16828 KB Output is correct
16 Correct 616 ms 16696 KB Output is correct
17 Correct 609 ms 16720 KB Output is correct
18 Correct 609 ms 16728 KB Output is correct
19 Correct 633 ms 16748 KB Output is correct
20 Correct 614 ms 16928 KB Output is correct
21 Correct 637 ms 16620 KB Output is correct
22 Correct 614 ms 17988 KB Output is correct
23 Correct 616 ms 17880 KB Output is correct
24 Correct 601 ms 18108 KB Output is correct
25 Correct 611 ms 18004 KB Output is correct
26 Correct 599 ms 17848 KB Output is correct
27 Correct 604 ms 18220 KB Output is correct
28 Correct 607 ms 18252 KB Output is correct
29 Correct 608 ms 18096 KB Output is correct
30 Correct 614 ms 18004 KB Output is correct
31 Correct 609 ms 18000 KB Output is correct
32 Correct 614 ms 17972 KB Output is correct
33 Correct 599 ms 17972 KB Output is correct
34 Correct 602 ms 18092 KB Output is correct
35 Correct 606 ms 18180 KB Output is correct
36 Correct 611 ms 18084 KB Output is correct
37 Correct 606 ms 18000 KB Output is correct
38 Correct 600 ms 18004 KB Output is correct
39 Correct 603 ms 18000 KB Output is correct
40 Correct 613 ms 18004 KB Output is correct
41 Correct 602 ms 18260 KB Output is correct
42 Correct 600 ms 18104 KB Output is correct
43 Correct 630 ms 20744 KB Output is correct
44 Correct 625 ms 20988 KB Output is correct
45 Correct 626 ms 20820 KB Output is correct
46 Correct 627 ms 20960 KB Output is correct
47 Correct 633 ms 20816 KB Output is correct
48 Correct 635 ms 21112 KB Output is correct
49 Correct 632 ms 20900 KB Output is correct
50 Correct 627 ms 20928 KB Output is correct
51 Correct 631 ms 20876 KB Output is correct
52 Correct 639 ms 20728 KB Output is correct
53 Correct 640 ms 20968 KB Output is correct
54 Correct 632 ms 20972 KB Output is correct
55 Correct 626 ms 20760 KB Output is correct
56 Correct 637 ms 20860 KB Output is correct
57 Correct 629 ms 20912 KB Output is correct
58 Correct 635 ms 20820 KB Output is correct
59 Correct 626 ms 20960 KB Output is correct
60 Correct 633 ms 21048 KB Output is correct
61 Correct 631 ms 20756 KB Output is correct
62 Correct 630 ms 20764 KB Output is correct
63 Correct 635 ms 20872 KB Output is correct
64 Correct 863 ms 25232 KB Output is correct
65 Correct 868 ms 25168 KB Output is correct
66 Correct 874 ms 25172 KB Output is correct
67 Correct 868 ms 25172 KB Output is correct
68 Correct 868 ms 25036 KB Output is correct
69 Correct 859 ms 24920 KB Output is correct
70 Correct 864 ms 25172 KB Output is correct
71 Correct 873 ms 25052 KB Output is correct
72 Correct 863 ms 25120 KB Output is correct
73 Correct 872 ms 25028 KB Output is correct
74 Correct 866 ms 25016 KB Output is correct
75 Correct 867 ms 25012 KB Output is correct
76 Correct 864 ms 25204 KB Output is correct
77 Correct 865 ms 25176 KB Output is correct
78 Correct 866 ms 25064 KB Output is correct
79 Correct 881 ms 24916 KB Output is correct
80 Correct 868 ms 25172 KB Output is correct
81 Correct 886 ms 25152 KB Output is correct
82 Correct 865 ms 25168 KB Output is correct
83 Correct 861 ms 25052 KB Output is correct
84 Correct 871 ms 25052 KB Output is correct