oj.uz

Submission #572329

# Submission time Handle Problem Language Result Execution time Memory
572329 2022-06-04T09:15:10 Z piOOE Cubeword (CEOI19_cubeword) C++17
21 / 100
 337 ms 8772 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;
    vector<string> stt;
    for (int i = 0; i < n; ++i) {
        string s;
        cin >> s;
        string ss = s;
        reverse(all(ss));
        stt.push_back(ss);
        stt.push_back(s);
    }
    sort(all(stt));
    stt.resize(unique(all(stt)) - begin(stt));
    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 276 ms 8648 KB Output is correct
2 Correct 293 ms 8648 KB Output is correct
3 Correct 271 ms 8648 KB Output is correct
4 Correct 284 ms 8604 KB Output is correct
5 Correct 337 ms 8648 KB Output is correct
6 Correct 275 ms 8680 KB Output is correct
7 Correct 267 ms 8648 KB Output is correct
8 Correct 281 ms 8652 KB Output is correct
9 Correct 286 ms 8772 KB Output is correct
10 Correct 270 ms 8656 KB Output is correct
11 Correct 298 ms 8588 KB Output is correct
12 Correct 272 ms 8648 KB Output is correct
13 Correct 279 ms 8648 KB Output is correct
14 Correct 295 ms 8580 KB Output is correct
15 Correct 274 ms 8648 KB Output is correct
16 Correct 284 ms 8648 KB Output is correct
17 Correct 287 ms 8580 KB Output is correct
18 Correct 269 ms 8624 KB Output is correct
19 Correct 286 ms 8648 KB Output is correct
20 Correct 284 ms 8608 KB Output is correct
21 Correct 276 ms 8648 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 8648 KB Output is correct
2 Correct 293 ms 8648 KB Output is correct
3 Correct 271 ms 8648 KB Output is correct
4 Correct 284 ms 8604 KB Output is correct
5 Correct 337 ms 8648 KB Output is correct
6 Correct 275 ms 8680 KB Output is correct
7 Correct 267 ms 8648 KB Output is correct
8 Correct 281 ms 8652 KB Output is correct
9 Correct 286 ms 8772 KB Output is correct
10 Correct 270 ms 8656 KB Output is correct
11 Correct 298 ms 8588 KB Output is correct
12 Correct 272 ms 8648 KB Output is correct
13 Correct 279 ms 8648 KB Output is correct
14 Correct 295 ms 8580 KB Output is correct
15 Correct 274 ms 8648 KB Output is correct
16 Correct 284 ms 8648 KB Output is correct
17 Correct 287 ms 8580 KB Output is correct
18 Correct 269 ms 8624 KB Output is correct
19 Correct 286 ms 8648 KB Output is correct
20 Correct 284 ms 8608 KB Output is correct
21 Correct 276 ms 8648 KB Output is correct
22 Incorrect 273 ms 8648 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 8648 KB Output is correct
2 Correct 293 ms 8648 KB Output is correct
3 Correct 271 ms 8648 KB Output is correct
4 Correct 284 ms 8604 KB Output is correct
5 Correct 337 ms 8648 KB Output is correct
6 Correct 275 ms 8680 KB Output is correct
7 Correct 267 ms 8648 KB Output is correct
8 Correct 281 ms 8652 KB Output is correct
9 Correct 286 ms 8772 KB Output is correct
10 Correct 270 ms 8656 KB Output is correct
11 Correct 298 ms 8588 KB Output is correct
12 Correct 272 ms 8648 KB Output is correct
13 Correct 279 ms 8648 KB Output is correct
14 Correct 295 ms 8580 KB Output is correct
15 Correct 274 ms 8648 KB Output is correct
16 Correct 284 ms 8648 KB Output is correct
17 Correct 287 ms 8580 KB Output is correct
18 Correct 269 ms 8624 KB Output is correct
19 Correct 286 ms 8648 KB Output is correct
20 Correct 284 ms 8608 KB Output is correct
21 Correct 276 ms 8648 KB Output is correct
22 Incorrect 273 ms 8648 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 8648 KB Output is correct
2 Correct 293 ms 8648 KB Output is correct
3 Correct 271 ms 8648 KB Output is correct
4 Correct 284 ms 8604 KB Output is correct
5 Correct 337 ms 8648 KB Output is correct
6 Correct 275 ms 8680 KB Output is correct
7 Correct 267 ms 8648 KB Output is correct
8 Correct 281 ms 8652 KB Output is correct
9 Correct 286 ms 8772 KB Output is correct
10 Correct 270 ms 8656 KB Output is correct
11 Correct 298 ms 8588 KB Output is correct
12 Correct 272 ms 8648 KB Output is correct
13 Correct 279 ms 8648 KB Output is correct
14 Correct 295 ms 8580 KB Output is correct
15 Correct 274 ms 8648 KB Output is correct
16 Correct 284 ms 8648 KB Output is correct
17 Correct 287 ms 8580 KB Output is correct
18 Correct 269 ms 8624 KB Output is correct
19 Correct 286 ms 8648 KB Output is correct
20 Correct 284 ms 8608 KB Output is correct
21 Correct 276 ms 8648 KB Output is correct
22 Incorrect 273 ms 8648 KB Output isn't correct
23 Halted 0 ms 0 KB -