oj.uz

답안 #260474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260474 2020-08-10T10:50:09 Z stefantaga Cubeword (CEOI19_cubeword) C++14
100 / 100
 818 ms 19044 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi," ",x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }

//===================//
//  Added libraries  //
//===================//

// mod library
ll MOD=998244353;

inline ll mod(ll x_) {
    return (x_)%MOD;
}
ll modpow(ll x_, ll N_) {
    if(N_ == 0) return 1;
    ll a = modpow(x_,N_/2);
    a = (a*a)%MOD;
    if(N_%2) a = (a*x_)%MOD;
    return a;
}
ll inv(ll x_) {
    return modpow(x_, MOD-2);
}
class mi {
public:
    mi(ll v=0) {value = v;}
    mi  operator+ (ll rs) {return value+rs;}
    mi  operator- (ll rs) {return value-rs+MOD;}
    mi  operator* (ll rs) {return mod(value*rs);}
    mi  operator/ (ll rs) {return mod(value*inv(rs));}
    mi& operator+=(ll rs) {*this = (*this)+rs; return *this;}
    mi& operator-=(ll rs) {*this = (*this)-rs; return *this;}
    mi& operator*=(ll rs) {*this = (*this)*rs; return *this;}
    mi& operator/=(ll rs) {*this = (*this)/rs; return *this;}
    operator ll&() {return value;}

    ll value;
};
typedef vector<mi> vmi;

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 62;
int n;
string s;
set<string> S;
mi cnt[11][MX][MX];
mi ways[MX][MX][MX];

void modify(char& c) {
    if(c >= 'a' && c <= 'z') {
        c = c-'a';
    } else if(c >= 'A' && c <= 'Z') {
        c = c-'A'+26;
    } else {
        c = c-'0'+52;
    }
}
void addS() {
    if(S.count(s)) return;
    S.insert(s);
    cnt[s.sz][s[0]][s.back()] += 1ll;
}

void program() {
    IN(n);
    RE(i,11) RE(j,MX) RE(k,MX) cnt[i][j][k] = 0;
    RE(i,n) {
        IN(s);
        FOR(c,s) modify(c);
        addS();
        reverse(all(s));
        addS();
    }

    int fact[5], f[5];
    fact[0] = 1;
    RE(i,4) fact[i+1]=fact[i]*(i+1);

    mi ans;
    REP(l,3,11) {
        RE(i,MX) REP(j,i,MX) REP(k,j,MX) ways[i][j][k] = 0;

        RE(i,MX) REP(j,i,MX) REP(k,j,MX) RE(m,MX) ways[i][j][k] += cnt[l][i][m]*cnt[l][j][m]*cnt[l][k][m];
        RE(i,MX) REP(j,i,MX) REP(k,j,MX) ways[i][j][k] %= MOD;
        RE(i,MX) REP(j,i,MX) REP(k,j,MX) REP(m,k,MX) {
            mi added = ways[i][j][k]*ways[i][j][m]*ways[i][k][m]*ways[j][k][m];
            f[0]=i, f[1]=j, f[2]=k, f[3]=m;
            char ways=24, cnt=1;
            REP(i,1,4) {
                if(f[i]!=f[i-1]) {
                    ways/=fact[cnt];
                    cnt=0;
                }
                cnt++;
            }
            ways/=fact[cnt];
            ans += added*ll(ways);
        }
    }
    ans %= MOD;
    OUTL((ll)ans);
}

Compilation message

cubeword.cpp: In function 'void addS()':
cubeword.cpp:114:19: warning: array subscript has type 'char' [-Wchar-subscripts]
     cnt[s.sz][s[0]][s.back()] += 1ll;
                   ^
cubeword.cpp:114:29: warning: array subscript has type 'char' [-Wchar-subscripts]
     cnt[s.sz][s[0]][s.back()] += 1ll;
                             ^
