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

提出ソース
結果

問題	No.2102 [Cherry Alpha *] Conditional Reflection
コンテスト
ユーザー	Demystify
提出日時	2022-10-14 23:17:30
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	1,669 ms / 3,000 ms
コード長	14,363 bytes
コンパイル時間	2,601 ms
コンパイル使用メモリ	215,284 KB
最終ジャッジ日時	2025-02-08 04:59:09
ジャッジサーバーID （参考情報）	judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
other	AC * 70
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
// #define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) ((ll)__builtin_popcountll(b))
#define P0(i) (((i) & 1) == 0)
#define P1(i) (((i) & 1) == 1)
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); } while (0)
#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)
#define elif else if
template<class T> using PQ_max = priority_queue<T>;
template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
#ifdef _LOCAL
    #define debug_bar cerr << "----------------------------------------\n";
    #define debug_header cerr << "[" << __FUNCTION__ << ":" << __LINE__ << "] "
    #define debug(...) do { debug_header; cerr << #__VA_ARGS__ << " = "; view(__VA_ARGS__); cerr << '\n'; } while (0)
    #define debug2(vv) do { debug_header; cerr << #vv << " = [\n"; view2d(vv); cerr << "  ]\n"; } while (0)
    #define debug3(vvv) do { debug_header; cerr << #vvv << " = [\n"; view3d(vvv); cerr << "  ]\n"; } while (0)
    void view() {}
    void view(const int& a) { if (abs(a) == inf) { cerr << "+-"[signbit(a)] << "inf"; } else { cerr << a; } }
    void view(const ll& a) { if (abs(a) == INF) { cerr << "+-"[signbit(a)] << "INF"; } else { cerr << a; } }
    template<class T> void view(const T& a) { cerr << a; }
    template<class P1, class P2> void view(const pair<P1, P2>& a) { cerr << "("; view(a.first); cerr << ", "; view(a.second); cerr << ")"; }
    template<class T1, class T2, class T3> void view(const tuple<T1, T2, T3>& a) { cerr << "("; view(get<0>(a)); cerr << ", "; view(get<1>(a)); cerr << ", "; view(get<2>(a)); cerr << ")"; }
    template<class T1, class T2, class T3, class T4> void view(const tuple<T1, T2, T3, T4>& a) { cerr << "("; view(get<0>(a)); cerr << ", "; view(get<1>(a)); cerr << ", "; view(get<2>(a)); cerr << ", "; view(get<3>(a)); cerr << ")"; }
    template<class T1, class T2, class T3, class T4, class T5> void view(const tuple<T1, T2, T3, T4, T5>& a) { cerr << "("; view(get<0>(a)); cerr << ", "; view(get<1>(a)); cerr << ", "; view(get<2>(a)); cerr << ", "; view(get<3>(a)); cerr << ", "; view(get<4>(a)); cerr << ")"; }
    template<class T> void view(const vector<T>& v){ cerr << "["; for (int i = 0; i < (int)v.size(); i++) { if (i) { cerr << ", "; } view(v[i]); } cerr << "]"; }
    template<class T> void view(const vector<vector<T>>& vv){ cerr << "["; for (int i = 0; i < (int)vv.size(); i++) { if (i) { cerr << ", "; } view(vv[i]); } cerr << "]"; }
    template<class K, class V> void view(const map<K, V>& mp){ cerr << "["; for (auto it = mp.begin(); it != mp.end(); it++) { if (it != mp.begin()) { cerr << ", "; } cerr << "("; view(it->first); cerr << ", "; view(it->second); cerr << ")"; } cerr << "]"; }
    template<class K, class V> void view(const multimap<K, V>& mmp){ cerr << "["; for (auto it = mmp.begin(); it != mmp.end(); it++) { if (it != mmp.begin()) { cerr << ", "; } cerr << "("; view(it->first); cerr << ", "; view(it->second); cerr << ")"; } cerr << "]"; }
    template<class T> void view(const set<T>& s){ cerr << "["; for (auto it = s.begin(); it != s.end(); it++) { if (it != s.begin()) { cerr << ", "; } view(*it); } cerr << "]"; }
    template<class T> void view(const multiset<T>& ms){ cerr << "["; for (auto it = ms.begin(); it != ms.end(); it++) { if (it != ms.begin()) { cerr << ", "; } view(*it); } cerr << "]"; }
    template<class T> void view(const deque<T>& d){ cerr << "(front)<-["; for (auto it = d.begin(); it != d.end(); it++) { if (it != d.begin()) { cerr << ", "; } view(*it); } cerr << "]"; }
    template<class T> void view(stack<T> s){ vector<T> v; while (not s.empty()) { v.push_back(s.top()); s.pop(); } reverse(v.begin(), v.end()); view(v); cerr << "->(top)"; }
    template<class T> void view(queue<T> q){ vector<T> v; while (not q.empty()) { v.push_back(q.front()); q.pop(); } cerr << "(front)<-"; view(v); }
    template<class T> void view(PQ_max<T> pq){ vector<T> v; while (not pq.empty()) { v.push_back(pq.top()); pq.pop(); } cerr << "(top)<-"; view(v); }
    template<class T> void view(PQ_min<T> pq){ vector<T> v; while (not pq.empty()) { v.push_back(pq.top()); pq.pop(); } cerr << "(top)<-"; view(v); }
    template<class T> void view2d(const vector<vector<T>>& vv){ for (int i = 0; i < (int)vv.size(); i++) { cerr << "    "; view(vv[i]); cerr << ",\n"; } }
    template<class T> void view3d(const vector<vector<vector<T>>>& vvv) { for (int i = 0; i < (int)vvv.size(); i++) { for (int j = 0; j < (int)vvv[i].size(); j++) { cerr << "    " << " ["[j == 0]; view(vvv[i][j]); if (j == (int)vvv[i].size() - 1) { cerr << "]"; } cerr << ",\n"; } if (i < (int)vvv.size() - 1) { cerr << "\n"; } } }
    template<class T, class... Ts> void view(const T& a, const Ts&... b) { view(a); cerr << ", "; view(b...); }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(...)
    #define debug2(vv)
    #define debug3(vvv)
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
template<class T> string to_binary(T x, int B) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; } reverse(s.begin(), s.end()); return s; }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll mod(ll x, ll m) { assert(m != 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;



// References
//   <https://qiita.com/keymoon/items/11fac5627672a6d6a9f6>
//   <https://atcoder.jp/contests/abc141/submissions/11668413>
//   <https://atcoder.jp/contests/abc150/submissions/9414606>
//   <https://drken1215.hatenablog.com/entry/2019/09/16/014600>
//   <https://en.wikipedia.org/wiki/Fenwick_tree>

// 変更可能ローリングハッシュ (BIT を内部で使用)
//   - 構築: O(|S|)
//   - 更新: O(log |S|)
//   - 取得: O(log |S|)
struct Rolling_Hash {
  public:
    Rolling_Hash() {}
    Rolling_Hash(const string& S) { build(S); }
    Rolling_Hash(const vector<ll>& s) { build(s); }

    // hash [l,r) : O(log |S|)
    pair<ll,ll> hash(int l, int r) const {
        assert(0 <= l && l <= r && r <= N);
        ll hash1 = mul(bit1.sum(l, r), pow1_inv[l]);
        ll hash2 = mul(bit2.sum(l, r), pow2_inv[l]);
        return make_pair(hash1, hash2);
    }

    // 1点更新 : O(log |S|)
    void update(int i, char c) { update(i, (ll)c); }

    // 1点更新 : O(log |S|)
    void update(int i, ll v) {
        ll diff1 = mul(v, pow1[i]) - mul(A[i], pow1[i]);
        ll diff2 = mul(v, pow2[i]) - mul(A[i], pow2[i]);
        if (diff1 < 0) { diff1 += MOD; }
        if (diff2 < 0) { diff2 += MOD; }
        bit1.add(i, diff1);
        bit2.add(i, diff2);
        A[i] = v;
    }

    /** TODO: Verify **/
    // S[a:n) と S[b:n) の LCP の長さを求める : O((log |S|)^2)
    int lcp(int a, int b) const {
        assert(0 <= a && a < N);
        assert(0 <= b && b < N);
        if (a == b) { return N - a; }
        int l = min(a, b);
        int r = max(a, b);
        int ok = 0;
        int ng = N - r + 1;
        while (ng - ok > 1) {
            int m = (ok + ng) / 2;
            bool is_ok = hash(l, l + m) == hash(r, r + m);
            (is_ok ? ok : ng) = m;
        }
        return ok;
    }

  private:
    static constexpr ll MOD = (1LL << 61) - 1;
    static constexpr ll base1 = 10007;
    static constexpr ll base2 = 10091;

    struct BIT {
        int N;
        vector<ll> data;
        BIT() : N(0) {}
        BIT(int n) : N(n), data(n+1, 0) {}

        void add(int i, ll v) {
            assert(0 <= i && i < N);
            i++;
            while (i <= N) {
                if ((data[i] += v) >= MOD) { data[i] -= MOD; }
                i += i & (-i);
            }
        }

        // a[0] + ... + a[r-1]
        ll sum(int r) const {
            assert(0 <= r && r <= N);
            ll res = 0;
            while (r > 0) {
                if ((res += data[r]) >= MOD) { res -= MOD; }
                r -= r & (-r);
            }
            return res;
        }

        // a[l] + ... + a[r-1]
        ll sum(int l, int r) const {
            assert(0 <= l && l <= r && r <= N);
            ll res = sum(r) - sum(l);
            if (res < 0) { res += MOD; }
            return res;
        }
    };

    int N;
    vector<ll> pow1, pow2, pow1_inv, pow2_inv, A;
    BIT bit1, bit2;

    void build(const string& S) {
        int n = S.size();
        vector<ll> s(n);
        for (int i = 0; i < n; i++) { s[i] = (ll)S[i]; }
        build(s);
    }

    void build(const vector<ll>& s) {
        N = s.size();
        A.resize(N);
        pow1.resize(N+1, 1); pow1_inv.resize(N+1);
        pow2.resize(N+1, 1); pow2_inv.resize(N+1);
        bit1 = BIT(N); bit2 = BIT(N);
        for (int i = 0; i < N; i++) {
            A[i] = s[i];
            pow1[i+1] = mul(pow1[i], base1);
            pow2[i+1] = mul(pow2[i], base2);
            bit1.add(i, mul(A[i], pow1[i]));
            bit2.add(i, mul(A[i], pow2[i]));
        }
        pow1_inv[N] = inv(pow1[N]);
        pow2_inv[N] = inv(pow2[N]);
        for (int i = N-1; 0 <= i; i--) {
            pow1_inv[i] = mul(pow1_inv[i+1], base1);
            pow2_inv[i] = mul(pow2_inv[i+1], base2);
        }
    }

    constexpr ll mul(__int128_t a, __int128_t b) const {
        __int128_t t = a * b;
        t = (t >> 61) + (t & MOD);
        if (t >= MOD) { t -= MOD; }
        return t;
    }

    constexpr ll pow(ll x, ll n) const {
        if (n == 0) { return 1; }
        ll res = pow(x, n >> 1);
        res = mul(res, res);
        if (n & 1) { res = mul(res, x); }
        return res;
    }

    constexpr ll inv(ll x) const { return pow(x, MOD-2); }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N; input(N);
    VS S(N); REP(i,N) { input(S[i]); }

    set<P> st;
    REP(i,N) {
        Rolling_Hash rh(S[i]);
        int n = SZ(S[i]);

        auto h = rh.hash(0, n);
        bool ok = st.count(h);
        st.insert(h);
        REP(j,n-1) {
            rh.update(j, S[i][j+1]);
            rh.update(j+1, S[i][j]);
            st.insert(rh.hash(0, n));
            rh.update(j, S[i][j]);
        }

        string ans = (ok ? "Yes" : "No");
        print(ans);
    }


    return 0;
}
yukicoder

結果

ソースコード
