oj.uz

Submission #249508

# Submission time Handle Problem Language Result Execution time Memory
249508 2020-07-15T07:33:47 Z b00n0rp Cubeword (CEOI19_cubeword) C++17
100 / 100
 1053 ms 39040 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------

#pragma GCC optimize("unroll-loops")

/*
#pragma GCC target("avx,avx2,fma")
*/ 

// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#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;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/

#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 998244353;
const int FMOD = 998244353;
const double eps = 1e-9;

// -----------------------</Consts>-----------------------

/*

// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------


*/

int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}


// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO

    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n;
int cnt[11][65][65];
int dp[11][65][65][65];

int MXa = 26,MXA = 26,MXI = 10;

int ctoi(char c){
    if(c-'a' >= 0) return c-'a';
    if(c-'A' >= 0) return (c-'A')+MXa;
    return (c-'0')+MXa+MXA;
}
 
void solvethetestcase(){
    cin >> n;
    set<string> gg;
    REP(i,n){
        string s; cin >> s;
        gg.insert(s);
        reverse(all(s));
        gg.insert(s);    
    }
    for(auto s:gg){
        cnt[s.length()][ctoi(s[0])][ctoi(s[s.length()-1])] ++;
    }
    REP(i,11){
        REP(j,MXa+MXA+MXI){
            FOR(k,j,MXa+MXA+MXI){
                FOR(l,k,MXa+MXA+MXI){
                    REP(m,MXa+MXA+MXI){
                        dp[i][j][k][l] = add(dp[i][j][k][l],mul(mul(cnt[i][j][m],cnt[i][k][m]),cnt[i][l][m]));
                        dp[i][j][l][k] = dp[i][k][j][l] = dp[i][k][l][j] = dp[i][l][j][k] = dp[i][l][k][j] = dp[i][j][k][l];
                    }
                }
            }
        }
    }
    int ans = 0;
    REP(i,11){
        REP(j,MXa+MXA+MXI){
            REP(k,MXa+MXA+MXI){
                REP(l,MXa+MXA+MXI){
                    REP(m,MXa+MXA+MXI){
                        int cur = mul(mul(dp[i][j][k][l],dp[i][m][k][l]),mul(dp[i][j][m][l],dp[i][j][k][m]));
                        ans = add(ans,cur);
                    }
                }
            }
        }
    }
    cout << ans << endl;
}

Compilation message

