oj.uz

답안 #1039424

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039424 2024-07-30T20:46:13 Z vjudge1 Cubeword (CEOI19_cubeword) C++17
84 / 100
 738 ms 35848 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
 
bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int N = 1e5 + 7, LOG=20,mod=998244353;
int n,X=0;
ll cnt[11][64][64][64], cnt2[11][64][64];
string s[N];
map<char, int> let;
void test_case(){
    cin>>n;
    set<string> st;
    fo(i,n){
        cin>>s[i];
        int t=sz(s[i]);
        st.insert(s[i]);
        reverse(all(s[i]));
        st.insert(s[i]);
    }
    for(auto e:st)cnt2[sz(e)][let[e[0]]][let[e.back()]]++;
    fore(t, 3, 11){
        fo(d,X){
            fo(a,X){
                if(cnt2[t][d][a]==0)continue;
                fo(b,X){
                    if(cnt2[t][b][d]==0)continue;
                    fo(c,X){
                        if(cnt2[t][d][c]==0)continue;
                        ll aa=cnt2[t][d][a];
                        aa=aa*cnt2[t][b][d];
                        aa=aa*cnt2[t][d][c];
                        cnt[t][a][b][c]=(cnt[t][a][b][c]+aa)%mod;
                    }
                }
            }
        }
    }
    ll ans=0;
    fore(t, 3, 11){
        fo(a,X){
            fo(b,X){
                fo(c,X){
                    fo(d,X){
                        if(min({cnt[t][a][b][c],cnt[t][d][a][b],cnt[t][d][c][b],cnt[t][a][d][c]})==0)continue;
                        ll aa=cnt[t][a][b][c];
                        aa=aa*cnt[t][d][a][b];
                        if(aa>=mod)aa%=mod;
                        ll aa2=cnt[t][d][c][b];
                        aa2=aa2*cnt[t][a][d][c];
                        if(aa2>=mod)aa2%=mod;
                        ans=ans+(aa*aa2)%mod;
                        if(ans>=mod)ans-=mod;
                    }
                }
            }
        }
    }
    ans%=mod;
    cout<<ans<<endl;
}
int main(){cin.tie(0)->sync_with_stdio(0);
    for(char a='a';a<='z';a++)let[a]=X++;
    for(char a='A';a<='Z';a++)let[a]=X++;
    for(char a='1';a<='9';a++)let[a]=X++;
    int t=1;
    // cin >> t;
    while(t--)test_case();
}

Compilation message

