Submission #1039398

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039398		vjudge1	Cubeword (CEOI19_cubeword)	C++17	0 / 100	1175 ms	37716 KiB

cubeword

#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;
set<string> st[11][64][64];
ll cnt[11][64][64][64];
string s[N];
map<char, int> let;
void test_case(){
    cin>>n;
    fo(i,n){
        cin>>s[i];
        int t=sz(s[i]);
        st[t][let[s[i][0]]][let[s[i].back()]].insert(s[i]);
        reverse(all(s[i]));
        st[t][let[s[i][0]]][let[s[i].back()]].insert(s[i]);
    }
    fo(a,X){
        fo(b,X){
            fo(c,X){
                fo(d,X){
                    fore(t, 3, 11){
                        ll aa=1;
                        aa=(aa*sz(st[t][d][a]))%mod;
                        aa=(aa*sz(st[t][b][d]))%mod;
                        aa=(aa*sz(st[t][d][c]))%mod;
                        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 (stderr)

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")
      |

• Subtask 1: 0 / 21
• Subtask 2: 0 / 29
• Subtask 3: 0 / 34
• Subtask 4: 0 / 16