oj.uz

답안 #947507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947507 2024-03-16T10:09:26 Z GrindMachine Cubeword (CEOI19_cubeword) C++17
21 / 100
 182 ms 9560 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 998244353;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<string> a(n);
    rep(i,n) cin >> a[i];
    rep(i,n){
        auto s = a[i];
        reverse(all(s));
        a.pb(s);
    }

    sort(all(a));
    a.resize(unique(all(a))-a.begin());
    n = sz(a);

    ll alpha = 6;
    ll cnt[15][alpha][alpha];
    memset(cnt,0,sizeof cnt);
    rep(i,n){
        auto &s = a[i];
        cnt[sz(s)][s[0]-'a'][s.back()-'a']++;
    }

    ll ans = 0;

    for(int len = 3; len <= 10; ++len){
        auto &f = cnt[len];
        rep(x1,alpha){
            rep(y1,alpha){
                rep(x2,alpha){
                    rep(y2,alpha){
                        rep(x3,alpha){
                            rep(y3,alpha){
                                rep(x4,alpha){
                                    rep(y4,alpha){
                                        ll mul1 = f[x1][y1]*f[x2][y2]%MOD*f[x3][y3]%MOD*f[x4][y4]%MOD;
                                        ll mul2 = f[x1][x2]*f[x2][x3]%MOD*f[x3][x4]%MOD*f[x4][x1]%MOD;
                                        ll mul3 = f[y1][y2]*f[y2][y3]%MOD*f[y3][y4]%MOD*f[y4][y1]%MOD;
                                        ll add = mul1*mul2%MOD*mul3%MOD;
                                        ans = (ans+add)%MOD;
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 8320 KB Output is correct
2 Correct 168 ms 8844 KB Output is correct
3 Correct 171 ms 7772 KB Output is correct
4 Correct 165 ms 7772 KB Output is correct
5 Correct 166 ms 8168 KB Output is correct
6 Correct 167 ms 8284 KB Output is correct
7 Correct 166 ms 8540 KB Output is correct
8 Correct 165 ms 8540 KB Output is correct
9 Correct 169 ms 9352 KB Output is correct
10 Correct 167 ms 8536 KB Output is correct
11 Correct 168 ms 7512 KB Output is correct
12 Correct 164 ms 7772 KB Output is correct
13 Correct 168 ms 7772 KB Output is correct
14 Correct 168 ms 7684 KB Output is correct
15 Correct 165 ms 8280 KB Output is correct
16 Correct 164 ms 9560 KB Output is correct
17 Correct 167 ms 7772 KB Output is correct
18 Correct 172 ms 8024 KB Output is correct
19 Correct 165 ms 7768 KB Output is correct
20 Correct 165 ms 8796 KB Output is correct
21 Correct 182 ms 9304 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 8320 KB Output is correct
2 Correct 168 ms 8844 KB Output is correct
3 Correct 171 ms 7772 KB Output is correct
4 Correct 165 ms 7772 KB Output is correct
5 Correct 166 ms 8168 KB Output is correct
6 Correct 167 ms 8284 KB Output is correct
7 Correct 166 ms 8540 KB Output is correct
8 Correct 165 ms 8540 KB Output is correct
9 Correct 169 ms 9352 KB Output is correct
10 Correct 167 ms 8536 KB Output is correct
11 Correct 168 ms 7512 KB Output is correct
12 Correct 164 ms 7772 KB Output is correct
13 Correct 168 ms 7772 KB Output is correct
14 Correct 168 ms 7684 KB Output is correct
15 Correct 165 ms 8280 KB Output is correct
16 Correct 164 ms 9560 KB Output is correct
17 Correct 167 ms 7772 KB Output is correct
18 Correct 172 ms 8024 KB Output is correct
19 Correct 165 ms 7768 KB Output is correct
20 Correct 165 ms 8796 KB Output is correct
21 Correct 182 ms 9304 KB Output is correct
22 Incorrect 160 ms 8280 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 8320 KB Output is correct
2 Correct 168 ms 8844 KB Output is correct
3 Correct 171 ms 7772 KB Output is correct
4 Correct 165 ms 7772 KB Output is correct
5 Correct 166 ms 8168 KB Output is correct
6 Correct 167 ms 8284 KB Output is correct
7 Correct 166 ms 8540 KB Output is correct
8 Correct 165 ms 8540 KB Output is correct
9 Correct 169 ms 9352 KB Output is correct
10 Correct 167 ms 8536 KB Output is correct
11 Correct 168 ms 7512 KB Output is correct
12 Correct 164 ms 7772 KB Output is correct
13 Correct 168 ms 7772 KB Output is correct
14 Correct 168 ms 7684 KB Output is correct
15 Correct 165 ms 8280 KB Output is correct
16 Correct 164 ms 9560 KB Output is correct
17 Correct 167 ms 7772 KB Output is correct
18 Correct 172 ms 8024 KB Output is correct
19 Correct 165 ms 7768 KB Output is correct
20 Correct 165 ms 8796 KB Output is correct
21 Correct 182 ms 9304 KB Output is correct
22 Incorrect 160 ms 8280 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 8320 KB Output is correct
2 Correct 168 ms 8844 KB Output is correct
3 Correct 171 ms 7772 KB Output is correct
4 Correct 165 ms 7772 KB Output is correct
5 Correct 166 ms 8168 KB Output is correct
6 Correct 167 ms 8284 KB Output is correct
7 Correct 166 ms 8540 KB Output is correct
8 Correct 165 ms 8540 KB Output is correct
9 Correct 169 ms 9352 KB Output is correct
10 Correct 167 ms 8536 KB Output is correct
11 Correct 168 ms 7512 KB Output is correct
12 Correct 164 ms 7772 KB Output is correct
13 Correct 168 ms 7772 KB Output is correct
14 Correct 168 ms 7684 KB Output is correct
15 Correct 165 ms 8280 KB Output is correct
16 Correct 164 ms 9560 KB Output is correct
17 Correct 167 ms 7772 KB Output is correct
18 Correct 172 ms 8024 KB Output is correct
19 Correct 165 ms 7768 KB Output is correct
20 Correct 165 ms 8796 KB Output is correct
21 Correct 182 ms 9304 KB Output is correct
22 Incorrect 160 ms 8280 KB Output isn't correct
23 Halted 0 ms 0 KB -