oj.uz

답안 #949536

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949536 2024-03-19T10:24:25 Z gaga999 Cubeword (CEOI19_cubeword) C++17
100 / 100
 938 ms 14960 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;
    vector<string> ar(n << 1);
    for (int i = 0; i < n; i++)
    {
        cin >> ar[i << 1];
        ar[i << 1 | 1] = string(riter(ar[i << 1]));
    }
    sort(iter(ar)), uni(ar);
    for (string &s : ar)
        ct[s.length() - 3][gv(s.front())][gv(s.back())]++, ok[s.length() - 3] = 1;
    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';
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 621 ms 7000 KB Output is correct
2 Correct 623 ms 6996 KB Output is correct
3 Correct 626 ms 7144 KB Output is correct
4 Correct 630 ms 6996 KB Output is correct
5 Correct 597 ms 6988 KB Output is correct
6 Correct 621 ms 6996 KB Output is correct
7 Correct 616 ms 6996 KB Output is correct
8 Correct 602 ms 7004 KB Output is correct
9 Correct 600 ms 7004 KB Output is correct
10 Correct 625 ms 6992 KB Output is correct
11 Correct 607 ms 6816 KB Output is correct
12 Correct 607 ms 6924 KB Output is correct
13 Correct 626 ms 7216 KB Output is correct
14 Correct 608 ms 6988 KB Output is correct
15 Correct 653 ms 6984 KB Output is correct
16 Correct 595 ms 6992 KB Output is correct
17 Correct 594 ms 6972 KB Output is correct
18 Correct 587 ms 6812 KB Output is correct
19 Correct 587 ms 6992 KB Output is correct
20 Correct 626 ms 7000 KB Output is correct
21 Correct 617 ms 7008 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 621 ms 7000 KB Output is correct
2 Correct 623 ms 6996 KB Output is correct
3 Correct 626 ms 7144 KB Output is correct
4 Correct 630 ms 6996 KB Output is correct
5 Correct 597 ms 6988 KB Output is correct
6 Correct 621 ms 6996 KB Output is correct
7 Correct 616 ms 6996 KB Output is correct
8 Correct 602 ms 7004 KB Output is correct
9 Correct 600 ms 7004 KB Output is correct
10 Correct 625 ms 6992 KB Output is correct
11 Correct 607 ms 6816 KB Output is correct
12 Correct 607 ms 6924 KB Output is correct
13 Correct 626 ms 7216 KB Output is correct
14 Correct 608 ms 6988 KB Output is correct
15 Correct 653 ms 6984 KB Output is correct
16 Correct 595 ms 6992 KB Output is correct
17 Correct 594 ms 6972 KB Output is correct
18 Correct 587 ms 6812 KB Output is correct
19 Correct 587 ms 6992 KB Output is correct
20 Correct 626 ms 7000 KB Output is correct
21 Correct 617 ms 7008 KB Output is correct
22 Correct 611 ms 7648 KB Output is correct
23 Correct 616 ms 7636 KB Output is correct
24 Correct 625 ms 7544 KB Output is correct
25 Correct 640 ms 7524 KB Output is correct
26 Correct 599 ms 7520 KB Output is correct
27 Correct 629 ms 7632 KB Output is correct
28 Correct 603 ms 7612 KB Output is correct
29 Correct 594 ms 7756 KB Output is correct
30 Correct 628 ms 7504 KB Output is correct
31 Correct 588 ms 7520 KB Output is correct
32 Correct 617 ms 7664 KB Output is correct
33 Correct 617 ms 7636 KB Output is correct
34 Correct 601 ms 7648 KB Output is correct
35 Correct 584 ms 7504 KB Output is correct
36 Correct 619 ms 7516 KB Output is correct
37 Correct 623 ms 7632 KB Output is correct
38 Correct 594 ms 7512 KB Output is correct
39 Correct 617 ms 7676 KB Output is correct
40 Correct 600 ms 7664 KB Output is correct
41 Correct 624 ms 7640 KB Output is correct
42 Correct 608 ms 7740 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 621 ms 7000 KB Output is correct
2 Correct 623 ms 6996 KB Output is correct
3 Correct 626 ms 7144 KB Output is correct
4 Correct 630 ms 6996 KB Output is correct
5 Correct 597 ms 6988 KB Output is correct
6 Correct 621 ms 6996 KB Output is correct
7 Correct 616 ms 6996 KB Output is correct
8 Correct 602 ms 7004 KB Output is correct
9 Correct 600 ms 7004 KB Output is correct
10 Correct 625 ms 6992 KB Output is correct
11 Correct 607 ms 6816 KB Output is correct
12 Correct 607 ms 6924 KB Output is correct
13 Correct 626 ms 7216 KB Output is correct
14 Correct 608 ms 6988 KB Output is correct
15 Correct 653 ms 6984 KB Output is correct
16 Correct 595 ms 6992 KB Output is correct
17 Correct 594 ms 6972 KB Output is correct
18 Correct 587 ms 6812 KB Output is correct
19 Correct 587 ms 6992 KB Output is correct
20 Correct 626 ms 7000 KB Output is correct
21 Correct 617 ms 7008 KB Output is correct
22 Correct 611 ms 7648 KB Output is correct
23 Correct 616 ms 7636 KB Output is correct
24 Correct 625 ms 7544 KB Output is correct
25 Correct 640 ms 7524 KB Output is correct
26 Correct 599 ms 7520 KB Output is correct
27 Correct 629 ms 7632 KB Output is correct
28 Correct 603 ms 7612 KB Output is correct
29 Correct 594 ms 7756 KB Output is correct
30 Correct 628 ms 7504 KB Output is correct
31 Correct 588 ms 7520 KB Output is correct
32 Correct 617 ms 7664 KB Output is correct
33 Correct 617 ms 7636 KB Output is correct
34 Correct 601 ms 7648 KB Output is correct
35 Correct 584 ms 7504 KB Output is correct
36 Correct 619 ms 7516 KB Output is correct
37 Correct 623 ms 7632 KB Output is correct
38 Correct 594 ms 7512 KB Output is correct
39 Correct 617 ms 7676 KB Output is correct
40 Correct 600 ms 7664 KB Output is correct
41 Correct 624 ms 7640 KB Output is correct
42 Correct 608 ms 7740 KB Output is correct
43 Correct 632 ms 10312 KB Output is correct
44 Correct 657 ms 10284 KB Output is correct
45 Correct 652 ms 10256 KB Output is correct
46 Correct 632 ms 10304 KB Output is correct
47 Correct 642 ms 10352 KB Output is correct
48 Correct 646 ms 10580 KB Output is correct
49 Correct 647 ms 10260 KB Output is correct
50 Correct 667 ms 10264 KB Output is correct
51 Correct 627 ms 10260 KB Output is correct
52 Correct 633 ms 10256 KB Output is correct
53 Correct 634 ms 10316 KB Output is correct
54 Correct 639 ms 10580 KB Output is correct
55 Correct 632 ms 10260 KB Output is correct
56 Correct 624 ms 10324 KB Output is correct
57 Correct 629 ms 10348 KB Output is correct
58 Correct 640 ms 10316 KB Output is correct
59 Correct 642 ms 10256 KB Output is correct
60 Correct 644 ms 10264 KB Output is correct
61 Correct 631 ms 10312 KB Output is correct
62 Correct 656 ms 10256 KB Output is correct
63 Correct 673 ms 10256 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 621 ms 7000 KB Output is correct
2 Correct 623 ms 6996 KB Output is correct
3 Correct 626 ms 7144 KB Output is correct
4 Correct 630 ms 6996 KB Output is correct
5 Correct 597 ms 6988 KB Output is correct
6 Correct 621 ms 6996 KB Output is correct
7 Correct 616 ms 6996 KB Output is correct
8 Correct 602 ms 7004 KB Output is correct
9 Correct 600 ms 7004 KB Output is correct
10 Correct 625 ms 6992 KB Output is correct
11 Correct 607 ms 6816 KB Output is correct
12 Correct 607 ms 6924 KB Output is correct
13 Correct 626 ms 7216 KB Output is correct
14 Correct 608 ms 6988 KB Output is correct
15 Correct 653 ms 6984 KB Output is correct
16 Correct 595 ms 6992 KB Output is correct
17 Correct 594 ms 6972 KB Output is correct
18 Correct 587 ms 6812 KB Output is correct
19 Correct 587 ms 6992 KB Output is correct
20 Correct 626 ms 7000 KB Output is correct
21 Correct 617 ms 7008 KB Output is correct
22 Correct 611 ms 7648 KB Output is correct
23 Correct 616 ms 7636 KB Output is correct
24 Correct 625 ms 7544 KB Output is correct
25 Correct 640 ms 7524 KB Output is correct
26 Correct 599 ms 7520 KB Output is correct
27 Correct 629 ms 7632 KB Output is correct
28 Correct 603 ms 7612 KB Output is correct
29 Correct 594 ms 7756 KB Output is correct
30 Correct 628 ms 7504 KB Output is correct
31 Correct 588 ms 7520 KB Output is correct
32 Correct 617 ms 7664 KB Output is correct
33 Correct 617 ms 7636 KB Output is correct
34 Correct 601 ms 7648 KB Output is correct
35 Correct 584 ms 7504 KB Output is correct
36 Correct 619 ms 7516 KB Output is correct
37 Correct 623 ms 7632 KB Output is correct
38 Correct 594 ms 7512 KB Output is correct
39 Correct 617 ms 7676 KB Output is correct
40 Correct 600 ms 7664 KB Output is correct
41 Correct 624 ms 7640 KB Output is correct
42 Correct 608 ms 7740 KB Output is correct
43 Correct 632 ms 10312 KB Output is correct
44 Correct 657 ms 10284 KB Output is correct
45 Correct 652 ms 10256 KB Output is correct
46 Correct 632 ms 10304 KB Output is correct
47 Correct 642 ms 10352 KB Output is correct
48 Correct 646 ms 10580 KB Output is correct
49 Correct 647 ms 10260 KB Output is correct
50 Correct 667 ms 10264 KB Output is correct
51 Correct 627 ms 10260 KB Output is correct
52 Correct 633 ms 10256 KB Output is correct
53 Correct 634 ms 10316 KB Output is correct
54 Correct 639 ms 10580 KB Output is correct
55 Correct 632 ms 10260 KB Output is correct
56 Correct 624 ms 10324 KB Output is correct
57 Correct 629 ms 10348 KB Output is correct
58 Correct 640 ms 10316 KB Output is correct
59 Correct 642 ms 10256 KB Output is correct
60 Correct 644 ms 10264 KB Output is correct
61 Correct 631 ms 10312 KB Output is correct
62 Correct 656 ms 10256 KB Output is correct
63 Correct 673 ms 10256 KB Output is correct
64 Correct 927 ms 14128 KB Output is correct
65 Correct 908 ms 14796 KB Output is correct
66 Correct 938 ms 14808 KB Output is correct
67 Correct 901 ms 14816 KB Output is correct
68 Correct 880 ms 14848 KB Output is correct
69 Correct 887 ms 14800 KB Output is correct
70 Correct 901 ms 14908 KB Output is correct
71 Correct 910 ms 14868 KB Output is correct
72 Correct 896 ms 14960 KB Output is correct
73 Correct 890 ms 14796 KB Output is correct
74 Correct 892 ms 14960 KB Output is correct
75 Correct 882 ms 14804 KB Output is correct
76 Correct 902 ms 14800 KB Output is correct
77 Correct 893 ms 14800 KB Output is correct
78 Correct 876 ms 14844 KB Output is correct
79 Correct 883 ms 14796 KB Output is correct
80 Correct 907 ms 14932 KB Output is correct
81 Correct 916 ms 14872 KB Output is correct
82 Correct 905 ms 14800 KB Output is correct
83 Correct 907 ms 14872 KB Output is correct
84 Correct 909 ms 14868 KB Output is correct