oj.uz

Submission #257999

# Submission time Handle Problem Language Result Execution time Memory
257999 2020-08-05T07:45:13 Z MarcoMeijer Cubeword (CEOI19_cubeword) C++14
84 / 100
 638 ms 52472 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 = 42;
int n;
string s;
set<string> S;
mi cnt[11][MX][MX];
mi ways1[MX][MX][MX];
mi ways2[MX][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;
}
mi ways(int i, int j, int k) {
    int f[3];
    f[0]=i; f[1]=j; f[2]=k;
    sort(f,f+3);
    return ways1[f[0]][f[1]][f[2]];
}

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();
    }

    mi ans;
    REP(l,3,11) {
        RE(i,MX) REP(j,i,MX) REP(k,j,MX) ways1[i][j][k] = 0;
        RE(i,MX) REP(j,i,MX) RE(k,MX) REP(m,k,MX) ways2[i][j][k][m] = 0;
        
        RE(i,MX) REP(j,i,MX) REP(k,j,MX) RE(m,MX) ways1[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) ways1[i][j][k] %= MOD;
        RE(i,MX) REP(j,i,MX) RE(k,MX) REP(m,k,MX) {
            ways2[i][j][k][m] = ways(k,i,j)*ways(m,i,j);
        }
        RE(i,MX) REP(j,i,MX) RE(k,MX) REP(m,k,MX) {
            ans += ll(ways2[i][j][k][m]*ways2[k][m][i][j])*(i==j?1ll:2ll)*(k==m?1ll:2ll);
        }
    }
    ans %= MOD;
    OUTL((ll)ans);
}

Compilation message

cubeword.cpp: In function 'void addS()':
cubeword.cpp:115:19: warning: array subscript has type 'char' [-Wchar-subscripts]
     cnt[s.sz][s[0]][s.back()] += 1ll;
                   ^
cubeword.cpp:115:29: warning: array subscript has type 'char' [-Wchar-subscripts]
     cnt[s.sz][s[0]][s.back()] += 1ll;
                             ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 39928 KB Output is correct
