oj.uz

Submission #1026440

# Submission time Handle Problem Language Result Execution time Memory
1026440 2024-07-18T06:02:26 Z caterpillow Cubeword (CEOI19_cubeword) C++17
84 / 100
 1100 ms 10960 KB 
#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

template<typename Tuple, size_t... Is>
void print_tuple(const Tuple& t, index_sequence<Is...>) {
    ((cerr << (Is == 0 ? "{" : ", ") << get<Is>(t)), ...);
    cerr << "}";
}

template<typename... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    print_tuple(t, index_sequence_for<Args...>{});
    return os;
}

ostream& operator<<(ostream& os, string& s) {
    for (char c : s) os << c; 
    return os;
}

template<template<typename> class Container, typename T>
ostream& operator<<(ostream& os, Container<T> o) {
    os << "{"; 
    int g = size(o); 
    for (auto i : o) os << i << ((--g) == 0 ? "" : ", "); 
    os << "}";
    return os;
}

template<typename T, typename V>
ostream& operator<<(ostream& os, const pair<T, V> p) {
    os << "{" << p.f << ", " << p.s << "}";
    return os;
}

template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail) {
    int i = 0;
    while (names[i] != '\0' && names[i] != ',') i++;
    constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
    if constexpr (is_str) cerr << head; // ignore directly passed strings
    else cerr.write(names, i) << " = " << head; 
    if constexpr (sizeof...(tail)) cerr << (is_str ? "" : ","), printer(names + i + 1, tail...);
    else cerr << endl;
}

#ifdef LOCAL
#define dbg(...) std::cerr << __LINE__ << ": ", printer(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif

const ll mod = 998244353;

inline void add(ll& a, ll b) {
    a += b;
    a -= (a >= mod) * mod;
}

template<typename T>
T mul(T t) {
    return t;
}

template<typename T, typename... Args> 
T mul(T f, Args... args) {
    return (f * mul(args...)) % mod;
}

/*

bucket by word lengths
only care about first and last characters
add both forwards and backwards versions

remove words that are the reverse of each other
dont add duplicates for palindromes

precompute the # of ways to colour a cell if its neighbours are values [a][b][c]


*/

const string alph = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
const ll m = 62;
int mp[1000];

ll triples[m][m][m]; // first index is the "sink", while next three are the sources
ll solve(vt<vt<ll>>& cnt) {
    memset(triples, 0, sizeof(triples));
    ll ans = 0;
    F0R (i, m) {
        F0R (a, m) {
            if (!cnt[a][i]) continue;
            F0R (b, m) {
                if (!cnt[b][i]) continue;
                F0R (c, m) {
                    if (!cnt[c][i]) continue;
                    add(triples[a][b][c], mul(cnt[a][i], cnt[b][i], cnt[c][i]));
                }
            }
        }
    }
    F0R (a, m) {
        F0R (b, m) {
            F0R (c, m) {
                F0R (d, m) {
                    add(ans, mul(triples[a][b][c], triples[a][b][d], triples[a][c][d], triples[b][c][d]));
                }
            }
        }
    }
    return ans;
}

main() {
    cin.tie(0)->sync_with_stdio(0);

    assert(size(alph) == m);
    F0R (i, size(alph)) {
        mp[alph[i]] = i;
    }
    
    int n; cin >> n;
    unordered_set<string> pool;
    vt<vt<vt<ll>>> cnts(11, vt<vt<ll>>(m, vt<ll>(m)));
    F0R (i, n) {
        string st; cin >> st;
        string rst = st;
        reverse(all(rst));
        if (pool.count(rst)) continue;
        cnts[size(st)][mp[st[0]]][mp[st.back()]]++;
        if (st != rst) cnts[size(rst)][mp[rst[0]]][mp[rst.back()]]++;
        pool.insert(st);
    }
    ll ans = 0;
    FOR (i, 3, 11) {
        add(ans, solve(cnts[i]));
    }
    cout << ans << endl;
}

