oj.uz

Submission #373218

# Submission time Handle Problem Language Result Execution time Memory
373218 2021-03-03T18:57:03 Z ACmachine Cubeword (CEOI19_cubeword) C++17
84 / 100
 668 ms 18964 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

const int mod = 998244353;
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
 	const int alpha = 52;
    vector<int> cnv(150);
    REP(i, 26) cnv['a' + i] = i;
    REP(i, 26) {
        cnv['A' + i] = 26 + i;
    }
    REP(i, 10){
        cnv['0' + i] = 52 + i;
    }
    int n; cin >> n;
    vector<string> strings(n);
    cin >> strings;
    REP(i, n){
        string ns = strings[i];
        reverse(all(ns));
        strings.pb(ns);
    }
    sort(all(strings));
    ll D[11][alpha][alpha][alpha];
    int cn[11][alpha][alpha];
    auto solve = [&](vector<string> &a){
        int nn = a.size();
        memset(D, 0, sizeof(D));
        memset(cn, 0, sizeof(cn));
        string xprev = "";
        for(string x : a){
            if(x == xprev) continue;
            int f = cnv[x[0]]; int s = cnv[x.back()];
            cn[x.length()][f][s]++;
            xprev = x;
        }
        FOR(len, 3, 11, 1){
            REP(i, alpha){
                REP(j, alpha){
                    REP(k, alpha){
                        REP(g, alpha){
                            D[len][j][k][g] += (1ll * cn[len][i][j] * cn[len][i][k] * cn[len][i][g]);
                            D[len][j][k][g] %= mod;
                        }
                    }
                }
            }
        }
        ll res = 0;
        FOR(len, 3, 11, 1){
            REP(a, alpha){
                REP(b, alpha){
                    REP(c, alpha){
                        REP(d, alpha){
                            res += ((((D[len][a][d][c] * D[len][a][d][b]) % mod) * D[len][a][c][b]) % mod) * D[len][d][c][b];
                            res %= mod;
                        }
                    }
                }
            }
        }
        return res;
    };
    ll ans = solve(strings);
    cout << ans << "\n";
    return 0;
}

Compilation message

cubeword.cpp: In lambda function:
cubeword.cpp:84:13: warning: unused variable 'nn' [-Wunused-variable]
   84 |         int nn = a.size();
      |             ^~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 18904 KB Output is correct