cubeword.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
cubeword.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      | 
cubeword.cpp: In function 'void test_case()':
cubeword.cpp:50:13: warning: unused variable 't' [-Wunused-variable]
   50 |         int t=sz(s[i]);
      |             ^

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 19280 KB Output is correct
2 Correct 675 ms 19280 KB Output is correct
3 Correct 699 ms 19284 KB Output is correct
4 Correct 704 ms 19284 KB Output is correct
5 Correct 708 ms 19356 KB Output is correct
6 Correct 691 ms 19280 KB Output is correct
7 Correct 688 ms 19416 KB Output is correct
8 Correct 696 ms 19412 KB Output is correct
9 Correct 664 ms 19284 KB Output is correct
10 Correct 707 ms 19280 KB Output is correct
11 Correct 685 ms 19400 KB Output is correct
12 Correct 671 ms 19284 KB Output is correct
13 Correct 716 ms 19280 KB Output is correct
14 Correct 668 ms 19280 KB Output is correct
15 Correct 671 ms 19284 KB Output is correct
16 Correct 679 ms 19264 KB Output is correct
17 Correct 685 ms 19280 KB Output is correct
18 Correct 682 ms 19400 KB Output is correct
19 Correct 710 ms 19284 KB Output is correct
20 Correct 733 ms 19280 KB Output is correct
21 Correct 711 ms 19224 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 19280 KB Output is correct
2 Correct 675 ms 19280 KB Output is correct
3 Correct 699 ms 19284 KB Output is correct
4 Correct 704 ms 19284 KB Output is correct
5 Correct 708 ms 19356 KB Output is correct
6 Correct 691 ms 19280 KB Output is correct
7 Correct 688 ms 19416 KB Output is correct
8 Correct 696 ms 19412 KB Output is correct
9 Correct 664 ms 19284 KB Output is correct
10 Correct 707 ms 19280 KB Output is correct
11 Correct 685 ms 19400 KB Output is correct
12 Correct 671 ms 19284 KB Output is correct
13 Correct 716 ms 19280 KB Output is correct
14 Correct 668 ms 19280 KB Output is correct
15 Correct 671 ms 19284 KB Output is correct
16 Correct 679 ms 19264 KB Output is correct
17 Correct 685 ms 19280 KB Output is correct
18 Correct 682 ms 19400 KB Output is correct
19 Correct 710 ms 19284 KB Output is correct
20 Correct 733 ms 19280 KB Output is correct
21 Correct 711 ms 19224 KB Output is correct
22 Correct 699 ms 21072 KB Output is correct
23 Correct 700 ms 20956 KB Output is correct
24 Correct 690 ms 21064 KB Output is correct
25 Correct 696 ms 21104 KB Output is correct
26 Correct 693 ms 21072 KB Output is correct
27 Correct 693 ms 21080 KB Output is correct
28 Correct 675 ms 21076 KB Output is correct
29 Correct 680 ms 21072 KB Output is correct
30 Correct 697 ms 21076 KB Output is correct
31 Correct 705 ms 21164 KB Output is correct
32 Correct 664 ms 21072 KB Output is correct
33 Correct 644 ms 21076 KB Output is correct
34 Correct 687 ms 20976 KB Output is correct
35 Correct 704 ms 21148 KB Output is correct
36 Correct 738 ms 20988 KB Output is correct
37 Correct 639 ms 21136 KB Output is correct
38 Correct 620 ms 21072 KB Output is correct
39 Correct 632 ms 21072 KB Output is correct
40 Correct 626 ms 20948 KB Output is correct
41 Correct 624 ms 21076 KB Output is correct
42 Correct 617 ms 21072 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 19280 KB Output is correct
2 Correct 675 ms 19280 KB Output is correct
3 Correct 699 ms 19284 KB Output is correct
4 Correct 704 ms 19284 KB Output is correct
5 Correct 708 ms 19356 KB Output is correct
6 Correct 691 ms 19280 KB Output is correct
7 Correct 688 ms 19416 KB Output is correct
8 Correct 696 ms 19412 KB Output is correct
9 Correct 664 ms 19284 KB Output is correct
10 Correct 707 ms 19280 KB Output is correct
11 Correct 685 ms 19400 KB Output is correct
12 Correct 671 ms 19284 KB Output is correct
13 Correct 716 ms 19280 KB Output is correct
14 Correct 668 ms 19280 KB Output is correct
15 Correct 671 ms 19284 KB Output is correct
16 Correct 679 ms 19264 KB Output is correct
17 Correct 685 ms 19280 KB Output is correct
18 Correct 682 ms 19400 KB Output is correct
19 Correct 710 ms 19284 KB Output is correct
20 Correct 733 ms 19280 KB Output is correct
21 Correct 711 ms 19224 KB Output is correct
22 Correct 699 ms 21072 KB Output is correct
23 Correct 700 ms 20956 KB Output is correct
24 Correct 690 ms 21064 KB Output is correct
25 Correct 696 ms 21104 KB Output is correct
26 Correct 693 ms 21072 KB Output is correct
27 Correct 693 ms 21080 KB Output is correct
28 Correct 675 ms 21076 KB Output is correct
29 Correct 680 ms 21072 KB Output is correct
30 Correct 697 ms 21076 KB Output is correct
31 Correct 705 ms 21164 KB Output is correct
32 Correct 664 ms 21072 KB Output is correct
33 Correct 644 ms 21076 KB Output is correct
34 Correct 687 ms 20976 KB Output is correct
35 Correct 704 ms 21148 KB Output is correct
36 Correct 738 ms 20988 KB Output is correct
37 Correct 639 ms 21136 KB Output is correct
38 Correct 620 ms 21072 KB Output is correct
39 Correct 632 ms 21072 KB Output is correct
40 Correct 626 ms 20948 KB Output is correct
41 Correct 624 ms 21076 KB Output is correct
42 Correct 617 ms 21072 KB Output is correct
43 Correct 646 ms 25936 KB Output is correct
44 Correct 651 ms 26060 KB Output is correct
45 Correct 637 ms 26192 KB Output is correct
46 Correct 637 ms 25912 KB Output is correct
47 Correct 666 ms 25936 KB Output is correct
48 Correct 661 ms 25836 KB Output is correct
49 Correct 653 ms 25944 KB Output is correct
50 Correct 642 ms 25836 KB Output is correct
51 Correct 639 ms 25940 KB Output is correct
52 Correct 643 ms 25936 KB Output is correct
53 Correct 656 ms 26036 KB Output is correct
54 Correct 677 ms 26056 KB Output is correct
55 Correct 676 ms 25936 KB Output is correct
56 Correct 655 ms 25936 KB Output is correct
57 Correct 667 ms 25936 KB Output is correct
58 Correct 659 ms 25784 KB Output is correct
59 Correct 698 ms 26044 KB Output is correct
60 Correct 654 ms 25936 KB Output is correct
61 Correct 655 ms 25892 KB Output is correct
62 Correct 674 ms 25936 KB Output is correct
63 Correct 657 ms 25936 KB Output is correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 729 ms 19280 KB Output is correct
2 Correct 675 ms 19280 KB Output is correct
3 Correct 699 ms 19284 KB Output is correct
4 Correct 704 ms 19284 KB Output is correct
5 Correct 708 ms 19356 KB Output is correct
6 Correct 691 ms 19280 KB Output is correct
7 Correct 688 ms 19416 KB Output is correct
8 Correct 696 ms 19412 KB Output is correct
9 Correct 664 ms 19284 KB Output is correct
10 Correct 707 ms 19280 KB Output is correct
11 Correct 685 ms 19400 KB Output is correct
12 Correct 671 ms 19284 KB Output is correct
13 Correct 716 ms 19280 KB Output is correct
14 Correct 668 ms 19280 KB Output is correct
15 Correct 671 ms 19284 KB Output is correct
16 Correct 679 ms 19264 KB Output is correct
17 Correct 685 ms 19280 KB Output is correct
18 Correct 682 ms 19400 KB Output is correct
19 Correct 710 ms 19284 KB Output is correct
20 Correct 733 ms 19280 KB Output is correct
21 Correct 711 ms 19224 KB Output is correct
22 Correct 699 ms 21072 KB Output is correct
23 Correct 700 ms 20956 KB Output is correct
24 Correct 690 ms 21064 KB Output is correct
25 Correct 696 ms 21104 KB Output is correct
26 Correct 693 ms 21072 KB Output is correct
27 Correct 693 ms 21080 KB Output is correct
28 Correct 675 ms 21076 KB Output is correct
29 Correct 680 ms 21072 KB Output is correct
30 Correct 697 ms 21076 KB Output is correct
31 Correct 705 ms 21164 KB Output is correct
32 Correct 664 ms 21072 KB Output is correct
33 Correct 644 ms 21076 KB Output is correct
34 Correct 687 ms 20976 KB Output is correct
35 Correct 704 ms 21148 KB Output is correct
36 Correct 738 ms 20988 KB Output is correct
37 Correct 639 ms 21136 KB Output is correct
38 Correct 620 ms 21072 KB Output is correct
39 Correct 632 ms 21072 KB Output is correct
40 Correct 626 ms 20948 KB Output is correct
41 Correct 624 ms 21076 KB Output is correct
42 Correct 617 ms 21072 KB Output is correct
43 Correct 646 ms 25936 KB Output is correct
44 Correct 651 ms 26060 KB Output is correct
45 Correct 637 ms 26192 KB Output is correct
46 Correct 637 ms 25912 KB Output is correct
47 Correct 666 ms 25936 KB Output is correct
48 Correct 661 ms 25836 KB Output is correct
49 Correct 653 ms 25944 KB Output is correct
50 Correct 642 ms 25836 KB Output is correct
51 Correct 639 ms 25940 KB Output is correct
52 Correct 643 ms 25936 KB Output is correct
53 Correct 656 ms 26036 KB Output is correct
54 Correct 677 ms 26056 KB Output is correct
55 Correct 676 ms 25936 KB Output is correct
56 Correct 655 ms 25936 KB Output is correct
57 Correct 667 ms 25936 KB Output is correct
58 Correct 659 ms 25784 KB Output is correct
59 Correct 698 ms 26044 KB Output is correct
60 Correct 654 ms 25936 KB Output is correct
61 Correct 655 ms 25892 KB Output is correct
62 Correct 674 ms 25936 KB Output is correct
63 Correct 657 ms 25936 KB Output is correct
64 Incorrect 693 ms 35848 KB Output isn't correct
65 Halted 0 ms 0 KB -