oj.uz

답안 #249506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249506 2020-07-15T07:30:07 Z b00n0rp Cubeword (CEOI19_cubeword) C++17
100 / 100
 1071 ms 39040 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------

// #pragma GCC optimize("Ofast,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>---------------------------


*/

template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 


// ----------------------</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:192:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
cubeword.cpp:195:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 902 ms 37624 KB Output is correct
2 Correct 854 ms 37680 KB Output is correct
3 Correct 861 ms 37516 KB Output is correct
4 Correct 846 ms 37536 KB Output is correct
5 Correct 859 ms 37512 KB Output is correct
6 Correct 867 ms 37624 KB Output is correct
7 Correct 836 ms 37624 KB Output is correct
8 Correct 898 ms 37512 KB Output is correct
9 Correct 853 ms 37624 KB Output is correct
10 Correct 879 ms 37668 KB Output is correct
11 Correct 831 ms 37624 KB Output is correct
12 Correct 829 ms 37624 KB Output is correct
13 Correct 855 ms 37508 KB Output is correct
14 Correct 801 ms 37628 KB Output is correct
15 Correct 859 ms 37548 KB Output is correct
16 Correct 832 ms 37464 KB Output is correct
17 Correct 829 ms 37512 KB Output is correct
18 Correct 841 ms 37500 KB Output is correct
19 Correct 864 ms 37624 KB Output is correct
20 Correct 827 ms 37528 KB Output is correct
21 Correct 842 ms 37532 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 902 ms 37624 KB Output is correct
2 Correct 854 ms 37680 KB Output is correct
3 Correct 861 ms 37516 KB Output is correct
4 Correct 846 ms 37536 KB Output is correct
5 Correct 859 ms 37512 KB Output is correct
6 Correct 867 ms 37624 KB Output is correct
7 Correct 836 ms 37624 KB Output is correct
8 Correct 898 ms 37512 KB Output is correct
9 Correct 853 ms 37624 KB Output is correct
10 Correct 879 ms 37668 KB Output is correct
11 Correct 831 ms 37624 KB Output is correct
12 Correct 829 ms 37624 KB Output is correct
13 Correct 855 ms 37508 KB Output is correct
14 Correct 801 ms 37628 KB Output is correct
15 Correct 859 ms 37548 KB Output is correct
16 Correct 832 ms 37464 KB Output is correct
17 Correct 829 ms 37512 KB Output is correct
18 Correct 841 ms 37500 KB Output is correct
19 Correct 864 ms 37624 KB Output is correct
20 Correct 827 ms 37528 KB Output is correct
21 Correct 842 ms 37532 KB Output is correct
22 Correct 819 ms 38264 KB Output is correct
23 Correct 848 ms 38240 KB Output is correct
24 Correct 822 ms 38136 KB Output is correct
25 Correct 811 ms 38136 KB Output is correct
26 Correct 870 ms 38204 KB Output is correct
27 Correct 889 ms 38264 KB Output is correct
28 Correct 845 ms 38264 KB Output is correct
29 Correct 837 ms 38264 KB Output is correct
30 Correct 823 ms 38264 KB Output is correct
31 Correct 843 ms 38264 KB Output is correct
32 Correct 895 ms 38268 KB Output is correct
33 Correct 839 ms 38392 KB Output is correct
34 Correct 856 ms 38136 KB Output is correct
35 Correct 882 ms 38204 KB Output is correct
36 Correct 846 ms 38332 KB Output is correct
37 Correct 865 ms 38264 KB Output is correct
38 Correct 903 ms 38136 KB Output is correct
39 Correct 855 ms 38332 KB Output is correct
40 Correct 841 ms 38136 KB Output is correct
41 Correct 844 ms 38212 KB Output is correct
42 Correct 853 ms 38220 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 902 ms 37624 KB Output is correct
2 Correct 854 ms 37680 KB Output is correct
3 Correct 861 ms 37516 KB Output is correct
4 Correct 846 ms 37536 KB Output is correct
5 Correct 859 ms 37512 KB Output is correct
6 Correct 867 ms 37624 KB Output is correct
7 Correct 836 ms 37624 KB Output is correct
8 Correct 898 ms 37512 KB Output is correct
9 Correct 853 ms 37624 KB Output is correct
10 Correct 879 ms 37668 KB Output is correct
11 Correct 831 ms 37624 KB Output is correct
12 Correct 829 ms 37624 KB Output is correct
13 Correct 855 ms 37508 KB Output is correct
14 Correct 801 ms 37628 KB Output is correct
15 Correct 859 ms 37548 KB Output is correct
16 Correct 832 ms 37464 KB Output is correct
17 Correct 829 ms 37512 KB Output is correct
18 Correct 841 ms 37500 KB Output is correct
19 Correct 864 ms 37624 KB Output is correct
20 Correct 827 ms 37528 KB Output is correct
21 Correct 842 ms 37532 KB Output is correct
22 Correct 819 ms 38264 KB Output is correct
23 Correct 848 ms 38240 KB Output is correct
24 Correct 822 ms 38136 KB Output is correct
25 Correct 811 ms 38136 KB Output is correct
26 Correct 870 ms 38204 KB Output is correct
27 Correct 889 ms 38264 KB Output is correct
28 Correct 845 ms 38264 KB Output is correct
29 Correct 837 ms 38264 KB Output is correct
30 Correct 823 ms 38264 KB Output is correct
31 Correct 843 ms 38264 KB Output is correct
32 Correct 895 ms 38268 KB Output is correct
33 Correct 839 ms 38392 KB Output is correct
34 Correct 856 ms 38136 KB Output is correct
35 Correct 882 ms 38204 KB Output is correct
36 Correct 846 ms 38332 KB Output is correct
37 Correct 865 ms 38264 KB Output is correct
38 Correct 903 ms 38136 KB Output is correct
39 Correct 855 ms 38332 KB Output is correct
40 Correct 841 ms 38136 KB Output is correct
41 Correct 844 ms 38212 KB Output is correct
42 Correct 853 ms 38220 KB Output is correct
43 Correct 902 ms 38592 KB Output is correct
44 Correct 889 ms 38652 KB Output is correct
45 Correct 895 ms 38496 KB Output is correct
46 Correct 914 ms 38620 KB Output is correct
47 Correct 879 ms 38508 KB Output is correct
48 Correct 893 ms 38648 KB Output is correct
49 Correct 884 ms 38556 KB Output is correct
50 Correct 897 ms 38524 KB Output is correct
51 Correct 863 ms 38520 KB Output is correct
52 Correct 952 ms 38392 KB Output is correct
53 Correct 944 ms 38520 KB Output is correct
54 Correct 927 ms 38476 KB Output is correct
55 Correct 916 ms 38520 KB Output is correct
56 Correct 884 ms 38520 KB Output is correct
57 Correct 908 ms 38520 KB Output is correct
58 Correct 891 ms 38648 KB Output is correct
59 Correct 874 ms 38456 KB Output is correct
60 Correct 890 ms 38652 KB Output is correct
61 Correct 904 ms 38564 KB Output is correct
62 Correct 882 ms 38612 KB Output is correct
63 Correct 967 ms 38524 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 902 ms 37624 KB Output is correct
2 Correct 854 ms 37680 KB Output is correct
3 Correct 861 ms 37516 KB Output is correct
4 Correct 846 ms 37536 KB Output is correct
5 Correct 859 ms 37512 KB Output is correct
6 Correct 867 ms 37624 KB Output is correct
7 Correct 836 ms 37624 KB Output is correct
8 Correct 898 ms 37512 KB Output is correct
9 Correct 853 ms 37624 KB Output is correct
10 Correct 879 ms 37668 KB Output is correct
11 Correct 831 ms 37624 KB Output is correct
12 Correct 829 ms 37624 KB Output is correct
13 Correct 855 ms 37508 KB Output is correct
14 Correct 801 ms 37628 KB Output is correct
15 Correct 859 ms 37548 KB Output is correct
16 Correct 832 ms 37464 KB Output is correct
17 Correct 829 ms 37512 KB Output is correct
18 Correct 841 ms 37500 KB Output is correct
19 Correct 864 ms 37624 KB Output is correct
20 Correct 827 ms 37528 KB Output is correct
21 Correct 842 ms 37532 KB Output is correct
22 Correct 819 ms 38264 KB Output is correct
23 Correct 848 ms 38240 KB Output is correct
24 Correct 822 ms 38136 KB Output is correct
25 Correct 811 ms 38136 KB Output is correct
26 Correct 870 ms 38204 KB Output is correct
27 Correct 889 ms 38264 KB Output is correct
28 Correct 845 ms 38264 KB Output is correct
29 Correct 837 ms 38264 KB Output is correct
30 Correct 823 ms 38264 KB Output is correct
31 Correct 843 ms 38264 KB Output is correct
32 Correct 895 ms 38268 KB Output is correct
33 Correct 839 ms 38392 KB Output is correct
34 Correct 856 ms 38136 KB Output is correct
35 Correct 882 ms 38204 KB Output is correct
36 Correct 846 ms 38332 KB Output is correct
37 Correct 865 ms 38264 KB Output is correct
38 Correct 903 ms 38136 KB Output is correct
39 Correct 855 ms 38332 KB Output is correct
40 Correct 841 ms 38136 KB Output is correct
41 Correct 844 ms 38212 KB Output is correct
42 Correct 853 ms 38220 KB Output is correct
43 Correct 902 ms 38592 KB Output is correct
44 Correct 889 ms 38652 KB Output is correct
45 Correct 895 ms 38496 KB Output is correct
46 Correct 914 ms 38620 KB Output is correct
47 Correct 879 ms 38508 KB Output is correct
48 Correct 893 ms 38648 KB Output is correct
49 Correct 884 ms 38556 KB Output is correct
50 Correct 897 ms 38524 KB Output is correct
51 Correct 863 ms 38520 KB Output is correct
52 Correct 952 ms 38392 KB Output is correct
53 Correct 944 ms 38520 KB Output is correct
54 Correct 927 ms 38476 KB Output is correct
55 Correct 916 ms 38520 KB Output is correct
56 Correct 884 ms 38520 KB Output is correct
57 Correct 908 ms 38520 KB Output is correct
58 Correct 891 ms 38648 KB Output is correct
59 Correct 874 ms 38456 KB Output is correct
60 Correct 890 ms 38652 KB Output is correct
61 Correct 904 ms 38564 KB Output is correct
62 Correct 882 ms 38612 KB Output is correct
63 Correct 967 ms 38524 KB Output is correct
64 Correct 1012 ms 38828 KB Output is correct
65 Correct 981 ms 38832 KB Output is correct
66 Correct 1004 ms 38904 KB Output is correct
67 Correct 1018 ms 38828 KB Output is correct
68 Correct 1010 ms 38904 KB Output is correct
69 Correct 1071 ms 38748 KB Output is correct
70 Correct 1024 ms 38908 KB Output is correct
71 Correct 1008 ms 38820 KB Output is correct
72 Correct 1022 ms 38776 KB Output is correct
73 Correct 1016 ms 38776 KB Output is correct
74 Correct 1004 ms 38776 KB Output is correct
75 Correct 1028 ms 38776 KB Output is correct
76 Correct 995 ms 38900 KB Output is correct
77 Correct 1000 ms 38776 KB Output is correct
78 Correct 1008 ms 39040 KB Output is correct
79 Correct 1010 ms 38812 KB Output is correct
80 Correct 982 ms 38828 KB Output is correct
81 Correct 973 ms 38912 KB Output is correct
82 Correct 982 ms 38932 KB Output is correct
83 Correct 998 ms 38928 KB Output is correct
84 Correct 969 ms 38904 KB Output is correct