oj.uz

답안 #1039404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039404 2024-07-30T20:13:51 Z vjudge1 Cubeword (CEOI19_cubeword) C++17
50 / 100
 155 ms 24148 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()]]++;
    fo(a,X){
        fo(b,X){
            fo(c,X){
                fo(d,X){
                    fore(t, 3, 11){
                        ll aa=1;
                        aa=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;
    fo(a,X){
        fo(b,X){
            fo(c,X){
                fo(d,X){
                    fore(t, 3, 11){
                        ll aa=1;
                        aa=(aa*cnt[t][a][b][c])%mod;
                        aa=(aa*cnt[t][d][a][b])%mod;
                        aa=(aa*cnt[t][d][c][b])%mod;
                        aa=(aa*cnt[t][a][d][c])%mod;
                        ans=(ans+aa)%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 136 ms 22568 KB Output is correct
2 Correct 138 ms 23376 KB Output is correct
3 Correct 133 ms 23376 KB Output is correct
4 Correct 130 ms 23284 KB Output is correct
5 Correct 128 ms 23376 KB Output is correct
6 Correct 146 ms 23380 KB Output is correct
7 Correct 131 ms 23432 KB Output is correct
8 Correct 139 ms 23224 KB Output is correct
9 Correct 118 ms 23404 KB Output is correct
10 Correct 135 ms 23352 KB Output is correct
11 Correct 128 ms 23380 KB Output is correct
12 Correct 128 ms 23276 KB Output is correct
13 Correct 133 ms 23380 KB Output is correct
14 Correct 124 ms 23292 KB Output is correct
15 Correct 126 ms 23412 KB Output is correct
16 Correct 124 ms 23328 KB Output is correct
17 Correct 131 ms 23376 KB Output is correct
18 Correct 126 ms 23376 KB Output is correct
19 Correct 133 ms 23284 KB Output is correct
20 Correct 123 ms 23380 KB Output is correct
21 Correct 126 ms 23380 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 22568 KB Output is correct
2 Correct 138 ms 23376 KB Output is correct
3 Correct 133 ms 23376 KB Output is correct
4 Correct 130 ms 23284 KB Output is correct
5 Correct 128 ms 23376 KB Output is correct
6 Correct 146 ms 23380 KB Output is correct
7 Correct 131 ms 23432 KB Output is correct
8 Correct 139 ms 23224 KB Output is correct
9 Correct 118 ms 23404 KB Output is correct
10 Correct 135 ms 23352 KB Output is correct
11 Correct 128 ms 23380 KB Output is correct
12 Correct 128 ms 23276 KB Output is correct
13 Correct 133 ms 23380 KB Output is correct
14 Correct 124 ms 23292 KB Output is correct
15 Correct 126 ms 23412 KB Output is correct
16 Correct 124 ms 23328 KB Output is correct
17 Correct 131 ms 23376 KB Output is correct
18 Correct 126 ms 23376 KB Output is correct
19 Correct 133 ms 23284 KB Output is correct
20 Correct 123 ms 23380 KB Output is correct
21 Correct 126 ms 23380 KB Output is correct
22 Correct 131 ms 23892 KB Output is correct
23 Correct 128 ms 23892 KB Output is correct
24 Correct 125 ms 23888 KB Output is correct
25 Correct 129 ms 23756 KB Output is correct
26 Correct 135 ms 23892 KB Output is correct
27 Correct 129 ms 23888 KB Output is correct
28 Correct 122 ms 23856 KB Output is correct
29 Correct 121 ms 23892 KB Output is correct
30 Correct 130 ms 23896 KB Output is correct
31 Correct 130 ms 23892 KB Output is correct
32 Correct 130 ms 23740 KB Output is correct
33 Correct 131 ms 23768 KB Output is correct
34 Correct 134 ms 23892 KB Output is correct
35 Correct 122 ms 23892 KB Output is correct
36 Correct 124 ms 23892 KB Output is correct
37 Correct 128 ms 23888 KB Output is correct
38 Correct 136 ms 23892 KB Output is correct
39 Correct 136 ms 23820 KB Output is correct
40 Correct 143 ms 23892 KB Output is correct
41 Correct 155 ms 23888 KB Output is correct
42 Correct 130 ms 23888 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 22568 KB Output is correct
2 Correct 138 ms 23376 KB Output is correct
3 Correct 133 ms 23376 KB Output is correct
4 Correct 130 ms 23284 KB Output is correct
5 Correct 128 ms 23376 KB Output is correct
6 Correct 146 ms 23380 KB Output is correct
7 Correct 131 ms 23432 KB Output is correct
8 Correct 139 ms 23224 KB Output is correct
9 Correct 118 ms 23404 KB Output is correct
10 Correct 135 ms 23352 KB Output is correct
11 Correct 128 ms 23380 KB Output is correct
12 Correct 128 ms 23276 KB Output is correct
13 Correct 133 ms 23380 KB Output is correct
14 Correct 124 ms 23292 KB Output is correct
15 Correct 126 ms 23412 KB Output is correct
16 Correct 124 ms 23328 KB Output is correct
17 Correct 131 ms 23376 KB Output is correct
18 Correct 126 ms 23376 KB Output is correct
19 Correct 133 ms 23284 KB Output is correct
20 Correct 123 ms 23380 KB Output is correct
21 Correct 126 ms 23380 KB Output is correct
22 Correct 131 ms 23892 KB Output is correct
23 Correct 128 ms 23892 KB Output is correct
24 Correct 125 ms 23888 KB Output is correct
25 Correct 129 ms 23756 KB Output is correct
26 Correct 135 ms 23892 KB Output is correct
27 Correct 129 ms 23888 KB Output is correct
28 Correct 122 ms 23856 KB Output is correct
29 Correct 121 ms 23892 KB Output is correct
30 Correct 130 ms 23896 KB Output is correct
31 Correct 130 ms 23892 KB Output is correct
32 Correct 130 ms 23740 KB Output is correct
33 Correct 131 ms 23768 KB Output is correct
34 Correct 134 ms 23892 KB Output is correct
35 Correct 122 ms 23892 KB Output is correct
36 Correct 124 ms 23892 KB Output is correct
37 Correct 128 ms 23888 KB Output is correct
38 Correct 136 ms 23892 KB Output is correct
39 Correct 136 ms 23820 KB Output is correct
40 Correct 143 ms 23892 KB Output is correct
41 Correct 155 ms 23888 KB Output is correct
42 Correct 130 ms 23888 KB Output is correct
43 Incorrect 144 ms 24148 KB Output isn't correct
44 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 22568 KB Output is correct
2 Correct 138 ms 23376 KB Output is correct
3 Correct 133 ms 23376 KB Output is correct
4 Correct 130 ms 23284 KB Output is correct
5 Correct 128 ms 23376 KB Output is correct
6 Correct 146 ms 23380 KB Output is correct
7 Correct 131 ms 23432 KB Output is correct
8 Correct 139 ms 23224 KB Output is correct
9 Correct 118 ms 23404 KB Output is correct
10 Correct 135 ms 23352 KB Output is correct
11 Correct 128 ms 23380 KB Output is correct
12 Correct 128 ms 23276 KB Output is correct
13 Correct 133 ms 23380 KB Output is correct
14 Correct 124 ms 23292 KB Output is correct
15 Correct 126 ms 23412 KB Output is correct
16 Correct 124 ms 23328 KB Output is correct
17 Correct 131 ms 23376 KB Output is correct
18 Correct 126 ms 23376 KB Output is correct
19 Correct 133 ms 23284 KB Output is correct
20 Correct 123 ms 23380 KB Output is correct
21 Correct 126 ms 23380 KB Output is correct
22 Correct 131 ms 23892 KB Output is correct
23 Correct 128 ms 23892 KB Output is correct
24 Correct 125 ms 23888 KB Output is correct
25 Correct 129 ms 23756 KB Output is correct
26 Correct 135 ms 23892 KB Output is correct
27 Correct 129 ms 23888 KB Output is correct
28 Correct 122 ms 23856 KB Output is correct
29 Correct 121 ms 23892 KB Output is correct
30 Correct 130 ms 23896 KB Output is correct
31 Correct 130 ms 23892 KB Output is correct
32 Correct 130 ms 23740 KB Output is correct
33 Correct 131 ms 23768 KB Output is correct
34 Correct 134 ms 23892 KB Output is correct
35 Correct 122 ms 23892 KB Output is correct
36 Correct 124 ms 23892 KB Output is correct
37 Correct 128 ms 23888 KB Output is correct
38 Correct 136 ms 23892 KB Output is correct
39 Correct 136 ms 23820 KB Output is correct
40 Correct 143 ms 23892 KB Output is correct
41 Correct 155 ms 23888 KB Output is correct
42 Correct 130 ms 23888 KB Output is correct
43 Incorrect 144 ms 24148 KB Output isn't correct
44 Halted 0 ms 0 KB -