oj.uz

답안 #597166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597166 2022-07-15T16:16:50 Z Valaki2 Cubeword (CEOI19_cubeword) C++14
0 / 100
 1100 ms 6612 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

const int mod = 998244353;

const int maxn = 2e5;
const int min_l = 3;
const int max_l = 10;
const int max_ch = 16;

int combinations[max_l + 1][max_ch][max_ch];

int convert(char ch) {
    if(ch >= 'a' && ch <= 'p') {
        return ch - 'a';
    }
    if(ch >= 'q' && ch <= 'z') {
        return ch - 'q' + 32;
    }
    if(ch >= 'A' && ch <= 'P') {
        return ch - 'A' + 16;
    }
    if(ch >= 'Q' && ch <= 'Z') {
        return ch - 'Q' + 42;
    }
    if(ch >= '0' && ch <= '9') {
        return ch - '0' + 52;
    }
}

int n;
vector<string> v;
int ans;

int len;
vector<int> corners;
// vector<pii > neighbours;
int number[max_ch][max_ch][max_ch];
int prec[max_ch][max_ch][max_ch];

int try_scenario() {
    int res = 1;
    for(int i = 1; i <= 3; i++) {
        res = (res * combinations[len][corners[0]][corners[i]]) % mod;
    }
    return res;
}

void backtrack(int corner_id) {
    if(corner_id == 4) {
        number[corners[1]][corners[2]][corners[3]] = (number[corners[1]][corners[2]][corners[3]] + try_scenario()) % mod;
    } else {
        for(corners[corner_id] = 0; corners[corner_id] < max_ch; corners[corner_id]++) {
            backtrack(corner_id + 1);
        }
    }
}

void solve() {
    cin >> n;
    //n = 1;
    v.assign(2 * n, "");
    for(int i = 0; i < n; i++) {
        cin >> v[i];
        //v[i] = "cabac";
        v[i + n] = v[i];
        reverse(v[i + n].begin(), v[i + n].end());
    }
    sort(v.begin(), v.end());
    v.resize(unique(v.begin(), v.end()) - v.begin());
    n = (int) v.size();
    for(int i = 0; i < n; i++) {
        int cur_length = (int) v[i].size();
        int cur_first = convert(v[i].front());
        int cur_last = convert(v[i].back());
        combinations[cur_length][cur_first][cur_last]++;
    }
    /*for(int i = 0; i < 8; i++) {
        for(int j = i + 1; j < 8; j++) {
            if(__builtin_popcount(i ^ j) == 1) {
                neighbours.pb(mp(i, j));
            }
        }
    }*/
    corners.assign(4, 0);
    for(len = min_l; len <= max_l; len++) {
        // reset everything
        for(int i = 0; i < max_ch; i++) {
            for(int j = 0; j < max_ch; j++) {
                for(int k = 0; k < max_ch; k++) {
                    number[i][j][k] = 0;
                    prec[i][j][k] = combinations[len][i][j] * combinations[len][j][k] % mod;
                }
            }
        }
        backtrack(0);
        for(int a1 = 0; a1 < max_ch; a1++) {
            for(int a2 = 0; a2 < max_ch; a2++) {
                for(int a3 = 0; a3 < max_ch; a3++) {
                    for(int b1 = 0; b1 < max_ch; b1++) {
                        for(int b2 = 0; b2 < max_ch; b2++) {
                            for(int b3 = 0; b3 < max_ch; b3++) {
                                ans = (ans + (number[a1][a2][a3] * number[b1][b2][b3] % mod
                                    /** combinations[len][a1][b1] % mod
                                    * combinations[len][b1][a2] % mod
                                    * combinations[len][a2][b2] % mod
                                    * combinations[len][b2][a3] % mod
                                    * combinations[len][a3][b3] % mod
                                    * combinations[len][b3][a1] % mod*/
                                    * prec[a1][b1][a2] % mod
                                    * prec[a2][b2][a3] % mod
                                    * prec[a3][b3][a1])) % mod;
                            }
                        }
                    }
                }
            }
        }
    }
    cout << ans << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Compilation message

cubeword.cpp: In function 'long long int convert(char)':
cubeword.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1088 ms 6604 KB Output is correct
2 Correct 1088 ms 6604 KB Output is correct
3 Correct 1083 ms 6584 KB Output is correct
4 Correct 1100 ms 6592 KB Output is correct
5 Correct 1083 ms 6604 KB Output is correct
6 Correct 1087 ms 6604 KB Output is correct
7 Correct 1073 ms 6604 KB Output is correct
8 Execution timed out 1117 ms 6612 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1088 ms 6604 KB Output is correct
2 Correct 1088 ms 6604 KB Output is correct
3 Correct 1083 ms 6584 KB Output is correct
4 Correct 1100 ms 6592 KB Output is correct
5 Correct 1083 ms 6604 KB Output is correct
6 Correct 1087 ms 6604 KB Output is correct
7 Correct 1073 ms 6604 KB Output is correct
8 Execution timed out 1117 ms 6612 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1088 ms 6604 KB Output is correct
2 Correct 1088 ms 6604 KB Output is correct
3 Correct 1083 ms 6584 KB Output is correct
4 Correct 1100 ms 6592 KB Output is correct
5 Correct 1083 ms 6604 KB Output is correct
6 Correct 1087 ms 6604 KB Output is correct
7 Correct 1073 ms 6604 KB Output is correct
8 Execution timed out 1117 ms 6612 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1088 ms 6604 KB Output is correct
2 Correct 1088 ms 6604 KB Output is correct
3 Correct 1083 ms 6584 KB Output is correct
4 Correct 1100 ms 6592 KB Output is correct
5 Correct 1083 ms 6604 KB Output is correct
6 Correct 1087 ms 6604 KB Output is correct
7 Correct 1073 ms 6604 KB Output is correct
8 Execution timed out 1117 ms 6612 KB Time limit exceeded
9 Halted 0 ms 0 KB -