Compilation message

cubeword.cpp:138:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  138 | main() {
      | ^~~~
cubeword.cpp: In function 'int main()':
cubeword.cpp:143:19: warning: array subscript has type 'char' [-Wchar-subscripts]
  143 |         mp[alph[i]] = i;
      |                   ^
cubeword.cpp:154:32: warning: array subscript has type 'char' [-Wchar-subscripts]
  154 |         cnts[size(st)][mp[st[0]]][mp[st.back()]]++;
      |                                ^
cubeword.cpp:154:45: warning: array subscript has type 'char' [-Wchar-subscripts]
  154 |         cnts[size(st)][mp[st[0]]][mp[st.back()]]++;
      |                                      ~~~~~~~^~
cubeword.cpp:155:49: warning: array subscript has type 'char' [-Wchar-subscripts]
  155 |         if (st != rst) cnts[size(rst)][mp[rst[0]]][mp[rst.back()]]++;
      |                                                 ^
cubeword.cpp:155:63: warning: array subscript has type 'char' [-Wchar-subscripts]
  155 |         if (st != rst) cnts[size(rst)][mp[rst[0]]][mp[rst.back()]]++;
      |                                                       ~~~~~~~~^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 9708 KB Output is correct
2 Correct 651 ms 9672 KB Output is correct
3 Correct 643 ms 9668 KB Output is correct
4 Correct 679 ms 9668 KB Output is correct
5 Correct 671 ms 9680 KB Output is correct
6 Correct 655 ms 9924 KB Output is correct
7 Correct 695 ms 9672 KB Output is correct
8 Correct 717 ms 9708 KB Output is correct
9 Correct 692 ms 9800 KB Output is correct
10 Correct 658 ms 9672 KB Output is correct
11 Correct 665 ms 9680 KB Output is correct
12 Correct 667 ms 9612 KB Output is correct
13 Correct 690 ms 9668 KB Output is correct
14 Correct 665 ms 9848 KB Output is correct
15 Correct 647 ms 9724 KB Output is correct
16 Correct 655 ms 9616 KB Output is correct
17 Correct 680 ms 9764 KB Output is correct
18 Correct 660 ms 9672 KB Output is correct
19 Correct 692 ms 9668 KB Output is correct
20 Correct 648 ms 9680 KB Output is correct
21 Correct 654 ms 9672 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 9708 KB Output is correct
2 Correct 651 ms 9672 KB Output is correct
3 Correct 643 ms 9668 KB Output is correct
4 Correct 679 ms 9668 KB Output is correct
5 Correct 671 ms 9680 KB Output is correct
6 Correct 655 ms 9924 KB Output is correct
7 Correct 695 ms 9672 KB Output is correct
8 Correct 717 ms 9708 KB Output is correct
9 Correct 692 ms 9800 KB Output is correct
10 Correct 658 ms 9672 KB Output is correct
11 Correct 665 ms 9680 KB Output is correct
12 Correct 667 ms 9612 KB Output is correct
13 Correct 690 ms 9668 KB Output is correct
14 Correct 665 ms 9848 KB Output is correct
15 Correct 647 ms 9724 KB Output is correct
16 Correct 655 ms 9616 KB Output is correct
17 Correct 680 ms 9764 KB Output is correct
18 Correct 660 ms 9672 KB Output is correct
19 Correct 692 ms 9668 KB Output is correct
20 Correct 648 ms 9680 KB Output is correct
21 Correct 654 ms 9672 KB Output is correct
22 Correct 646 ms 9932 KB Output is correct
23 Correct 623 ms 9924 KB Output is correct
24 Correct 653 ms 9988 KB Output is correct
25 Correct 643 ms 9924 KB Output is correct
26 Correct 642 ms 9932 KB Output is correct
27 Correct 641 ms 9936 KB Output is correct
28 Correct 663 ms 9928 KB Output is correct
29 Correct 642 ms 9984 KB Output is correct
30 Correct 639 ms 9932 KB Output is correct
31 Correct 639 ms 9932 KB Output is correct
32 Correct 665 ms 9936 KB Output is correct
33 Correct 644 ms 9940 KB Output is correct
34 Correct 645 ms 9928 KB Output is correct
35 Correct 646 ms 10040 KB Output is correct
36 Correct 606 ms 9916 KB Output is correct
37 Correct 636 ms 9936 KB Output is correct
38 Correct 653 ms 9928 KB Output is correct
39 Correct 645 ms 9924 KB Output is correct
40 Correct 629 ms 9924 KB Output is correct
41 Correct 639 ms 9936 KB Output is correct
42 Correct 694 ms 9932 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 9708 KB Output is correct
2 Correct 651 ms 9672 KB Output is correct
3 Correct 643 ms 9668 KB Output is correct
4 Correct 679 ms 9668 KB Output is correct
5 Correct 671 ms 9680 KB Output is correct
6 Correct 655 ms 9924 KB Output is correct
7 Correct 695 ms 9672 KB Output is correct
8 Correct 717 ms 9708 KB Output is correct
9 Correct 692 ms 9800 KB Output is correct
10 Correct 658 ms 9672 KB Output is correct
11 Correct 665 ms 9680 KB Output is correct
12 Correct 667 ms 9612 KB Output is correct
13 Correct 690 ms 9668 KB Output is correct
14 Correct 665 ms 9848 KB Output is correct
15 Correct 647 ms 9724 KB Output is correct
16 Correct 655 ms 9616 KB Output is correct
17 Correct 680 ms 9764 KB Output is correct
18 Correct 660 ms 9672 KB Output is correct
19 Correct 692 ms 9668 KB Output is correct
20 Correct 648 ms 9680 KB Output is correct
21 Correct 654 ms 9672 KB Output is correct
22 Correct 646 ms 9932 KB Output is correct
23 Correct 623 ms 9924 KB Output is correct
24 Correct 653 ms 9988 KB Output is correct
25 Correct 643 ms 9924 KB Output is correct
26 Correct 642 ms 9932 KB Output is correct
27 Correct 641 ms 9936 KB Output is correct
28 Correct 663 ms 9928 KB Output is correct
29 Correct 642 ms 9984 KB Output is correct
30 Correct 639 ms 9932 KB Output is correct
31 Correct 639 ms 9932 KB Output is correct
32 Correct 665 ms 9936 KB Output is correct
33 Correct 644 ms 9940 KB Output is correct
34 Correct 645 ms 9928 KB Output is correct
35 Correct 646 ms 10040 KB Output is correct
36 Correct 606 ms 9916 KB Output is correct
37 Correct 636 ms 9936 KB Output is correct
38 Correct 653 ms 9928 KB Output is correct
39 Correct 645 ms 9924 KB Output is correct
40 Correct 629 ms 9924 KB Output is correct
41 Correct 639 ms 9936 KB Output is correct
42 Correct 694 ms 9932 KB Output is correct
43 Correct 671 ms 10184 KB Output is correct
44 Correct 678 ms 10192 KB Output is correct
45 Correct 675 ms 10180 KB Output is correct
46 Correct 673 ms 10184 KB Output is correct
47 Correct 676 ms 10192 KB Output is correct
48 Correct 671 ms 10184 KB Output is correct
49 Correct 673 ms 10184 KB Output is correct
50 Correct 676 ms 10144 KB Output is correct
51 Correct 665 ms 9928 KB Output is correct
52 Correct 678 ms 10188 KB Output is correct
53 Correct 677 ms 10180 KB Output is correct
54 Correct 676 ms 10192 KB Output is correct
55 Correct 681 ms 10180 KB Output is correct
56 Correct 661 ms 10120 KB Output is correct
57 Correct 703 ms 9924 KB Output is correct
58 Correct 709 ms 10192 KB Output is correct
59 Correct 682 ms 10044 KB Output is correct
60 Correct 673 ms 10192 KB Output is correct
61 Correct 665 ms 9928 KB Output is correct
62 Correct 685 ms 10176 KB Output is correct
63 Correct 679 ms 10192 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 9708 KB Output is correct
2 Correct 651 ms 9672 KB Output is correct
3 Correct 643 ms 9668 KB Output is correct
4 Correct 679 ms 9668 KB Output is correct
5 Correct 671 ms 9680 KB Output is correct
6 Correct 655 ms 9924 KB Output is correct
7 Correct 695 ms 9672 KB Output is correct
8 Correct 717 ms 9708 KB Output is correct
9 Correct 692 ms 9800 KB Output is correct
10 Correct 658 ms 9672 KB Output is correct
11 Correct 665 ms 9680 KB Output is correct
12 Correct 667 ms 9612 KB Output is correct
13 Correct 690 ms 9668 KB Output is correct
14 Correct 665 ms 9848 KB Output is correct
15 Correct 647 ms 9724 KB Output is correct
16 Correct 655 ms 9616 KB Output is correct
17 Correct 680 ms 9764 KB Output is correct
18 Correct 660 ms 9672 KB Output is correct
19 Correct 692 ms 9668 KB Output is correct
20 Correct 648 ms 9680 KB Output is correct
21 Correct 654 ms 9672 KB Output is correct
22 Correct 646 ms 9932 KB Output is correct
23 Correct 623 ms 9924 KB Output is correct
24 Correct 653 ms 9988 KB Output is correct
25 Correct 643 ms 9924 KB Output is correct
26 Correct 642 ms 9932 KB Output is correct
27 Correct 641 ms 9936 KB Output is correct
28 Correct 663 ms 9928 KB Output is correct
29 Correct 642 ms 9984 KB Output is correct
30 Correct 639 ms 9932 KB Output is correct
31 Correct 639 ms 9932 KB Output is correct
32 Correct 665 ms 9936 KB Output is correct
33 Correct 644 ms 9940 KB Output is correct
34 Correct 645 ms 9928 KB Output is correct
35 Correct 646 ms 10040 KB Output is correct
36 Correct 606 ms 9916 KB Output is correct
37 Correct 636 ms 9936 KB Output is correct
38 Correct 653 ms 9928 KB Output is correct
39 Correct 645 ms 9924 KB Output is correct
40 Correct 629 ms 9924 KB Output is correct
41 Correct 639 ms 9936 KB Output is correct
42 Correct 694 ms 9932 KB Output is correct
43 Correct 671 ms 10184 KB Output is correct
44 Correct 678 ms 10192 KB Output is correct
45 Correct 675 ms 10180 KB Output is correct
46 Correct 673 ms 10184 KB Output is correct
47 Correct 676 ms 10192 KB Output is correct
48 Correct 671 ms 10184 KB Output is correct
49 Correct 673 ms 10184 KB Output is correct
50 Correct 676 ms 10144 KB Output is correct
51 Correct 665 ms 9928 KB Output is correct
52 Correct 678 ms 10188 KB Output is correct
53 Correct 677 ms 10180 KB Output is correct
54 Correct 676 ms 10192 KB Output is correct
55 Correct 681 ms 10180 KB Output is correct
56 Correct 661 ms 10120 KB Output is correct
57 Correct 703 ms 9924 KB Output is correct
58 Correct 709 ms 10192 KB Output is correct
59 Correct 682 ms 10044 KB Output is correct
60 Correct 673 ms 10192 KB Output is correct
61 Correct 665 ms 9928 KB Output is correct
62 Correct 685 ms 10176 KB Output is correct
63 Correct 679 ms 10192 KB Output is correct
64 Correct 1079 ms 10188 KB Output is correct
65 Correct 1066 ms 10792 KB Output is correct
66 Correct 1065 ms 10832 KB Output is correct
67 Correct 1073 ms 10960 KB Output is correct
68 Execution timed out 1117 ms 10960 KB Time limit exceeded
69 Halted 0 ms 0 KB -