oj.uz

답안 #703133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703133 2023-02-26T08:06:34 Z Cyanmond Cubeword (CEOI19_cubeword) C++17
84 / 100
 1100 ms 139712 KB 
#include <bits/stdc++.h>

using i64 = long long;
constexpr int L = 8;
constexpr i64 mod = 998244353;

/*
value of C
subtask 1 : 6
subtask 2 : 16
subtask 3 : 32
subtask 4 : 62
*/

int main() {
    int N;
    std::cin >> N;
    std::vector<std::string> words(N);
    for (auto &e : words) {
        std::cin >> e;
        auto b = e;
        std::reverse(b.begin(), b.end());
        if (e > b) {
            e = b;
        }
    }
    std::sort(words.begin(), words.end());
    words.erase(std::unique(words.begin(), words.end()), words.end());
    N = (int)words.size();

    std::vector<std::vector<int>> W(N);
    std::vector<char> chars;
    for (const auto &e : words) {
        for (const auto c : e) {
            chars.push_back(c);
        }
    }
    std::sort(chars.begin(), chars.end());
    chars.erase(std::unique(chars.begin(), chars.end()), chars.end());
    for (int i = 0; i < N; ++i) {
        for (const auto e : words[i]) {
            W[i].push_back((int)(std::lower_bound(chars.begin(), chars.end(), e) - chars.begin()));
        }
    }
    const int C = chars.size();
    std::array<std::vector<std::vector<i64>>, L> U;
    for (auto &vec : U) {
        vec.resize(C);
        for (auto &vec2 : vec) {
            vec2.assign(C, 0);
        }
    }
    for (int i = 0; i < N; ++i) {
        const int a = (int)W[i].size();
        ++U[a - 3][W[i][0]][W[i][a - 1]];
        auto w2 = W[i];
        std::reverse(w2.begin(), w2.end());
        if (W[i] != w2) {
            ++U[a - 3][w2[0]][w2[a - 1]];
        }
    }

    auto solve = [&](std::vector<std::vector<i64>> V) -> i64 {
        // C^8
        std::vector memo(C, std::vector(C, std::vector(C, std::vector(C, -1ll))));

        auto calc = [&](const std::array<int, 4> &cList) -> i64 {
            i64 ret = 1;
            for (int x = 0; x < 4; ++x) {
                i64 s = 0;
                for (int i = 0; i < C; ++i) {
                    i64 c = 1;
                    for (int j = 0; j < 4; ++j) {
                        if (x != j) c *= V[cList[j]][i];
                    }
                    s += c;
                    s %= mod;
                }
                ret *= s;
                ret %= mod;
            }
            return memo[cList[0]][cList[1]][cList[2]][cList[3]] = ret;
        };
        i64 res = 0;
        for (int a = 0; a < C; ++a) {
            for (int b = 0; b < C; ++b) {
                for (int c = 0; c < C; ++c) {
                    for (int d = 0; d < C; ++d) {
                        std::array<int, 4> list = {{a, b, c, d}};
                        std::sort(list.begin(), list.end());
                        if (memo[list[0]][list[1]][list[2]][list[3]] != -1) {
                            res += memo[list[0]][list[1]][list[2]][list[3]];
                        } else {
                            res += calc(list);
                        }
                        res %= mod;
                    }
                }
            }
        }
        return res;
    };
    i64 answer = 0;
    for (const auto &e : U) {
        answer += solve(e);
        answer %= mod;
    }
    std::cout << answer << std::endl;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11856 KB Output is correct
2 Correct 105 ms 11876 KB Output is correct
3 Correct 103 ms 11872 KB Output is correct
4 Correct 102 ms 11868 KB Output is correct
5 Correct 103 ms 11996 KB Output is correct
6 Correct 103 ms 11784 KB Output is correct
7 Correct 107 ms 11844 KB Output is correct
8 Correct 102 ms 11836 KB Output is correct
9 Correct 101 ms 11856 KB Output is correct
10 Correct 103 ms 11932 KB Output is correct
11 Correct 113 ms 11840 KB Output is correct
12 Correct 104 ms 11856 KB Output is correct
13 Correct 104 ms 11840 KB Output is correct
14 Correct 104 ms 11840 KB Output is correct
15 Correct 105 ms 11864 KB Output is correct
16 Correct 102 ms 11840 KB Output is correct
17 Correct 102 ms 11836 KB Output is correct
18 Correct 106 ms 11868 KB Output is correct
19 Correct 103 ms 11788 KB Output is correct
20 Correct 104 ms 11852 KB Output is correct
21 Correct 106 ms 11832 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11856 KB Output is correct
2 Correct 105 ms 11876 KB Output is correct
3 Correct 103 ms 11872 KB Output is correct
4 Correct 102 ms 11868 KB Output is correct
5 Correct 103 ms 11996 KB Output is correct
6 Correct 103 ms 11784 KB Output is correct
7 Correct 107 ms 11844 KB Output is correct
8 Correct 102 ms 11836 KB Output is correct
9 Correct 101 ms 11856 KB Output is correct
10 Correct 103 ms 11932 KB Output is correct
11 Correct 113 ms 11840 KB Output is correct
12 Correct 104 ms 11856 KB Output is correct
13 Correct 104 ms 11840 KB Output is correct
14 Correct 104 ms 11840 KB Output is correct
15 Correct 105 ms 11864 KB Output is correct
16 Correct 102 ms 11840 KB Output is correct
17 Correct 102 ms 11836 KB Output is correct
18 Correct 106 ms 11868 KB Output is correct
19 Correct 103 ms 11788 KB Output is correct
20 Correct 104 ms 11852 KB Output is correct
21 Correct 106 ms 11832 KB Output is correct
22 Correct 130 ms 12340 KB Output is correct
23 Correct 127 ms 12248 KB Output is correct
24 Correct 125 ms 12244 KB Output is correct
25 Correct 127 ms 12260 KB Output is correct
26 Correct 128 ms 12336 KB Output is correct
27 Correct 129 ms 12252 KB Output is correct
28 Correct 127 ms 12252 KB Output is correct
29 Correct 129 ms 12252 KB Output is correct
30 Correct 131 ms 12372 KB Output is correct
31 Correct 127 ms 12272 KB Output is correct
32 Correct 126 ms 12240 KB Output is correct
33 Correct 131 ms 12248 KB Output is correct
34 Correct 125 ms 12348 KB Output is correct
35 Correct 124 ms 12224 KB Output is correct
36 Correct 127 ms 12256 KB Output is correct
37 Correct 127 ms 12224 KB Output is correct
38 Correct 126 ms 12256 KB Output is correct
39 Correct 126 ms 12396 KB Output is correct
40 Correct 125 ms 12256 KB Output is correct
41 Correct 128 ms 12224 KB Output is correct
42 Correct 127 ms 12256 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11856 KB Output is correct
2 Correct 105 ms 11876 KB Output is correct
3 Correct 103 ms 11872 KB Output is correct
4 Correct 102 ms 11868 KB Output is correct
5 Correct 103 ms 11996 KB Output is correct
6 Correct 103 ms 11784 KB Output is correct
7 Correct 107 ms 11844 KB Output is correct
8 Correct 102 ms 11836 KB Output is correct
9 Correct 101 ms 11856 KB Output is correct
10 Correct 103 ms 11932 KB Output is correct
11 Correct 113 ms 11840 KB Output is correct
12 Correct 104 ms 11856 KB Output is correct
13 Correct 104 ms 11840 KB Output is correct
14 Correct 104 ms 11840 KB Output is correct
15 Correct 105 ms 11864 KB Output is correct
16 Correct 102 ms 11840 KB Output is correct
17 Correct 102 ms 11836 KB Output is correct
18 Correct 106 ms 11868 KB Output is correct
19 Correct 103 ms 11788 KB Output is correct
20 Correct 104 ms 11852 KB Output is correct
21 Correct 106 ms 11832 KB Output is correct
22 Correct 130 ms 12340 KB Output is correct
23 Correct 127 ms 12248 KB Output is correct
24 Correct 125 ms 12244 KB Output is correct
25 Correct 127 ms 12260 KB Output is correct
26 Correct 128 ms 12336 KB Output is correct
27 Correct 129 ms 12252 KB Output is correct
28 Correct 127 ms 12252 KB Output is correct
29 Correct 129 ms 12252 KB Output is correct
30 Correct 131 ms 12372 KB Output is correct
31 Correct 127 ms 12272 KB Output is correct
32 Correct 126 ms 12240 KB Output is correct
33 Correct 131 ms 12248 KB Output is correct
34 Correct 125 ms 12348 KB Output is correct
35 Correct 124 ms 12224 KB Output is correct
36 Correct 127 ms 12256 KB Output is correct
37 Correct 127 ms 12224 KB Output is correct
38 Correct 126 ms 12256 KB Output is correct
39 Correct 126 ms 12396 KB Output is correct
40 Correct 125 ms 12256 KB Output is correct
41 Correct 128 ms 12224 KB Output is correct
42 Correct 127 ms 12256 KB Output is correct
43 Correct 557 ms 21416 KB Output is correct
44 Correct 558 ms 22168 KB Output is correct
45 Correct 558 ms 22136 KB Output is correct
46 Correct 556 ms 22140 KB Output is correct
47 Correct 557 ms 22196 KB Output is correct
48 Correct 557 ms 22208 KB Output is correct
49 Correct 554 ms 22128 KB Output is correct
50 Correct 551 ms 22128 KB Output is correct
51 Correct 561 ms 22192 KB Output is correct
52 Correct 566 ms 22120 KB Output is correct
53 Correct 551 ms 22120 KB Output is correct
54 Correct 554 ms 22200 KB Output is correct
55 Correct 553 ms 22136 KB Output is correct
56 Correct 554 ms 22228 KB Output is correct
57 Correct 554 ms 22344 KB Output is correct
58 Correct 564 ms 22156 KB Output is correct
59 Correct 552 ms 22180 KB Output is correct
60 Correct 555 ms 22288 KB Output is correct
61 Correct 553 ms 22176 KB Output is correct
62 Correct 548 ms 22204 KB Output is correct
63 Correct 563 ms 22392 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 11856 KB Output is correct
2 Correct 105 ms 11876 KB Output is correct
3 Correct 103 ms 11872 KB Output is correct
4 Correct 102 ms 11868 KB Output is correct
5 Correct 103 ms 11996 KB Output is correct
6 Correct 103 ms 11784 KB Output is correct
7 Correct 107 ms 11844 KB Output is correct
8 Correct 102 ms 11836 KB Output is correct
9 Correct 101 ms 11856 KB Output is correct
10 Correct 103 ms 11932 KB Output is correct
11 Correct 113 ms 11840 KB Output is correct
12 Correct 104 ms 11856 KB Output is correct
13 Correct 104 ms 11840 KB Output is correct
14 Correct 104 ms 11840 KB Output is correct
15 Correct 105 ms 11864 KB Output is correct
16 Correct 102 ms 11840 KB Output is correct
17 Correct 102 ms 11836 KB Output is correct
18 Correct 106 ms 11868 KB Output is correct
19 Correct 103 ms 11788 KB Output is correct
20 Correct 104 ms 11852 KB Output is correct
21 Correct 106 ms 11832 KB Output is correct
22 Correct 130 ms 12340 KB Output is correct
23 Correct 127 ms 12248 KB Output is correct
24 Correct 125 ms 12244 KB Output is correct
25 Correct 127 ms 12260 KB Output is correct
26 Correct 128 ms 12336 KB Output is correct
27 Correct 129 ms 12252 KB Output is correct
28 Correct 127 ms 12252 KB Output is correct
29 Correct 129 ms 12252 KB Output is correct
30 Correct 131 ms 12372 KB Output is correct
31 Correct 127 ms 12272 KB Output is correct
32 Correct 126 ms 12240 KB Output is correct
33 Correct 131 ms 12248 KB Output is correct
34 Correct 125 ms 12348 KB Output is correct
35 Correct 124 ms 12224 KB Output is correct
36 Correct 127 ms 12256 KB Output is correct
37 Correct 127 ms 12224 KB Output is correct
38 Correct 126 ms 12256 KB Output is correct
39 Correct 126 ms 12396 KB Output is correct
40 Correct 125 ms 12256 KB Output is correct
41 Correct 128 ms 12224 KB Output is correct
42 Correct 127 ms 12256 KB Output is correct
43 Correct 557 ms 21416 KB Output is correct
44 Correct 558 ms 22168 KB Output is correct
45 Correct 558 ms 22136 KB Output is correct
46 Correct 556 ms 22140 KB Output is correct
47 Correct 557 ms 22196 KB Output is correct
48 Correct 557 ms 22208 KB Output is correct
49 Correct 554 ms 22128 KB Output is correct
50 Correct 551 ms 22128 KB Output is correct
51 Correct 561 ms 22192 KB Output is correct
52 Correct 566 ms 22120 KB Output is correct
53 Correct 551 ms 22120 KB Output is correct
54 Correct 554 ms 22200 KB Output is correct
55 Correct 553 ms 22136 KB Output is correct
56 Correct 554 ms 22228 KB Output is correct
57 Correct 554 ms 22344 KB Output is correct
58 Correct 564 ms 22156 KB Output is correct
59 Correct 552 ms 22180 KB Output is correct
60 Correct 555 ms 22288 KB Output is correct
61 Correct 553 ms 22176 KB Output is correct
62 Correct 548 ms 22204 KB Output is correct
63 Correct 563 ms 22392 KB Output is correct
64 Execution timed out 1145 ms 139712 KB Time limit exceeded
65 Halted 0 ms 0 KB -