oj.uz

Submission #572328

# Submission time Handle Problem Language Result Execution time Memory
572328 2022-06-04T09:14:09 Z piOOE Cubeword (CEOI19_cubeword) C++17
21 / 100
 400 ms 15460 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }

const int N = 8, A = 'f' - 'a' + 1, L = 11, mod = 998244353;
const ll infL = 3e18;

int g[N][3] = {{1, 2, 4},
               {0, 3, 5},
               {0, 3, 6},
               {1, 2, 7},
               {0, 5, 6},
               {1, 4, 7},
               {2, 4, 7},
               {3, 5, 6}};

int n;
int cnt[A][A][L], used[N];
int ans = 0, len = 0;

void rec(int i, int val) {
    if (val == 0) {
        return;
    }
    if (i == N) {
        ans = (ans + val) % mod;
        return;
    }
    for (int x = 0; x < A; ++x) {
        used[i] = x;
        int nw = val;
        for (int to: g[i]) {
            if (used[to] == -1) continue;
            nw = (nw * (ll) cnt[used[i]][used[to]][len]) % mod;
        }
        rec(i + 1, nw);
    }
    used[i] = -1;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    set<string> stt;
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        string ss = s;
        reverse(all(ss));
        stt.insert(ss);
        stt.insert(s);
    }
    for (string s: stt) {
        ++cnt[s[0] - 'a'][s.back() - 'a'][sz(s)];
    }
    memset(used, -1, sizeof(used));
    for (len = 1; len < L; ++len) {
        rec(0, 1);
    }
    cout << ans;
    return 0;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 14804 KB Output is correct
2 Correct 351 ms 14784 KB Output is correct
3 Correct 328 ms 14796 KB Output is correct
4 Correct 341 ms 14776 KB Output is correct
5 Correct 348 ms 14696 KB Output is correct
6 Correct 331 ms 14740 KB Output is correct
7 Correct 331 ms 14812 KB Output is correct
8 Correct 351 ms 14796 KB Output is correct
9 Correct 339 ms 14668 KB Output is correct
10 Correct 332 ms 14724 KB Output is correct
11 Correct 335 ms 14796 KB Output is correct
12 Correct 328 ms 14780 KB Output is correct
13 Correct 336 ms 14896 KB Output is correct
14 Correct 338 ms 14736 KB Output is correct
15 Correct 348 ms 14904 KB Output is correct
16 Correct 332 ms 14784 KB Output is correct
17 Correct 341 ms 14668 KB Output is correct
18 Correct 331 ms 14908 KB Output is correct
19 Correct 364 ms 14668 KB Output is correct
20 Correct 328 ms 14796 KB Output is correct
21 Correct 400 ms 14716 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 14804 KB Output is correct
2 Correct 351 ms 14784 KB Output is correct
3 Correct 328 ms 14796 KB Output is correct
4 Correct 341 ms 14776 KB Output is correct
5 Correct 348 ms 14696 KB Output is correct
6 Correct 331 ms 14740 KB Output is correct
7 Correct 331 ms 14812 KB Output is correct
8 Correct 351 ms 14796 KB Output is correct
9 Correct 339 ms 14668 KB Output is correct
10 Correct 332 ms 14724 KB Output is correct
11 Correct 335 ms 14796 KB Output is correct
12 Correct 328 ms 14780 KB Output is correct
13 Correct 336 ms 14896 KB Output is correct
14 Correct 338 ms 14736 KB Output is correct
15 Correct 348 ms 14904 KB Output is correct
16 Correct 332 ms 14784 KB Output is correct
17 Correct 341 ms 14668 KB Output is correct
18 Correct 331 ms 14908 KB Output is correct
19 Correct 364 ms 14668 KB Output is correct
20 Correct 328 ms 14796 KB Output is correct
21 Correct 400 ms 14716 KB Output is correct
22 Incorrect 334 ms 15460 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 14804 KB Output is correct
2 Correct 351 ms 14784 KB Output is correct
3 Correct 328 ms 14796 KB Output is correct
4 Correct 341 ms 14776 KB Output is correct
5 Correct 348 ms 14696 KB Output is correct
6 Correct 331 ms 14740 KB Output is correct
7 Correct 331 ms 14812 KB Output is correct
8 Correct 351 ms 14796 KB Output is correct
9 Correct 339 ms 14668 KB Output is correct
10 Correct 332 ms 14724 KB Output is correct
11 Correct 335 ms 14796 KB Output is correct
12 Correct 328 ms 14780 KB Output is correct
13 Correct 336 ms 14896 KB Output is correct
14 Correct 338 ms 14736 KB Output is correct
15 Correct 348 ms 14904 KB Output is correct
16 Correct 332 ms 14784 KB Output is correct
17 Correct 341 ms 14668 KB Output is correct
18 Correct 331 ms 14908 KB Output is correct
19 Correct 364 ms 14668 KB Output is correct
20 Correct 328 ms 14796 KB Output is correct
21 Correct 400 ms 14716 KB Output is correct
22 Incorrect 334 ms 15460 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 14804 KB Output is correct
2 Correct 351 ms 14784 KB Output is correct
3 Correct 328 ms 14796 KB Output is correct
4 Correct 341 ms 14776 KB Output is correct
5 Correct 348 ms 14696 KB Output is correct
6 Correct 331 ms 14740 KB Output is correct
7 Correct 331 ms 14812 KB Output is correct
8 Correct 351 ms 14796 KB Output is correct
9 Correct 339 ms 14668 KB Output is correct
10 Correct 332 ms 14724 KB Output is correct
11 Correct 335 ms 14796 KB Output is correct
12 Correct 328 ms 14780 KB Output is correct
13 Correct 336 ms 14896 KB Output is correct
14 Correct 338 ms 14736 KB Output is correct
15 Correct 348 ms 14904 KB Output is correct
16 Correct 332 ms 14784 KB Output is correct
17 Correct 341 ms 14668 KB Output is correct
18 Correct 331 ms 14908 KB Output is correct
19 Correct 364 ms 14668 KB Output is correct
20 Correct 328 ms 14796 KB Output is correct
21 Correct 400 ms 14716 KB Output is correct
22 Incorrect 334 ms 15460 KB Output isn't correct
23 Halted 0 ms 0 KB -