oj.uz

Submission #947521

# Submission time Handle Problem Language Result Execution time Memory
947521 2024-03-16T10:34:03 Z GrindMachine Cubeword (CEOI19_cubeword) C++17
21 / 100
 1100 ms 11068 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);

    vector<char> b;
    trav(s,a){
        trav(ch,s){
            b.pb(ch);
        }
    }

    sort(all(b));
    b.resize(unique(all(b))-b.begin());
    ll alpha = sz(b);

    ll cnt[15][alpha][alpha];
    memset(cnt,0,sizeof cnt);
    rep(i,n){
        auto &s = a[i];
        ll x = lower_bound(all(b),s[0])-b.begin();
        ll y = lower_bound(all(b),s.back())-b.begin();
        cnt[sz(s)][x][y]++;
    }

    ll ans = 0;
    ll dp[4][alpha][alpha];

    for(int len = 3; len <= 10; ++len){
        auto &f = cnt[len];
        rep(sx,alpha){
            rep(sy,alpha){
                memset(dp,0,sizeof dp);
                dp[0][sx][sy] = f[sx][sy];
                rep(i,3){
                    rep(x,alpha){
                        rep(y,alpha){
                            rep(x2,alpha){
                                rep(y2,alpha){
                                    dp[i+1][x2][y2] += dp[i][x][y]*f[x][x2]%MOD*f[y][y2]%MOD*f[x2][y2];
                                    dp[i+1][x2][y2] %= MOD;
                                }
                            }
                        }
                    }
                }

                rep(x,alpha){
                    rep(y,alpha){
                        ll add = dp[3][x][y]*f[x][sx]%MOD*f[y][sy]%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

# Verdict Execution time Memory Grader output
1 Correct 108 ms 11028 KB Output is correct
2 Correct 121 ms 11068 KB Output is correct
3 Correct 106 ms 10948 KB Output is correct
4 Correct 105 ms 10892 KB Output is correct
5 Correct 105 ms 10920 KB Output is correct
6 Correct 105 ms 10896 KB Output is correct
7 Correct 107 ms 10920 KB Output is correct
8 Correct 123 ms 10840 KB Output is correct
9 Correct 106 ms 11032 KB Output is correct
10 Correct 109 ms 10912 KB Output is correct
11 Correct 105 ms 10916 KB Output is correct
12 Correct 119 ms 10904 KB Output is correct
13 Correct 106 ms 10900 KB Output is correct
14 Correct 105 ms 10912 KB Output is correct
15 Correct 106 ms 10844 KB Output is correct
16 Correct 107 ms 10892 KB Output is correct
17 Correct 104 ms 10896 KB Output is correct
18 Correct 113 ms 10896 KB Output is correct
19 Correct 105 ms 10912 KB Output is correct
20 Correct 106 ms 10896 KB Output is correct
21 Correct 104 ms 10900 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 11028 KB Output is correct
2 Correct 121 ms 11068 KB Output is correct
3 Correct 106 ms 10948 KB Output is correct
4 Correct 105 ms 10892 KB Output is correct
5 Correct 105 ms 10920 KB Output is correct
6 Correct 105 ms 10896 KB Output is correct
7 Correct 107 ms 10920 KB Output is correct
8 Correct 123 ms 10840 KB Output is correct
9 Correct 106 ms 11032 KB Output is correct
10 Correct 109 ms 10912 KB Output is correct
11 Correct 105 ms 10916 KB Output is correct
12 Correct 119 ms 10904 KB Output is correct
13 Correct 106 ms 10900 KB Output is correct
14 Correct 105 ms 10912 KB Output is correct
15 Correct 106 ms 10844 KB Output is correct
16 Correct 107 ms 10892 KB Output is correct
17 Correct 104 ms 10896 KB Output is correct
18 Correct 113 ms 10896 KB Output is correct
19 Correct 105 ms 10912 KB Output is correct
20 Correct 106 ms 10896 KB Output is correct
21 Correct 104 ms 10900 KB Output is correct
22 Execution timed out 1107 ms 10768 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 11028 KB Output is correct
2 Correct 121 ms 11068 KB Output is correct
3 Correct 106 ms 10948 KB Output is correct
4 Correct 105 ms 10892 KB Output is correct
5 Correct 105 ms 10920 KB Output is correct
6 Correct 105 ms 10896 KB Output is correct
7 Correct 107 ms 10920 KB Output is correct
8 Correct 123 ms 10840 KB Output is correct
9 Correct 106 ms 11032 KB Output is correct
10 Correct 109 ms 10912 KB Output is correct
11 Correct 105 ms 10916 KB Output is correct
12 Correct 119 ms 10904 KB Output is correct
13 Correct 106 ms 10900 KB Output is correct
14 Correct 105 ms 10912 KB Output is correct
15 Correct 106 ms 10844 KB Output is correct
16 Correct 107 ms 10892 KB Output is correct
17 Correct 104 ms 10896 KB Output is correct
18 Correct 113 ms 10896 KB Output is correct
19 Correct 105 ms 10912 KB Output is correct
20 Correct 106 ms 10896 KB Output is correct
21 Correct 104 ms 10900 KB Output is correct
22 Execution timed out 1107 ms 10768 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 11028 KB Output is correct
2 Correct 121 ms 11068 KB Output is correct
3 Correct 106 ms 10948 KB Output is correct
4 Correct 105 ms 10892 KB Output is correct
5 Correct 105 ms 10920 KB Output is correct
6 Correct 105 ms 10896 KB Output is correct
7 Correct 107 ms 10920 KB Output is correct
8 Correct 123 ms 10840 KB Output is correct
9 Correct 106 ms 11032 KB Output is correct
10 Correct 109 ms 10912 KB Output is correct
11 Correct 105 ms 10916 KB Output is correct
12 Correct 119 ms 10904 KB Output is correct
13 Correct 106 ms 10900 KB Output is correct
14 Correct 105 ms 10912 KB Output is correct
15 Correct 106 ms 10844 KB Output is correct
16 Correct 107 ms 10892 KB Output is correct
17 Correct 104 ms 10896 KB Output is correct
18 Correct 113 ms 10896 KB Output is correct
19 Correct 105 ms 10912 KB Output is correct
20 Correct 106 ms 10896 KB Output is correct
21 Correct 104 ms 10900 KB Output is correct
22 Execution timed out 1107 ms 10768 KB Time limit exceeded
23 Halted 0 ms 0 KB -