oj.uz

Submission #373215

# Submission time Handle Problem Language Result Execution time Memory
373215 2021-03-03T18:50:30 Z ACmachine Cubeword (CEOI19_cubeword) C++17
84 / 100
 657 ms 18996 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[alpha][alpha][alpha];
    int cn[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[f][s]++;
            xprev = x;
        }
        REP(i, alpha){
            REP(j, alpha){
                REP(k, alpha){
                    REP(g, alpha){
                        D[j][k][g] += (1ll * cn[i][j] * cn[i][k] * cn[i][g]);
                        D[j][k][g] %= mod;
                    }
                }
            }
        }
        ll res = 0;
        REP(a, alpha){
            REP(b, alpha){
                REP(c, alpha){
                    REP(d, alpha){
                        res += ((((D[a][d][c] * D[a][d][b]) % mod) * D[a][c][b]) % mod) * D[d][c][b];
                        res %= mod;
                    }
                }
            }
        }
        return res;
    };
    vector<vector<string>> todo(11);
    REP(i, strings.size()) todo[strings[i].length()].pb(strings[i]);
    ll ans = 0;
    FOR(i, 3, 11, 1){
        if(todo[i].size() > 0)
            ans += solve(todo[i]);
        ans %= mod;
    }
    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();
      |             ^~
cubeword.cpp: In function 'int main()':
cubeword.cpp:21:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
cubeword.cpp:23:18: note: in expansion of macro 'FOR'
   23 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
cubeword.cpp:118:5: note: in expansion of macro 'REP'
  118 |     REP(i, strings.size()) todo[strings[i].length()].pb(strings[i]);
      |     ^~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 18100 KB Output is correct
