#936644 (C++17) No.2102 [Cherry Alpha *] Conditional Reflection

提出ソース

結果

問題	No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー	siro53
提出日時	2023-12-05 19:07:14
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	439 ms / 3,000 ms
コード長	15,971 bytes
コンパイル時間	2,937 ms
コンパイル使用メモリ	217,592 KB
実行使用メモリ	19,928 KB
最終ジャッジ日時	2024-09-27 00:23:27
合計ジャッジ時間	25,045 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	3 ms 5,376 KB
testcase_02	AC	170 ms 11,904 KB
testcase_03	AC	237 ms 13,312 KB
testcase_04	AC	175 ms 12,416 KB
testcase_05	AC	103 ms 10,368 KB
testcase_06	AC	188 ms 13,056 KB
testcase_07	AC	193 ms 8,832 KB
testcase_08	AC	36 ms 6,912 KB
testcase_09	AC	214 ms 11,392 KB
testcase_10	AC	68 ms 8,192 KB
testcase_11	AC	67 ms 7,040 KB
testcase_12	AC	135 ms 10,496 KB
testcase_13	AC	264 ms 13,440 KB
testcase_14	AC	133 ms 11,136 KB
testcase_15	AC	200 ms 13,824 KB
testcase_16	AC	382 ms 16,384 KB
testcase_17	AC	121 ms 7,168 KB
testcase_18	AC	230 ms 9,856 KB
testcase_19	AC	93 ms 9,088 KB
testcase_20	AC	317 ms 14,208 KB
testcase_21	AC	62 ms 9,472 KB
testcase_22	AC	430 ms 17,280 KB
testcase_23	AC	439 ms 17,152 KB
testcase_24	AC	385 ms 17,280 KB
testcase_25	AC	407 ms 17,280 KB
testcase_26	AC	386 ms 17,280 KB
testcase_27	AC	398 ms 17,152 KB
testcase_28	AC	412 ms 17,152 KB
testcase_29	AC	423 ms 17,280 KB
testcase_30	AC	372 ms 17,280 KB
testcase_31	AC	397 ms 17,152 KB
testcase_32	AC	391 ms 17,408 KB
testcase_33	AC	390 ms 17,152 KB
testcase_34	AC	401 ms 17,280 KB
testcase_35	AC	422 ms 17,280 KB
testcase_36	AC	407 ms 17,280 KB
testcase_37	AC	388 ms 17,280 KB
testcase_38	AC	397 ms 17,280 KB
testcase_39	AC	403 ms 17,152 KB
testcase_40	AC	397 ms 17,280 KB
testcase_41	AC	420 ms 17,152 KB
testcase_42	AC	308 ms 11,904 KB
testcase_43	AC	302 ms 11,904 KB
testcase_44	AC	287 ms 11,904 KB
testcase_45	AC	293 ms 11,904 KB
testcase_46	AC	282 ms 12,032 KB
testcase_47	AC	224 ms 8,320 KB
testcase_48	AC	227 ms 8,448 KB
testcase_49	AC	224 ms 8,320 KB
testcase_50	AC	228 ms 8,320 KB
testcase_51	AC	223 ms 8,448 KB
testcase_52	AC	36 ms 19,928 KB
testcase_53	AC	35 ms 19,928 KB
testcase_54	AC	35 ms 19,924 KB
testcase_55	AC	76 ms 5,376 KB
testcase_56	AC	75 ms 5,376 KB
testcase_57	AC	76 ms 5,376 KB
testcase_58	AC	33 ms 11,968 KB
testcase_59	AC	402 ms 18,688 KB
testcase_60	AC	28 ms 6,528 KB
testcase_61	AC	75 ms 5,376 KB
testcase_62	AC	6 ms 5,376 KB
testcase_63	AC	28 ms 7,040 KB
testcase_64	AC	28 ms 7,168 KB
testcase_65	AC	32 ms 7,168 KB
testcase_66	AC	71 ms 5,376 KB
testcase_67	AC	47 ms 9,472 KB
testcase_68	AC	28 ms 5,376 KB
testcase_69	AC	45 ms 9,472 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "combined.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// input output utils
namespace siro53_io {
    // https://maspypy.github.io/library/other/io_old.hpp
    struct has_val_impl {
        template <class T>
        static auto check(T &&x) -> decltype(x.val(), std::true_type{});

