#1187535 (C++17) No.3714 Prefix Team Name

• 問題: No.3714 Prefix Team Name
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-09-18 21:45:02
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 970 ms / 2,000 ms
• コード長: 4,081 bytes
• コンパイル時間: 2,710 ms
• コンパイル使用メモリ: 222,256 KB
• 実行使用メモリ: 50,560 KB
• 最終ジャッジ日時: 2026-09-18 21:45:35
• 合計ジャッジ時間: 16,052 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_1

ファイルパターン	結果
sample	AC * 3
other	AC * 28

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    string X;
    string Y;
    string Z;
    cin >> X;
    cin >> Y;
    cin >> Z;

    set<pll> st;
    ll ans = 0;

    for (ll i = 1; i <= X.size(); i++){
        for (ll j = 1; j <= Y.size(); j++){
            for (ll k = 1; k <= Z.size(); k++){
                vector<string> ss;
                ss.push_back(X.substr(0, i));
                ss.push_back(Y.substr(0, j));
                ss.push_back(Z.substr(0, k));
                // debug(ss);
                vector<ll> vec = {0, 1, 2};
                do{
                    ll v1 = 0;
                    ll v2 = 0;
                    ll h1 = 1007;
                    ll h2 = 991;
                    for (ll l = 0; l < 3; l++){
                        for (ll m = 0; m < ss[vec[l]].size(); m++){
                            v1 = (v1 * h1 + (ll)(ss[vec[l]][m] - 'a') + 1) % mod1;
                            v2 = (v2 * h2 + (ll)(ss[vec[l]][m] - 'a') + 1) % mod2;
                        }
                    }
                    if (st.find(make_pair(v1, v2)) == st.end()) ans++;
                    st.insert(make_pair(v1, v2));
                }while(next_permutation(all(vec)));
            }
        }
    }
    cout << ans << endl;
}