2 Correct 616 ms 18228 KB Output is correct
3 Correct 631 ms 18868 KB Output is correct
4 Correct 653 ms 18100 KB Output is correct
5 Correct 636 ms 17588 KB Output is correct
6 Correct 626 ms 17972 KB Output is correct
7 Correct 641 ms 17588 KB Output is correct
8 Correct 631 ms 18148 KB Output is correct
9 Correct 621 ms 17972 KB Output is correct
10 Correct 626 ms 18100 KB Output is correct
11 Correct 641 ms 17716 KB Output is correct
12 Correct 623 ms 18996 KB Output is correct
13 Correct 642 ms 17972 KB Output is correct
14 Correct 621 ms 18100 KB Output is correct
15 Correct 620 ms 17972 KB Output is correct
16 Correct 623 ms 17716 KB Output is correct
17 Correct 615 ms 18228 KB Output is correct
18 Correct 618 ms 17972 KB Output is correct
19 Correct 615 ms 18996 KB Output is correct
20 Correct 625 ms 18228 KB Output is correct
21 Correct 657 ms 18100 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 18100 KB Output is correct
2 Correct 616 ms 18228 KB Output is correct
3 Correct 631 ms 18868 KB Output is correct
4 Correct 653 ms 18100 KB Output is correct
5 Correct 636 ms 17588 KB Output is correct
6 Correct 626 ms 17972 KB Output is correct
7 Correct 641 ms 17588 KB Output is correct
8 Correct 631 ms 18148 KB Output is correct
9 Correct 621 ms 17972 KB Output is correct
10 Correct 626 ms 18100 KB Output is correct
11 Correct 641 ms 17716 KB Output is correct
12 Correct 623 ms 18996 KB Output is correct
13 Correct 642 ms 17972 KB Output is correct
14 Correct 621 ms 18100 KB Output is correct
15 Correct 620 ms 17972 KB Output is correct
16 Correct 623 ms 17716 KB Output is correct
17 Correct 615 ms 18228 KB Output is correct
18 Correct 618 ms 17972 KB Output is correct
19 Correct 615 ms 18996 KB Output is correct
20 Correct 625 ms 18228 KB Output is correct
21 Correct 657 ms 18100 KB Output is correct
22 Correct 611 ms 15412 KB Output is correct
23 Correct 613 ms 15500 KB Output is correct
24 Correct 633 ms 15472 KB Output is correct
25 Correct 615 ms 16052 KB Output is correct
26 Correct 616 ms 15688 KB Output is correct
27 Correct 619 ms 16400 KB Output is correct
28 Correct 618 ms 16052 KB Output is correct
29 Correct 610 ms 16452 KB Output is correct
30 Correct 621 ms 15760 KB Output is correct
31 Correct 628 ms 16496 KB Output is correct
32 Correct 605 ms 15284 KB Output is correct
33 Correct 616 ms 16564 KB Output is correct
34 Correct 615 ms 16308 KB Output is correct
35 Correct 650 ms 16244 KB Output is correct
36 Correct 622 ms 16308 KB Output is correct
37 Correct 626 ms 16436 KB Output is correct
38 Correct 617 ms 15924 KB Output is correct
39 Correct 645 ms 16540 KB Output is correct
40 Correct 620 ms 16564 KB Output is correct
41 Correct 618 ms 15796 KB Output is correct
42 Correct 629 ms 15464 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 18100 KB Output is correct
2 Correct 616 ms 18228 KB Output is correct
3 Correct 631 ms 18868 KB Output is correct
4 Correct 653 ms 18100 KB Output is correct
5 Correct 636 ms 17588 KB Output is correct
6 Correct 626 ms 17972 KB Output is correct
7 Correct 641 ms 17588 KB Output is correct
8 Correct 631 ms 18148 KB Output is correct
9 Correct 621 ms 17972 KB Output is correct
10 Correct 626 ms 18100 KB Output is correct
11 Correct 641 ms 17716 KB Output is correct
12 Correct 623 ms 18996 KB Output is correct
13 Correct 642 ms 17972 KB Output is correct
14 Correct 621 ms 18100 KB Output is correct
15 Correct 620 ms 17972 KB Output is correct
16 Correct 623 ms 17716 KB Output is correct
17 Correct 615 ms 18228 KB Output is correct
18 Correct 618 ms 17972 KB Output is correct
19 Correct 615 ms 18996 KB Output is correct
20 Correct 625 ms 18228 KB Output is correct
21 Correct 657 ms 18100 KB Output is correct
22 Correct 611 ms 15412 KB Output is correct
23 Correct 613 ms 15500 KB Output is correct
24 Correct 633 ms 15472 KB Output is correct
25 Correct 615 ms 16052 KB Output is correct
26 Correct 616 ms 15688 KB Output is correct
27 Correct 619 ms 16400 KB Output is correct
28 Correct 618 ms 16052 KB Output is correct
29 Correct 610 ms 16452 KB Output is correct
30 Correct 621 ms 15760 KB Output is correct
31 Correct 628 ms 16496 KB Output is correct
32 Correct 605 ms 15284 KB Output is correct
33 Correct 616 ms 16564 KB Output is correct
34 Correct 615 ms 16308 KB Output is correct
35 Correct 650 ms 16244 KB Output is correct
36 Correct 622 ms 16308 KB Output is correct
37 Correct 626 ms 16436 KB Output is correct
38 Correct 617 ms 15924 KB Output is correct
39 Correct 645 ms 16540 KB Output is correct
40 Correct 620 ms 16564 KB Output is correct
41 Correct 618 ms 15796 KB Output is correct
42 Correct 629 ms 15464 KB Output is correct
43 Correct 629 ms 16436 KB Output is correct
44 Correct 639 ms 16408 KB Output is correct
45 Correct 634 ms 16180 KB Output is correct
46 Correct 610 ms 16692 KB Output is correct
47 Correct 643 ms 16564 KB Output is correct
48 Correct 623 ms 16692 KB Output is correct
49 Correct 633 ms 16308 KB Output is correct
50 Correct 636 ms 16948 KB Output is correct
51 Correct 614 ms 16820 KB Output is correct
52 Correct 622 ms 16948 KB Output is correct
53 Correct 613 ms 16692 KB Output is correct
54 Correct 633 ms 17204 KB Output is correct
55 Correct 615 ms 16948 KB Output is correct
56 Correct 636 ms 16168 KB Output is correct
57 Correct 657 ms 17092 KB Output is correct
58 Correct 621 ms 16308 KB Output is correct
59 Correct 618 ms 16820 KB Output is correct
60 Correct 624 ms 16052 KB Output is correct
61 Correct 626 ms 16656 KB Output is correct
62 Correct 625 ms 15796 KB Output is correct
63 Correct 651 ms 16052 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 645 ms 18100 KB Output is correct
2 Correct 616 ms 18228 KB Output is correct
3 Correct 631 ms 18868 KB Output is correct
4 Correct 653 ms 18100 KB Output is correct
5 Correct 636 ms 17588 KB Output is correct
6 Correct 626 ms 17972 KB Output is correct
7 Correct 641 ms 17588 KB Output is correct
8 Correct 631 ms 18148 KB Output is correct
9 Correct 621 ms 17972 KB Output is correct
10 Correct 626 ms 18100 KB Output is correct
11 Correct 641 ms 17716 KB Output is correct
12 Correct 623 ms 18996 KB Output is correct
13 Correct 642 ms 17972 KB Output is correct
14 Correct 621 ms 18100 KB Output is correct
15 Correct 620 ms 17972 KB Output is correct
16 Correct 623 ms 17716 KB Output is correct
17 Correct 615 ms 18228 KB Output is correct
18 Correct 618 ms 17972 KB Output is correct
19 Correct 615 ms 18996 KB Output is correct
20 Correct 625 ms 18228 KB Output is correct
21 Correct 657 ms 18100 KB Output is correct
22 Correct 611 ms 15412 KB Output is correct
23 Correct 613 ms 15500 KB Output is correct
24 Correct 633 ms 15472 KB Output is correct
25 Correct 615 ms 16052 KB Output is correct
26 Correct 616 ms 15688 KB Output is correct
27 Correct 619 ms 16400 KB Output is correct
28 Correct 618 ms 16052 KB Output is correct
29 Correct 610 ms 16452 KB Output is correct
30 Correct 621 ms 15760 KB Output is correct
31 Correct 628 ms 16496 KB Output is correct
32 Correct 605 ms 15284 KB Output is correct
33 Correct 616 ms 16564 KB Output is correct
34 Correct 615 ms 16308 KB Output is correct
35 Correct 650 ms 16244 KB Output is correct
36 Correct 622 ms 16308 KB Output is correct
37 Correct 626 ms 16436 KB Output is correct
38 Correct 617 ms 15924 KB Output is correct
39 Correct 645 ms 16540 KB Output is correct
40 Correct 620 ms 16564 KB Output is correct
41 Correct 618 ms 15796 KB Output is correct
42 Correct 629 ms 15464 KB Output is correct
43 Correct 629 ms 16436 KB Output is correct
44 Correct 639 ms 16408 KB Output is correct
45 Correct 634 ms 16180 KB Output is correct
46 Correct 610 ms 16692 KB Output is correct
47 Correct 643 ms 16564 KB Output is correct
48 Correct 623 ms 16692 KB Output is correct
49 Correct 633 ms 16308 KB Output is correct
50 Correct 636 ms 16948 KB Output is correct
51 Correct 614 ms 16820 KB Output is correct
52 Correct 622 ms 16948 KB Output is correct
53 Correct 613 ms 16692 KB Output is correct
54 Correct 633 ms 17204 KB Output is correct
55 Correct 615 ms 16948 KB Output is correct
56 Correct 636 ms 16168 KB Output is correct
57 Correct 657 ms 17092 KB Output is correct
58 Correct 621 ms 16308 KB Output is correct
59 Correct 618 ms 16820 KB Output is correct
60 Correct 624 ms 16052 KB Output is correct
61 Correct 626 ms 16656 KB Output is correct
62 Correct 625 ms 15796 KB Output is correct
63 Correct 651 ms 16052 KB Output is correct
64 Incorrect 645 ms 16436 KB Output isn't correct
65 Halted 0 ms 0 KB -