2 Correct 619 ms 18868 KB Output is correct
3 Correct 638 ms 18964 KB Output is correct
4 Correct 625 ms 18836 KB Output is correct
5 Correct 623 ms 18868 KB Output is correct
6 Correct 660 ms 18868 KB Output is correct
7 Correct 622 ms 18888 KB Output is correct
8 Correct 639 ms 18868 KB Output is correct
9 Correct 635 ms 18868 KB Output is correct
10 Correct 631 ms 18868 KB Output is correct
11 Correct 624 ms 18868 KB Output is correct
12 Correct 624 ms 18868 KB Output is correct
13 Correct 662 ms 18868 KB Output is correct
14 Correct 661 ms 18868 KB Output is correct
15 Correct 619 ms 18868 KB Output is correct
16 Correct 618 ms 18880 KB Output is correct
17 Correct 668 ms 18868 KB Output is correct
18 Correct 620 ms 18868 KB Output is correct
19 Correct 616 ms 18904 KB Output is correct
20 Correct 638 ms 18868 KB Output is correct
21 Correct 637 ms 18868 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 18904 KB Output is correct
2 Correct 619 ms 18868 KB Output is correct
3 Correct 638 ms 18964 KB Output is correct
4 Correct 625 ms 18836 KB Output is correct
5 Correct 623 ms 18868 KB Output is correct
6 Correct 660 ms 18868 KB Output is correct
7 Correct 622 ms 18888 KB Output is correct
8 Correct 639 ms 18868 KB Output is correct
9 Correct 635 ms 18868 KB Output is correct
10 Correct 631 ms 18868 KB Output is correct
11 Correct 624 ms 18868 KB Output is correct
12 Correct 624 ms 18868 KB Output is correct
13 Correct 662 ms 18868 KB Output is correct
14 Correct 661 ms 18868 KB Output is correct
15 Correct 619 ms 18868 KB Output is correct
16 Correct 618 ms 18880 KB Output is correct
17 Correct 668 ms 18868 KB Output is correct
18 Correct 620 ms 18868 KB Output is correct
19 Correct 616 ms 18904 KB Output is correct
20 Correct 638 ms 18868 KB Output is correct
21 Correct 637 ms 18868 KB Output is correct
22 Correct 625 ms 18868 KB Output is correct
23 Correct 627 ms 18868 KB Output is correct
24 Correct 630 ms 18868 KB Output is correct
25 Correct 661 ms 18868 KB Output is correct
26 Correct 626 ms 18868 KB Output is correct
27 Correct 625 ms 18888 KB Output is correct
28 Correct 647 ms 18904 KB Output is correct
29 Correct 630 ms 18868 KB Output is correct
30 Correct 618 ms 18868 KB Output is correct
31 Correct 640 ms 18868 KB Output is correct
32 Correct 645 ms 18868 KB Output is correct
33 Correct 637 ms 18868 KB Output is correct
34 Correct 639 ms 18868 KB Output is correct
35 Correct 625 ms 18868 KB Output is correct
36 Correct 616 ms 18868 KB Output is correct
37 Correct 621 ms 18868 KB Output is correct
38 Correct 619 ms 18868 KB Output is correct
39 Correct 637 ms 18868 KB Output is correct
40 Correct 622 ms 18868 KB Output is correct
41 Correct 615 ms 18868 KB Output is correct
42 Correct 619 ms 18868 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 18904 KB Output is correct
2 Correct 619 ms 18868 KB Output is correct
3 Correct 638 ms 18964 KB Output is correct
4 Correct 625 ms 18836 KB Output is correct
5 Correct 623 ms 18868 KB Output is correct
6 Correct 660 ms 18868 KB Output is correct
7 Correct 622 ms 18888 KB Output is correct
8 Correct 639 ms 18868 KB Output is correct
9 Correct 635 ms 18868 KB Output is correct
10 Correct 631 ms 18868 KB Output is correct
11 Correct 624 ms 18868 KB Output is correct
12 Correct 624 ms 18868 KB Output is correct
13 Correct 662 ms 18868 KB Output is correct
14 Correct 661 ms 18868 KB Output is correct
15 Correct 619 ms 18868 KB Output is correct
16 Correct 618 ms 18880 KB Output is correct
17 Correct 668 ms 18868 KB Output is correct
18 Correct 620 ms 18868 KB Output is correct
19 Correct 616 ms 18904 KB Output is correct
20 Correct 638 ms 18868 KB Output is correct
21 Correct 637 ms 18868 KB Output is correct
22 Correct 625 ms 18868 KB Output is correct
23 Correct 627 ms 18868 KB Output is correct
24 Correct 630 ms 18868 KB Output is correct
25 Correct 661 ms 18868 KB Output is correct
26 Correct 626 ms 18868 KB Output is correct
27 Correct 625 ms 18888 KB Output is correct
28 Correct 647 ms 18904 KB Output is correct
29 Correct 630 ms 18868 KB Output is correct
30 Correct 618 ms 18868 KB Output is correct
31 Correct 640 ms 18868 KB Output is correct
32 Correct 645 ms 18868 KB Output is correct
33 Correct 637 ms 18868 KB Output is correct
34 Correct 639 ms 18868 KB Output is correct
35 Correct 625 ms 18868 KB Output is correct
36 Correct 616 ms 18868 KB Output is correct
37 Correct 621 ms 18868 KB Output is correct
38 Correct 619 ms 18868 KB Output is correct
39 Correct 637 ms 18868 KB Output is correct
40 Correct 622 ms 18868 KB Output is correct
41 Correct 615 ms 18868 KB Output is correct
42 Correct 619 ms 18868 KB Output is correct
43 Correct 617 ms 18868 KB Output is correct
44 Correct 609 ms 18868 KB Output is correct
45 Correct 614 ms 18868 KB Output is correct
46 Correct 618 ms 18868 KB Output is correct
47 Correct 630 ms 18868 KB Output is correct
48 Correct 621 ms 18836 KB Output is correct
49 Correct 615 ms 18868 KB Output is correct
50 Correct 613 ms 18868 KB Output is correct
51 Correct 618 ms 18868 KB Output is correct
52 Correct 611 ms 18868 KB Output is correct
53 Correct 613 ms 18868 KB Output is correct
54 Correct 613 ms 18868 KB Output is correct
55 Correct 617 ms 18868 KB Output is correct
56 Correct 609 ms 18868 KB Output is correct
57 Correct 618 ms 18868 KB Output is correct
58 Correct 620 ms 18868 KB Output is correct
59 Correct 623 ms 18868 KB Output is correct
60 Correct 616 ms 18868 KB Output is correct
61 Correct 612 ms 18872 KB Output is correct
62 Correct 614 ms 18868 KB Output is correct
63 Correct 611 ms 18868 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 18904 KB Output is correct
2 Correct 619 ms 18868 KB Output is correct
3 Correct 638 ms 18964 KB Output is correct
4 Correct 625 ms 18836 KB Output is correct
5 Correct 623 ms 18868 KB Output is correct
6 Correct 660 ms 18868 KB Output is correct
7 Correct 622 ms 18888 KB Output is correct
8 Correct 639 ms 18868 KB Output is correct
9 Correct 635 ms 18868 KB Output is correct
10 Correct 631 ms 18868 KB Output is correct
11 Correct 624 ms 18868 KB Output is correct
12 Correct 624 ms 18868 KB Output is correct
13 Correct 662 ms 18868 KB Output is correct
14 Correct 661 ms 18868 KB Output is correct
15 Correct 619 ms 18868 KB Output is correct
16 Correct 618 ms 18880 KB Output is correct
17 Correct 668 ms 18868 KB Output is correct
18 Correct 620 ms 18868 KB Output is correct
19 Correct 616 ms 18904 KB Output is correct
20 Correct 638 ms 18868 KB Output is correct
21 Correct 637 ms 18868 KB Output is correct
22 Correct 625 ms 18868 KB Output is correct
23 Correct 627 ms 18868 KB Output is correct
24 Correct 630 ms 18868 KB Output is correct
25 Correct 661 ms 18868 KB Output is correct
26 Correct 626 ms 18868 KB Output is correct
27 Correct 625 ms 18888 KB Output is correct
28 Correct 647 ms 18904 KB Output is correct
29 Correct 630 ms 18868 KB Output is correct
30 Correct 618 ms 18868 KB Output is correct
31 Correct 640 ms 18868 KB Output is correct
32 Correct 645 ms 18868 KB Output is correct
33 Correct 637 ms 18868 KB Output is correct
34 Correct 639 ms 18868 KB Output is correct
35 Correct 625 ms 18868 KB Output is correct
36 Correct 616 ms 18868 KB Output is correct
37 Correct 621 ms 18868 KB Output is correct
38 Correct 619 ms 18868 KB Output is correct
39 Correct 637 ms 18868 KB Output is correct
40 Correct 622 ms 18868 KB Output is correct
41 Correct 615 ms 18868 KB Output is correct
42 Correct 619 ms 18868 KB Output is correct
43 Correct 617 ms 18868 KB Output is correct
44 Correct 609 ms 18868 KB Output is correct
45 Correct 614 ms 18868 KB Output is correct
46 Correct 618 ms 18868 KB Output is correct
47 Correct 630 ms 18868 KB Output is correct
48 Correct 621 ms 18836 KB Output is correct
49 Correct 615 ms 18868 KB Output is correct
50 Correct 613 ms 18868 KB Output is correct
51 Correct 618 ms 18868 KB Output is correct
52 Correct 611 ms 18868 KB Output is correct
53 Correct 613 ms 18868 KB Output is correct
54 Correct 613 ms 18868 KB Output is correct
55 Correct 617 ms 18868 KB Output is correct
56 Correct 609 ms 18868 KB Output is correct
57 Correct 618 ms 18868 KB Output is correct
58 Correct 620 ms 18868 KB Output is correct
59 Correct 623 ms 18868 KB Output is correct
60 Correct 616 ms 18868 KB Output is correct
61 Correct 612 ms 18872 KB Output is correct
62 Correct 614 ms 18868 KB Output is correct
63 Correct 611 ms 18868 KB Output is correct
64 Incorrect 624 ms 18868 KB Output isn't correct
65 Halted 0 ms 0 KB -