        template <class T> static auto check(...) -> std::false_type;
    };

    template <class T>
    class has_val : public decltype(has_val_impl::check<T>(std::declval<T>())) {
    };

    // debug
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void dump(const T t) {
        cerr << t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void dump(const T t) {
        cerr << t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void dump(const T &t) {
        cerr << t.val();
    }
    void dump(__int128_t n) {
        if(n == 0) {
            cerr << '0';
            return;
        } else if(n < 0) {
            cerr << '-';
            n = -n;
        }
        string s;
        while(n > 0) {
            s += (char)('0' + n % 10);
            n /= 10;
        }
        reverse(s.begin(), s.end());
        cerr << s;
    }
    void dump(const string &s) { cerr << s; }
    void dump(const char *s) {
        int n = (int)strlen(s);
        for(int i = 0; i < n; i++) cerr << s[i];
    }
    template <class T1, class T2> void dump(const pair<T1, T2> &p) {
        cerr << '(';
        dump(p.first);
        cerr << ',';
        dump(p.second);
        cerr << ')';
    }
    template <class T> void dump(const vector<T> &v) {
        cerr << '{';
        for(int i = 0; i < (int)v.size(); i++) {
            dump(v[i]);
            if(i < (int)v.size() - 1) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(const set<T> &s) {
        cerr << '{';
        for(auto it = s.begin(); it != s.end(); it++) {
            dump(*it);
            if(next(it) != s.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class Key, class Value> void dump(const map<Key, Value> &mp) {
        cerr << '{';
        for(auto it = mp.begin(); it != mp.end(); it++) {
            dump(*it);
            if(next(it) != mp.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class Key, class Value>
    void dump(const unordered_map<Key, Value> &mp) {
        cerr << '{';
        for(auto it = mp.begin(); it != mp.end(); it++) {
            dump(*it);
            if(next(it) != mp.end()) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(const deque<T> &v) {
        cerr << '{';
        for(int i = 0; i < (int)v.size(); i++) {
            dump(v[i]);
            if(i < (int)v.size() - 1) cerr << ',';
        }
        cerr << '}';
    }
    template <class T> void dump(queue<T> q) {
        cerr << '{';
        while(!q.empty()) {
            dump(q.front());
            if((int)q.size() > 1) cerr << ',';
            q.pop();
        }
        cerr << '}';
    }

    void debug_print() { cerr << endl; }
    template <class Head, class... Tail>
    void debug_print(const Head &h, const Tail &...t) {
        dump(h);
        if(sizeof...(Tail)) dump(' ');
        debug_print(t...);
    }
    // print
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void print_single(const T t) {
        cout << t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void print_single(const T t) {
        cout << t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void print_single(const T t) {
        cout << t.val();
    }
    void print_single(__int128_t n) {
        if(n == 0) {
            cout << '0';
            return;
        } else if(n < 0) {
            cout << '-';
            n = -n;
        }
        string s;
        while(n > 0) {
            s += (char)('0' + n % 10);
            n /= 10;
        }
        reverse(s.begin(), s.end());
        cout << s;
    }
    void print_single(const string &s) { cout << s; }
    void print_single(const char *s) {
        int n = (int)strlen(s);
        for(int i = 0; i < n; i++) cout << s[i];
    }
    template <class T1, class T2> void print_single(const pair<T1, T2> &p) {
        print_single(p.first);
        cout << ' ';
        print_single(p.second);
    }
    template <class T> void print_single(const vector<T> &v) {
        for(int i = 0; i < (int)v.size(); i++) {
            print_single(v[i]);
            if(i < (int)v.size() - 1) cout << ' ';
        }
    }
    template <class T> void print_single(const set<T> &s) {
        for(auto it = s.begin(); it != s.end(); it++) {
            print_single(*it);
            if(next(it) != s.end()) cout << ' ';
        }
    }
    template <class T> void print_single(const deque<T> &v) {
        for(int i = 0; i < (int)v.size(); i++) {
            print_single(v[i]);
            if(i < (int)v.size() - 1) cout << ' ';
        }
    }
    template <class T> void print_single(queue<T> q) {
        while(!q.empty()) {
            print_single(q.front());
            if((int)q.size() > 1) cout << ' ';
            q.pop();
        }
    }

    void print() { cout << '\n'; }
    template <class Head, class... Tail>
    void print(const Head &h, const Tail &...t) {
        print_single(h);
        if(sizeof...(Tail)) print_single(' ');
        print(t...);
    }

    // input
    template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    void input_single(T &t) {
        cin >> t;
    }
    template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
    void input_single(T &t) {
        cin >> t;
    }
    template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
    void input_single(T &t) {
        cin >> t;
    }
    void input_single(__int128_t &n) {
        string s;
        cin >> s;
        if(s == "0") {
            n = 0;
            return;
        }
        bool is_minus = false;
        if(s[0] == '-') {
            s = s.substr(1);
            is_minus = true;
        }
        n = 0;
        for(int i = 0; i < (int)s.size(); i++) n = n * 10 + (int)(s[i] - '0');
        if(is_minus) n = -n;
    }
    void input_single(string &s) { cin >> s; }
    template <class T1, class T2> void input_single(pair<T1, T2> &p) {
        input_single(p.first);
        input_single(p.second);
    }
    template <class T> void input_single(vector<T> &v) {
        for(auto &e : v) input_single(e);
    }
    void input() {}
    template <class Head, class... Tail> void input(Head &h, Tail &...t) {
        input_single(h);
        input(t...);
    }
}; // namespace siro53_io
#ifdef DEBUG
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debug_print(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
// io setup
struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;
using namespace siro53_io;
// types
using ll = long long;
using i128 = __int128_t;
// input macros
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    ll __VA_ARGS__;                                                            \
    input(__VA_ARGS__)
#define STRING(...)                                                            \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define CHAR(...)                                                              \
    char __VA_ARGS__;                                                          \
    input(__VA_ARGS__)
#define DBL(...)                                                               \
    double __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define LD(...)                                                                \
    long double __VA_ARGS__;                                                   \
    input(__VA_ARGS__)
#define UINT(...)                                                              \
    unsigned int __VA_ARGS__;                                                  \
    input(__VA_ARGS__)
#define ULL(...)                                                               \
    unsigned long long __VA_ARGS__;                                            \
    input(__VA_ARGS__)
#define VEC(name, type, len)                                                   \
    vector<type> name(len);                                                    \
    input(name);
#define VEC2(name, type, len1, len2)                                           \
    vector name(len1, vector<type>(len2));                                     \
    input(name);
// other macros
// https://trap.jp/post/1224/
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define UNIQUE(v)                                                              \
    sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()), v.shrink_to_fit()
#define REV(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
#define MIN(v) (*min_element(ALL(v)))
#define MAX(v) (*max_element(ALL(v)))
// util const
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// util functions
void Case(int i) { cout << "Case #" << i << ": "; }
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
template <class T> inline bool chmax(T &a, T b) {
    return (a < b ? a = b, true : false);
}
template <class T> inline bool chmin(T &a, T b) {
    return (a > b ? a = b, true : false);
}
template <class T, size_t dim>
auto make_vector_impl(vector<size_t> &sizes, const T &e) {
    if constexpr(dim == 1) {
        return vector(sizes[0], e);
    } else {
        size_t n = sizes[dim - 1];
        sizes.pop_back();
        return vector(n, make_vector_impl<T, dim - 1>(sizes, e));
    }
}
template <class T, size_t dim>
auto make_vector(const size_t (&sizes)[dim], const T &e) {
    vector<size_t> s(dim);
    for(size_t i = 0; i < dim; i++) s[i] = sizes[dim - i - 1];
    return make_vector_impl<T, dim>(s, e);
}
#pragma endregion Macros

#line 2 "/Users/siro53/kyo-pro/compro_library/string/rolling-hash.hpp"

#line 8 "/Users/siro53/kyo-pro/compro_library/string/rolling-hash.hpp"

#line 2 "/Users/siro53/kyo-pro/compro_library/modint/modint_2_61.hpp"

#line 5 "/Users/siro53/kyo-pro/compro_library/modint/modint_2_61.hpp"

// ローリングハッシュ用 modint
// https://qiita.com/keymoon/items/11fac5627672a6d6a9f6
class ModInt_2_61 {
  public:
    using M = ModInt_2_61;
    ModInt_2_61() : x(0) {}
    ModInt_2_61(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    unsigned long long val() const { return x; }
    M &operator+=(const M &m) {
        if((x += m.x) >= mod) x -= mod;
        return *this;
    }
    M &operator-=(const M &m) {
        if((x += mod - m.x) >= mod) x -= mod;
        return *this;
    }
    M &operator*=(const M &m) {
        __uint128_t t = (__uint128_t)x * m.x;
        unsigned long long na = t >> 61;
        unsigned long long nb = t & mod;
        if((na += nb) >= mod) na -= mod;
        x = na;
        return *this;
    }
    M &operator/=(const M &m) {
        *this *= m.inv();
        return *this;
    }
    M operator-() const { return M(-(long long)x); }
    M operator+(const M &m) const { return M(*this) += m; }
    M operator-(const M &m) const { return M(*this) -= m; }
    M operator*(const M &m) const { return M(*this) *= m; }
    M operator/(const M &m) const { return M(*this) /= m; }
    bool operator==(const M &m) const { return (x == m.x); }
    bool operator!=(const M &m) const { return (x != m.x); }
    M inv() const {
        long long a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return M(u);
    }
    M pow(unsigned long long n) const {
        M ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend std::ostream &operator<<(std::ostream &os, const M &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, M &a) {
        long long t;
        is >> t;
        a = M(t);
        return (is);
    }
    static constexpr unsigned long long get_mod() { return mod; }

  private:
    unsigned long long x;
    static constexpr unsigned long long mod = (1LL << 61) - 1;
};
#line 10 "/Users/siro53/kyo-pro/compro_library/string/rolling-hash.hpp"

struct RollingHash {
    using u64 = unsigned long long;
    using mint = ModInt_2_61;
    static constexpr u64 mod = (1ULL << 61) - 1;
    const u64 base;
    std::vector<mint> hashed, power;

    explicit RollingHash(const std::vector<int> &v, u64 base) : base(base) {
        int n = (int)v.size();
        hashed.assign(n + 1, 0);
        power.assign(n + 1, 0);
        power[0] = 1;
        for(int i = 0; i < n; i++) {
            power[i + 1] = power[i] * base;
            hashed[i + 1] = (hashed[i] * base) + v[i];
        }
    }
    explicit RollingHash(const std::string &s, u64 base) : base(base) {
        int n = (int)s.size();
        hashed.assign(n + 1, 0);
        power.assign(n + 1, 0);
        power[0] = 1;
        for(int i = 0; i < n; i++) {
            power[i + 1] = power[i] * base;
            hashed[i + 1] = (hashed[i] * base) + s[i];
        }
    }
    static inline u64 gen_base() {
        std::random_device seed_gen;
        std::mt19937_64 engine(seed_gen());
        std::uniform_int_distribution<u64> rand(2, mod - 2);
        return rand(engine);
    }
    mint get(int l, int r) {
        assert(0 <= l);
        assert(l <= r);
        assert(r < (int)power.size());
        return (hashed[r] - (hashed[l] * power[r - l]));
    }
    mint connect(mint h1, mint h2, int h2len) {
        return (h1 * power[h2len] + h2);
    }
    int get_lcp(RollingHash &b, int l1, int r1, int l2, int r2) {
        assert(mod == b.mod);
        int len = std::min(r1 - l1, r2 - l2);
        int low = -1, high = len + 1;
        while(high - low > 1) {
            int mid = (low + high) >> 1;
            if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) {
                low = mid;
            } else {
                high = mid;
            }
        }
        return low;
    }
};
#line 334 "combined.cpp"

int main() {
    INT(N);
    VEC(S, string, N);
    set<RollingHash::u64> se;
    auto base = RollingHash::gen_base();
    REP(i, N) {
        RollingHash rh(S[i], base);
        int M = SZ(S[i]);
        auto h = rh.get(0, M);
        bool ok = se.count(h.val());
        if(!ok) {
            REP(j, M - 1) {
                auto t = h - rh.power[M - 1 - j] * S[i][j] -
                         rh.power[M - 1 - (j + 1)] * S[i][j + 1];
                t += rh.power[M - 1 - j] * S[i][j + 1] +
                     rh.power[M - 1 - (j + 1)] * S[i][j];
                if(se.count(t.val())) {
                    ok = true;
                    break;
                }
            }
        }
        print(ok ? "Yes" : "No");
        se.emplace(h.val());
    }
}

yukicoder

結果

テストケース

ソースコード