cubeword.cpp: In function 'void program()':
cubeword.cpp:144:35: warning: array subscript has type 'char' [-Wchar-subscripts]
                     ways/=fact[cnt];
                                   ^
cubeword.cpp:149:27: warning: array subscript has type 'char' [-Wchar-subscripts]
             ways/=fact[cnt];
                           ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 703 ms 17020 KB Output is correct
2 Correct 697 ms 17976 KB Output is correct
3 Correct 691 ms 17912 KB Output is correct
4 Correct 688 ms 18040 KB Output is correct
5 Correct 694 ms 18040 KB Output is correct
6 Correct 731 ms 18040 KB Output is correct
7 Correct 707 ms 17872 KB Output is correct
8 Correct 709 ms 17940 KB Output is correct
9 Correct 697 ms 18040 KB Output is correct
10 Correct 697 ms 17944 KB Output is correct
11 Correct 696 ms 18040 KB Output is correct
12 Correct 709 ms 17824 KB Output is correct
13 Correct 696 ms 18040 KB Output is correct
14 Correct 697 ms 17916 KB Output is correct
15 Correct 700 ms 18044 KB Output is correct
16 Correct 685 ms 18168 KB Output is correct
17 Correct 708 ms 18040 KB Output is correct
18 Correct 701 ms 17912 KB Output is correct
19 Correct 701 ms 17916 KB Output is correct
20 Correct 714 ms 17940 KB Output is correct
21 Correct 706 ms 17912 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 703 ms 17020 KB Output is correct
2 Correct 697 ms 17976 KB Output is correct
3 Correct 691 ms 17912 KB Output is correct
4 Correct 688 ms 18040 KB Output is correct
5 Correct 694 ms 18040 KB Output is correct
6 Correct 731 ms 18040 KB Output is correct
7 Correct 707 ms 17872 KB Output is correct
8 Correct 709 ms 17940 KB Output is correct
9 Correct 697 ms 18040 KB Output is correct
10 Correct 697 ms 17944 KB Output is correct
11 Correct 696 ms 18040 KB Output is correct
12 Correct 709 ms 17824 KB Output is correct
13 Correct 696 ms 18040 KB Output is correct
14 Correct 697 ms 17916 KB Output is correct
15 Correct 700 ms 18044 KB Output is correct
16 Correct 685 ms 18168 KB Output is correct
17 Correct 708 ms 18040 KB Output is correct
18 Correct 701 ms 17912 KB Output is correct
19 Correct 701 ms 17916 KB Output is correct
20 Correct 714 ms 17940 KB Output is correct
21 Correct 706 ms 17912 KB Output is correct
22 Correct 692 ms 18712 KB Output is correct
23 Correct 684 ms 18424 KB Output is correct
24 Correct 686 ms 18552 KB Output is correct
25 Correct 703 ms 18424 KB Output is correct
26 Correct 702 ms 18424 KB Output is correct
27 Correct 697 ms 18552 KB Output is correct
28 Correct 702 ms 18556 KB Output is correct
29 Correct 705 ms 18592 KB Output is correct
30 Correct 743 ms 18504 KB Output is correct
31 Correct 818 ms 18424 KB Output is correct
32 Correct 690 ms 18492 KB Output is correct
33 Correct 794 ms 18424 KB Output is correct
34 Correct 697 ms 18424 KB Output is correct
35 Correct 705 ms 18424 KB Output is correct
36 Correct 720 ms 18516 KB Output is correct
37 Correct 749 ms 18512 KB Output is correct
38 Correct 743 ms 18504 KB Output is correct
39 Correct 787 ms 18552 KB Output is correct
40 Correct 761 ms 18552 KB Output is correct
41 Correct 710 ms 18524 KB Output is correct
42 Correct 697 ms 18524 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 703 ms 17020 KB Output is correct
2 Correct 697 ms 17976 KB Output is correct
3 Correct 691 ms 17912 KB Output is correct
4 Correct 688 ms 18040 KB Output is correct
5 Correct 694 ms 18040 KB Output is correct
6 Correct 731 ms 18040 KB Output is correct
7 Correct 707 ms 17872 KB Output is correct
8 Correct 709 ms 17940 KB Output is correct
9 Correct 697 ms 18040 KB Output is correct
10 Correct 697 ms 17944 KB Output is correct
11 Correct 696 ms 18040 KB Output is correct
12 Correct 709 ms 17824 KB Output is correct
13 Correct 696 ms 18040 KB Output is correct
14 Correct 697 ms 17916 KB Output is correct
15 Correct 700 ms 18044 KB Output is correct
16 Correct 685 ms 18168 KB Output is correct
17 Correct 708 ms 18040 KB Output is correct
18 Correct 701 ms 17912 KB Output is correct
19 Correct 701 ms 17916 KB Output is correct
20 Correct 714 ms 17940 KB Output is correct
21 Correct 706 ms 17912 KB Output is correct
22 Correct 692 ms 18712 KB Output is correct
23 Correct 684 ms 18424 KB Output is correct
24 Correct 686 ms 18552 KB Output is correct
25 Correct 703 ms 18424 KB Output is correct
26 Correct 702 ms 18424 KB Output is correct
27 Correct 697 ms 18552 KB Output is correct
28 Correct 702 ms 18556 KB Output is correct
29 Correct 705 ms 18592 KB Output is correct
30 Correct 743 ms 18504 KB Output is correct
31 Correct 818 ms 18424 KB Output is correct
32 Correct 690 ms 18492 KB Output is correct
33 Correct 794 ms 18424 KB Output is correct
34 Correct 697 ms 18424 KB Output is correct
35 Correct 705 ms 18424 KB Output is correct
36 Correct 720 ms 18516 KB Output is correct
37 Correct 749 ms 18512 KB Output is correct
38 Correct 743 ms 18504 KB Output is correct
39 Correct 787 ms 18552 KB Output is correct
40 Correct 761 ms 18552 KB Output is correct
41 Correct 710 ms 18524 KB Output is correct
42 Correct 697 ms 18524 KB Output is correct
43 Correct 698 ms 18768 KB Output is correct
44 Correct 688 ms 18808 KB Output is correct
45 Correct 680 ms 18808 KB Output is correct
46 Correct 690 ms 18808 KB Output is correct
47 Correct 695 ms 18688 KB Output is correct
48 Correct 699 ms 18688 KB Output is correct
49 Correct 710 ms 18716 KB Output is correct
50 Correct 726 ms 18808 KB Output is correct
51 Correct 726 ms 18716 KB Output is correct
52 Correct 691 ms 18680 KB Output is correct
53 Correct 691 ms 18696 KB Output is correct
54 Correct 681 ms 18696 KB Output is correct
55 Correct 686 ms 18680 KB Output is correct
56 Correct 676 ms 18808 KB Output is correct
57 Correct 689 ms 18652 KB Output is correct
58 Correct 689 ms 18688 KB Output is correct
59 Correct 700 ms 18732 KB Output is correct
60 Correct 714 ms 18820 KB Output is correct
61 Correct 683 ms 18680 KB Output is correct
62 Correct 697 ms 18808 KB Output is correct
63 Correct 698 ms 18656 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 703 ms 17020 KB Output is correct
2 Correct 697 ms 17976 KB Output is correct
3 Correct 691 ms 17912 KB Output is correct
4 Correct 688 ms 18040 KB Output is correct
5 Correct 694 ms 18040 KB Output is correct
6 Correct 731 ms 18040 KB Output is correct
7 Correct 707 ms 17872 KB Output is correct
8 Correct 709 ms 17940 KB Output is correct
9 Correct 697 ms 18040 KB Output is correct
10 Correct 697 ms 17944 KB Output is correct
11 Correct 696 ms 18040 KB Output is correct
12 Correct 709 ms 17824 KB Output is correct
13 Correct 696 ms 18040 KB Output is correct
14 Correct 697 ms 17916 KB Output is correct
15 Correct 700 ms 18044 KB Output is correct
16 Correct 685 ms 18168 KB Output is correct
17 Correct 708 ms 18040 KB Output is correct
18 Correct 701 ms 17912 KB Output is correct
19 Correct 701 ms 17916 KB Output is correct
20 Correct 714 ms 17940 KB Output is correct
21 Correct 706 ms 17912 KB Output is correct
22 Correct 692 ms 18712 KB Output is correct
23 Correct 684 ms 18424 KB Output is correct
24 Correct 686 ms 18552 KB Output is correct
25 Correct 703 ms 18424 KB Output is correct
26 Correct 702 ms 18424 KB Output is correct
27 Correct 697 ms 18552 KB Output is correct
28 Correct 702 ms 18556 KB Output is correct
29 Correct 705 ms 18592 KB Output is correct
30 Correct 743 ms 18504 KB Output is correct
31 Correct 818 ms 18424 KB Output is correct
32 Correct 690 ms 18492 KB Output is correct
33 Correct 794 ms 18424 KB Output is correct
34 Correct 697 ms 18424 KB Output is correct
35 Correct 705 ms 18424 KB Output is correct
36 Correct 720 ms 18516 KB Output is correct
37 Correct 749 ms 18512 KB Output is correct
38 Correct 743 ms 18504 KB Output is correct
39 Correct 787 ms 18552 KB Output is correct
40 Correct 761 ms 18552 KB Output is correct
41 Correct 710 ms 18524 KB Output is correct
42 Correct 697 ms 18524 KB Output is correct
43 Correct 698 ms 18768 KB Output is correct
44 Correct 688 ms 18808 KB Output is correct
45 Correct 680 ms 18808 KB Output is correct
46 Correct 690 ms 18808 KB Output is correct
47 Correct 695 ms 18688 KB Output is correct
48 Correct 699 ms 18688 KB Output is correct
49 Correct 710 ms 18716 KB Output is correct
50 Correct 726 ms 18808 KB Output is correct
51 Correct 726 ms 18716 KB Output is correct
52 Correct 691 ms 18680 KB Output is correct
53 Correct 691 ms 18696 KB Output is correct
54 Correct 681 ms 18696 KB Output is correct
55 Correct 686 ms 18680 KB Output is correct
56 Correct 676 ms 18808 KB Output is correct
57 Correct 689 ms 18652 KB Output is correct
58 Correct 689 ms 18688 KB Output is correct
59 Correct 700 ms 18732 KB Output is correct
60 Correct 714 ms 18820 KB Output is correct
61 Correct 683 ms 18680 KB Output is correct
62 Correct 697 ms 18808 KB Output is correct
63 Correct 698 ms 18656 KB Output is correct
64 Correct 738 ms 19044 KB Output is correct
65 Correct 698 ms 18808 KB Output is correct
66 Correct 720 ms 18924 KB Output is correct
67 Correct 724 ms 18920 KB Output is correct
68 Correct 713 ms 18924 KB Output is correct
69 Correct 706 ms 18920 KB Output is correct
70 Correct 714 ms 18936 KB Output is correct
71 Correct 704 ms 18808 KB Output is correct
72 Correct 729 ms 18832 KB Output is correct
73 Correct 707 ms 18820 KB Output is correct
74 Correct 736 ms 18808 KB Output is correct
75 Correct 718 ms 18936 KB Output is correct
76 Correct 718 ms 18936 KB Output is correct
77 Correct 724 ms 18808 KB Output is correct
78 Correct 727 ms 18808 KB Output is correct
79 Correct 718 ms 18936 KB Output is correct
80 Correct 702 ms 18936 KB Output is correct
81 Correct 713 ms 18936 KB Output is correct
82 Correct 702 ms 18936 KB Output is correct
83 Correct 707 ms 19020 KB Output is correct
84 Correct 711 ms 18936 KB Output is correct