cubeword.cpp:25:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
cubeword.cpp:165:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
cubeword.cpp:168:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 37752 KB Output is correct
2 Correct 805 ms 37624 KB Output is correct
3 Correct 809 ms 37496 KB Output is correct
4 Correct 810 ms 37496 KB Output is correct
5 Correct 821 ms 37560 KB Output is correct
6 Correct 818 ms 37496 KB Output is correct
7 Correct 812 ms 37624 KB Output is correct
8 Correct 828 ms 37624 KB Output is correct
9 Correct 776 ms 37500 KB Output is correct
10 Correct 795 ms 37488 KB Output is correct
11 Correct 804 ms 37496 KB Output is correct
12 Correct 809 ms 37580 KB Output is correct
13 Correct 796 ms 37620 KB Output is correct
14 Correct 827 ms 37620 KB Output is correct
15 Correct 841 ms 37496 KB Output is correct
16 Correct 812 ms 37596 KB Output is correct
17 Correct 820 ms 37516 KB Output is correct
18 Correct 833 ms 37632 KB Output is correct
19 Correct 836 ms 37528 KB Output is correct
20 Correct 829 ms 37520 KB Output is correct
21 Correct 792 ms 37624 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 37752 KB Output is correct
2 Correct 805 ms 37624 KB Output is correct
3 Correct 809 ms 37496 KB Output is correct
4 Correct 810 ms 37496 KB Output is correct
5 Correct 821 ms 37560 KB Output is correct
6 Correct 818 ms 37496 KB Output is correct
7 Correct 812 ms 37624 KB Output is correct
8 Correct 828 ms 37624 KB Output is correct
9 Correct 776 ms 37500 KB Output is correct
10 Correct 795 ms 37488 KB Output is correct
11 Correct 804 ms 37496 KB Output is correct
12 Correct 809 ms 37580 KB Output is correct
13 Correct 796 ms 37620 KB Output is correct
14 Correct 827 ms 37620 KB Output is correct
15 Correct 841 ms 37496 KB Output is correct
16 Correct 812 ms 37596 KB Output is correct
17 Correct 820 ms 37516 KB Output is correct
18 Correct 833 ms 37632 KB Output is correct
19 Correct 836 ms 37528 KB Output is correct
20 Correct 829 ms 37520 KB Output is correct
21 Correct 792 ms 37624 KB Output is correct
22 Correct 806 ms 38296 KB Output is correct
23 Correct 801 ms 38212 KB Output is correct
24 Correct 786 ms 38136 KB Output is correct
25 Correct 794 ms 38264 KB Output is correct
26 Correct 813 ms 38372 KB Output is correct
27 Correct 827 ms 38204 KB Output is correct
28 Correct 792 ms 38316 KB Output is correct
29 Correct 799 ms 38264 KB Output is correct
30 Correct 799 ms 38264 KB Output is correct
31 Correct 798 ms 38136 KB Output is correct
32 Correct 811 ms 38264 KB Output is correct
33 Correct 791 ms 38204 KB Output is correct
34 Correct 834 ms 38392 KB Output is correct
35 Correct 819 ms 38168 KB Output is correct
36 Correct 820 ms 38136 KB Output is correct
37 Correct 837 ms 38292 KB Output is correct
38 Correct 838 ms 38136 KB Output is correct
39 Correct 802 ms 38136 KB Output is correct
40 Correct 805 ms 38264 KB Output is correct
41 Correct 800 ms 38520 KB Output is correct
42 Correct 812 ms 38224 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 37752 KB Output is correct
2 Correct 805 ms 37624 KB Output is correct
3 Correct 809 ms 37496 KB Output is correct
4 Correct 810 ms 37496 KB Output is correct
5 Correct 821 ms 37560 KB Output is correct
6 Correct 818 ms 37496 KB Output is correct
7 Correct 812 ms 37624 KB Output is correct
8 Correct 828 ms 37624 KB Output is correct
9 Correct 776 ms 37500 KB Output is correct
10 Correct 795 ms 37488 KB Output is correct
11 Correct 804 ms 37496 KB Output is correct
12 Correct 809 ms 37580 KB Output is correct
13 Correct 796 ms 37620 KB Output is correct
14 Correct 827 ms 37620 KB Output is correct
15 Correct 841 ms 37496 KB Output is correct
16 Correct 812 ms 37596 KB Output is correct
17 Correct 820 ms 37516 KB Output is correct
18 Correct 833 ms 37632 KB Output is correct
19 Correct 836 ms 37528 KB Output is correct
20 Correct 829 ms 37520 KB Output is correct
21 Correct 792 ms 37624 KB Output is correct
22 Correct 806 ms 38296 KB Output is correct
23 Correct 801 ms 38212 KB Output is correct
24 Correct 786 ms 38136 KB Output is correct
25 Correct 794 ms 38264 KB Output is correct
26 Correct 813 ms 38372 KB Output is correct
27 Correct 827 ms 38204 KB Output is correct
28 Correct 792 ms 38316 KB Output is correct
29 Correct 799 ms 38264 KB Output is correct
30 Correct 799 ms 38264 KB Output is correct
31 Correct 798 ms 38136 KB Output is correct
32 Correct 811 ms 38264 KB Output is correct
33 Correct 791 ms 38204 KB Output is correct
34 Correct 834 ms 38392 KB Output is correct
35 Correct 819 ms 38168 KB Output is correct
36 Correct 820 ms 38136 KB Output is correct
37 Correct 837 ms 38292 KB Output is correct
38 Correct 838 ms 38136 KB Output is correct
39 Correct 802 ms 38136 KB Output is correct
40 Correct 805 ms 38264 KB Output is correct
41 Correct 800 ms 38520 KB Output is correct
42 Correct 812 ms 38224 KB Output is correct
43 Correct 841 ms 38580 KB Output is correct
44 Correct 845 ms 38520 KB Output is correct
45 Correct 841 ms 38508 KB Output is correct
46 Correct 855 ms 38520 KB Output is correct
47 Correct 837 ms 38508 KB Output is correct
48 Correct 832 ms 38520 KB Output is correct
49 Correct 842 ms 38616 KB Output is correct
50 Correct 839 ms 38700 KB Output is correct
51 Correct 832 ms 38588 KB Output is correct
52 Correct 837 ms 38648 KB Output is correct
53 Correct 858 ms 38520 KB Output is correct
54 Correct 847 ms 38592 KB Output is correct
55 Correct 855 ms 38520 KB Output is correct
56 Correct 845 ms 38520 KB Output is correct
57 Correct 841 ms 38500 KB Output is correct
58 Correct 821 ms 38512 KB Output is correct
59 Correct 830 ms 38520 KB Output is correct
60 Correct 829 ms 38516 KB Output is correct
61 Correct 828 ms 38700 KB Output is correct
62 Correct 840 ms 38520 KB Output is correct
63 Correct 840 ms 38520 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 794 ms 37752 KB Output is correct
2 Correct 805 ms 37624 KB Output is correct
3 Correct 809 ms 37496 KB Output is correct
4 Correct 810 ms 37496 KB Output is correct
5 Correct 821 ms 37560 KB Output is correct
6 Correct 818 ms 37496 KB Output is correct
7 Correct 812 ms 37624 KB Output is correct
8 Correct 828 ms 37624 KB Output is correct
9 Correct 776 ms 37500 KB Output is correct
10 Correct 795 ms 37488 KB Output is correct
11 Correct 804 ms 37496 KB Output is correct
12 Correct 809 ms 37580 KB Output is correct
13 Correct 796 ms 37620 KB Output is correct
14 Correct 827 ms 37620 KB Output is correct
15 Correct 841 ms 37496 KB Output is correct
16 Correct 812 ms 37596 KB Output is correct
17 Correct 820 ms 37516 KB Output is correct
18 Correct 833 ms 37632 KB Output is correct
19 Correct 836 ms 37528 KB Output is correct
20 Correct 829 ms 37520 KB Output is correct
21 Correct 792 ms 37624 KB Output is correct
22 Correct 806 ms 38296 KB Output is correct
23 Correct 801 ms 38212 KB Output is correct
24 Correct 786 ms 38136 KB Output is correct
25 Correct 794 ms 38264 KB Output is correct
26 Correct 813 ms 38372 KB Output is correct
27 Correct 827 ms 38204 KB Output is correct
28 Correct 792 ms 38316 KB Output is correct
29 Correct 799 ms 38264 KB Output is correct
30 Correct 799 ms 38264 KB Output is correct
31 Correct 798 ms 38136 KB Output is correct
32 Correct 811 ms 38264 KB Output is correct
33 Correct 791 ms 38204 KB Output is correct
34 Correct 834 ms 38392 KB Output is correct
35 Correct 819 ms 38168 KB Output is correct
36 Correct 820 ms 38136 KB Output is correct
37 Correct 837 ms 38292 KB Output is correct
38 Correct 838 ms 38136 KB Output is correct
39 Correct 802 ms 38136 KB Output is correct
40 Correct 805 ms 38264 KB Output is correct
41 Correct 800 ms 38520 KB Output is correct
42 Correct 812 ms 38224 KB Output is correct
43 Correct 841 ms 38580 KB Output is correct
44 Correct 845 ms 38520 KB Output is correct
45 Correct 841 ms 38508 KB Output is correct
46 Correct 855 ms 38520 KB Output is correct
47 Correct 837 ms 38508 KB Output is correct
48 Correct 832 ms 38520 KB Output is correct
49 Correct 842 ms 38616 KB Output is correct
50 Correct 839 ms 38700 KB Output is correct
51 Correct 832 ms 38588 KB Output is correct
52 Correct 837 ms 38648 KB Output is correct
53 Correct 858 ms 38520 KB Output is correct
54 Correct 847 ms 38592 KB Output is correct
55 Correct 855 ms 38520 KB Output is correct
56 Correct 845 ms 38520 KB Output is correct
57 Correct 841 ms 38500 KB Output is correct
58 Correct 821 ms 38512 KB Output is correct
59 Correct 830 ms 38520 KB Output is correct
60 Correct 829 ms 38516 KB Output is correct
61 Correct 828 ms 38700 KB Output is correct
62 Correct 840 ms 38520 KB Output is correct
63 Correct 840 ms 38520 KB Output is correct
64 Correct 986 ms 38904 KB Output is correct
65 Correct 997 ms 38832 KB Output is correct
66 Correct 967 ms 38820 KB Output is correct
67 Correct 977 ms 38908 KB Output is correct
68 Correct 997 ms 38776 KB Output is correct
69 Correct 969 ms 38776 KB Output is correct
70 Correct 976 ms 38908 KB Output is correct
71 Correct 1006 ms 38824 KB Output is correct
72 Correct 1004 ms 38824 KB Output is correct
73 Correct 1053 ms 38808 KB Output is correct
74 Correct 995 ms 38776 KB Output is correct
75 Correct 990 ms 38760 KB Output is correct
76 Correct 988 ms 38908 KB Output is correct
77 Correct 994 ms 38776 KB Output is correct
78 Correct 962 ms 38776 KB Output is correct
79 Correct 974 ms 38776 KB Output is correct
80 Correct 1004 ms 38776 KB Output is correct
81 Correct 1000 ms 38820 KB Output is correct
82 Correct 1051 ms 38876 KB Output is correct
83 Correct 994 ms 39040 KB Output is correct
84 Correct 981 ms 38836 KB Output is correct