2 Correct 571 ms 39956 KB Output is correct
3 Correct 550 ms 39904 KB Output is correct
4 Correct 614 ms 39928 KB Output is correct
5 Correct 566 ms 39940 KB Output is correct
6 Correct 634 ms 39884 KB Output is correct
7 Correct 582 ms 39928 KB Output is correct
8 Correct 598 ms 39928 KB Output is correct
9 Correct 611 ms 40028 KB Output is correct
10 Correct 638 ms 39880 KB Output is correct
11 Correct 542 ms 39916 KB Output is correct
12 Correct 551 ms 39948 KB Output is correct
13 Correct 559 ms 39980 KB Output is correct
14 Correct 585 ms 39928 KB Output is correct
15 Correct 602 ms 40748 KB Output is correct
16 Correct 555 ms 41012 KB Output is correct
17 Correct 533 ms 40936 KB Output is correct
18 Correct 536 ms 40928 KB Output is correct
19 Correct 570 ms 40896 KB Output is correct
20 Correct 582 ms 40824 KB Output is correct
21 Correct 548 ms 40824 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 39928 KB Output is correct
2 Correct 571 ms 39956 KB Output is correct
3 Correct 550 ms 39904 KB Output is correct
4 Correct 614 ms 39928 KB Output is correct
5 Correct 566 ms 39940 KB Output is correct
6 Correct 634 ms 39884 KB Output is correct
7 Correct 582 ms 39928 KB Output is correct
8 Correct 598 ms 39928 KB Output is correct
9 Correct 611 ms 40028 KB Output is correct
10 Correct 638 ms 39880 KB Output is correct
11 Correct 542 ms 39916 KB Output is correct
12 Correct 551 ms 39948 KB Output is correct
13 Correct 559 ms 39980 KB Output is correct
14 Correct 585 ms 39928 KB Output is correct
15 Correct 602 ms 40748 KB Output is correct
16 Correct 555 ms 41012 KB Output is correct
17 Correct 533 ms 40936 KB Output is correct
18 Correct 536 ms 40928 KB Output is correct
19 Correct 570 ms 40896 KB Output is correct
20 Correct 582 ms 40824 KB Output is correct
21 Correct 548 ms 40824 KB Output is correct
22 Correct 587 ms 41456 KB Output is correct
23 Correct 532 ms 41468 KB Output is correct
24 Correct 534 ms 41488 KB Output is correct
25 Correct 561 ms 41488 KB Output is correct
26 Correct 543 ms 41504 KB Output is correct
27 Correct 612 ms 41336 KB Output is correct
28 Correct 550 ms 41496 KB Output is correct
29 Correct 555 ms 41592 KB Output is correct
30 Correct 552 ms 41480 KB Output is correct
31 Correct 547 ms 41464 KB Output is correct
32 Correct 567 ms 41480 KB Output is correct
33 Correct 551 ms 41416 KB Output is correct
34 Correct 559 ms 41632 KB Output is correct
35 Correct 549 ms 41328 KB Output is correct
36 Correct 553 ms 41468 KB Output is correct
37 Correct 552 ms 41464 KB Output is correct
38 Correct 581 ms 41380 KB Output is correct
39 Correct 552 ms 41464 KB Output is correct
40 Correct 530 ms 41336 KB Output is correct
41 Correct 549 ms 41464 KB Output is correct
42 Correct 542 ms 41464 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 39928 KB Output is correct
2 Correct 571 ms 39956 KB Output is correct
3 Correct 550 ms 39904 KB Output is correct
4 Correct 614 ms 39928 KB Output is correct
5 Correct 566 ms 39940 KB Output is correct
6 Correct 634 ms 39884 KB Output is correct
7 Correct 582 ms 39928 KB Output is correct
8 Correct 598 ms 39928 KB Output is correct
9 Correct 611 ms 40028 KB Output is correct
10 Correct 638 ms 39880 KB Output is correct
11 Correct 542 ms 39916 KB Output is correct
12 Correct 551 ms 39948 KB Output is correct
13 Correct 559 ms 39980 KB Output is correct
14 Correct 585 ms 39928 KB Output is correct
15 Correct 602 ms 40748 KB Output is correct
16 Correct 555 ms 41012 KB Output is correct
17 Correct 533 ms 40936 KB Output is correct
18 Correct 536 ms 40928 KB Output is correct
19 Correct 570 ms 40896 KB Output is correct
20 Correct 582 ms 40824 KB Output is correct
21 Correct 548 ms 40824 KB Output is correct
22 Correct 587 ms 41456 KB Output is correct
23 Correct 532 ms 41468 KB Output is correct
24 Correct 534 ms 41488 KB Output is correct
25 Correct 561 ms 41488 KB Output is correct
26 Correct 543 ms 41504 KB Output is correct
27 Correct 612 ms 41336 KB Output is correct
28 Correct 550 ms 41496 KB Output is correct
29 Correct 555 ms 41592 KB Output is correct
30 Correct 552 ms 41480 KB Output is correct
31 Correct 547 ms 41464 KB Output is correct
32 Correct 567 ms 41480 KB Output is correct
33 Correct 551 ms 41416 KB Output is correct
34 Correct 559 ms 41632 KB Output is correct
35 Correct 549 ms 41328 KB Output is correct
36 Correct 553 ms 41468 KB Output is correct
37 Correct 552 ms 41464 KB Output is correct
38 Correct 581 ms 41380 KB Output is correct
39 Correct 552 ms 41464 KB Output is correct
40 Correct 530 ms 41336 KB Output is correct
41 Correct 549 ms 41464 KB Output is correct
42 Correct 542 ms 41464 KB Output is correct
43 Correct 551 ms 41552 KB Output is correct
44 Correct 589 ms 41720 KB Output is correct
45 Correct 587 ms 41636 KB Output is correct
46 Correct 560 ms 41464 KB Output is correct
47 Correct 549 ms 41608 KB Output is correct
48 Correct 555 ms 41748 KB Output is correct
49 Correct 568 ms 41592 KB Output is correct
50 Correct 549 ms 41720 KB Output is correct
51 Correct 548 ms 41720 KB Output is correct
52 Correct 532 ms 41564 KB Output is correct
53 Correct 556 ms 41720 KB Output is correct
54 Correct 540 ms 41592 KB Output is correct
55 Correct 539 ms 41464 KB Output is correct
56 Correct 542 ms 41616 KB Output is correct
57 Correct 568 ms 41468 KB Output is correct
58 Correct 536 ms 41464 KB Output is correct
59 Correct 557 ms 41592 KB Output is correct
60 Correct 601 ms 41552 KB Output is correct
61 Correct 553 ms 41464 KB Output is correct
62 Correct 552 ms 41464 KB Output is correct
63 Correct 550 ms 41692 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 39928 KB Output is correct
2 Correct 571 ms 39956 KB Output is correct
3 Correct 550 ms 39904 KB Output is correct
4 Correct 614 ms 39928 KB Output is correct
5 Correct 566 ms 39940 KB Output is correct
6 Correct 634 ms 39884 KB Output is correct
7 Correct 582 ms 39928 KB Output is correct
8 Correct 598 ms 39928 KB Output is correct
9 Correct 611 ms 40028 KB Output is correct
10 Correct 638 ms 39880 KB Output is correct
11 Correct 542 ms 39916 KB Output is correct
12 Correct 551 ms 39948 KB Output is correct
13 Correct 559 ms 39980 KB Output is correct
14 Correct 585 ms 39928 KB Output is correct
15 Correct 602 ms 40748 KB Output is correct
16 Correct 555 ms 41012 KB Output is correct
17 Correct 533 ms 40936 KB Output is correct
18 Correct 536 ms 40928 KB Output is correct
19 Correct 570 ms 40896 KB Output is correct
20 Correct 582 ms 40824 KB Output is correct
21 Correct 548 ms 40824 KB Output is correct
22 Correct 587 ms 41456 KB Output is correct
23 Correct 532 ms 41468 KB Output is correct
24 Correct 534 ms 41488 KB Output is correct
25 Correct 561 ms 41488 KB Output is correct
26 Correct 543 ms 41504 KB Output is correct
27 Correct 612 ms 41336 KB Output is correct
28 Correct 550 ms 41496 KB Output is correct
29 Correct 555 ms 41592 KB Output is correct
30 Correct 552 ms 41480 KB Output is correct
31 Correct 547 ms 41464 KB Output is correct
32 Correct 567 ms 41480 KB Output is correct
33 Correct 551 ms 41416 KB Output is correct
34 Correct 559 ms 41632 KB Output is correct
35 Correct 549 ms 41328 KB Output is correct
36 Correct 553 ms 41468 KB Output is correct
37 Correct 552 ms 41464 KB Output is correct
38 Correct 581 ms 41380 KB Output is correct
39 Correct 552 ms 41464 KB Output is correct
40 Correct 530 ms 41336 KB Output is correct
41 Correct 549 ms 41464 KB Output is correct
42 Correct 542 ms 41464 KB Output is correct
43 Correct 551 ms 41552 KB Output is correct
44 Correct 589 ms 41720 KB Output is correct
45 Correct 587 ms 41636 KB Output is correct
46 Correct 560 ms 41464 KB Output is correct
47 Correct 549 ms 41608 KB Output is correct
48 Correct 555 ms 41748 KB Output is correct
49 Correct 568 ms 41592 KB Output is correct
50 Correct 549 ms 41720 KB Output is correct
51 Correct 548 ms 41720 KB Output is correct
52 Correct 532 ms 41564 KB Output is correct
53 Correct 556 ms 41720 KB Output is correct
54 Correct 540 ms 41592 KB Output is correct
55 Correct 539 ms 41464 KB Output is correct
56 Correct 542 ms 41616 KB Output is correct
57 Correct 568 ms 41468 KB Output is correct
58 Correct 536 ms 41464 KB Output is correct
59 Correct 557 ms 41592 KB Output is correct
60 Correct 601 ms 41552 KB Output is correct
61 Correct 553 ms 41464 KB Output is correct
62 Correct 552 ms 41464 KB Output is correct
63 Correct 550 ms 41692 KB Output is correct
64 Runtime error 48 ms 52472 KB Execution killed with signal 11 (could be triggered by violating memory limits)
65 Halted 0 ms 0 KB -