結果

問題 No.2102 [Cherry Alpha *] Conditional Reflection
ユーザー tokusakuraitokusakurai
提出日時 2022-10-14 22:32:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 962 ms / 3,000 ms
コード長 7,268 bytes
コンパイル時間 2,276 ms
コンパイル使用メモリ 212,316 KB
実行使用メモリ 64,868 KB
最終ジャッジ日時 2024-06-26 15:55:41
合計ジャッジ時間 47,392 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
11,136 KB
testcase_01 AC 15 ms
11,008 KB
testcase_02 AC 339 ms
28,032 KB
testcase_03 AC 497 ms
37,248 KB
testcase_04 AC 329 ms
27,136 KB
testcase_05 AC 165 ms
17,920 KB
testcase_06 AC 347 ms
28,288 KB
testcase_07 AC 767 ms
51,840 KB
testcase_08 AC 44 ms
11,776 KB
testcase_09 AC 562 ms
42,112 KB
testcase_10 AC 106 ms
15,616 KB
testcase_11 AC 142 ms
21,760 KB
testcase_12 AC 263 ms
27,136 KB
testcase_13 AC 682 ms
46,336 KB
testcase_14 AC 222 ms
22,656 KB
testcase_15 AC 401 ms
29,312 KB
testcase_16 AC 725 ms
44,800 KB
testcase_17 AC 446 ms
37,376 KB
testcase_18 AC 725 ms
50,944 KB
testcase_19 AC 166 ms
20,096 KB
testcase_20 AC 734 ms
48,768 KB
testcase_21 AC 73 ms
12,160 KB
testcase_22 AC 843 ms
50,688 KB
testcase_23 AC 843 ms
50,816 KB
testcase_24 AC 870 ms
50,688 KB
testcase_25 AC 838 ms
50,688 KB
testcase_26 AC 845 ms
50,688 KB
testcase_27 AC 843 ms
50,688 KB
testcase_28 AC 852 ms
50,560 KB
testcase_29 AC 962 ms
50,816 KB
testcase_30 AC 918 ms
50,816 KB
testcase_31 AC 864 ms
50,688 KB
testcase_32 AC 891 ms
50,688 KB
testcase_33 AC 855 ms
50,816 KB
testcase_34 AC 878 ms
50,816 KB
testcase_35 AC 877 ms
50,688 KB
testcase_36 AC 868 ms
50,688 KB
testcase_37 AC 920 ms
50,688 KB
testcase_38 AC 860 ms
50,688 KB
testcase_39 AC 867 ms
50,688 KB
testcase_40 AC 859 ms
50,560 KB
testcase_41 AC 891 ms
50,816 KB
testcase_42 AC 499 ms
24,704 KB
testcase_43 AC 509 ms
24,704 KB
testcase_44 AC 520 ms
24,832 KB
testcase_45 AC 532 ms
24,832 KB
testcase_46 AC 521 ms
24,704 KB
testcase_47 AC 899 ms
57,984 KB
testcase_48 AC 931 ms
57,984 KB
testcase_49 AC 921 ms
57,984 KB
testcase_50 AC 926 ms
57,984 KB
testcase_51 AC 919 ms
57,984 KB
testcase_52 AC 884 ms
64,868 KB
testcase_53 AC 912 ms
64,864 KB
testcase_54 AC 879 ms
64,864 KB
testcase_55 AC 934 ms
56,192 KB
testcase_56 AC 888 ms
56,192 KB
testcase_57 AC 856 ms
56,192 KB
testcase_58 AC 77 ms
16,092 KB
testcase_59 AC 921 ms
54,784 KB
testcase_60 AC 40 ms
11,136 KB
testcase_61 AC 864 ms
56,192 KB
testcase_62 AC 21 ms
11,264 KB
testcase_63 AC 151 ms
11,392 KB
testcase_64 AC 139 ms
11,264 KB
testcase_65 AC 179 ms
11,392 KB
testcase_66 AC 855 ms
55,936 KB
testcase_67 AC 86 ms
11,008 KB
testcase_68 AC 87 ms
11,264 KB
testcase_69 AC 82 ms
11,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

struct Random_Number_Generator {
    mt19937_64 mt;

    Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}

    int64_t operator()(int64_t l, int64_t r) {
        uniform_int_distribution<int64_t> dist(l, r - 1);
        return dist(mt);
    }

    int64_t operator()(int64_t r) { return (*this)(0, r); }
} rng;

using ull = unsigned long long;

struct Rolling_Hash {
    const ull mod = (1ULL << 61) - 1;

    ull calc_mod(ull x) const {
        ull ret = (x >> 61) + (x & mod);
        return ret - (ret >= mod ? mod : 0);
    }

    ull mul(ull x, ull y) const {
        x = calc_mod(x), y = calc_mod(y);
        ull x1 = x >> 31, x2 = x & ((1ULL << 31) - 1), y1 = y >> 31, y2 = y & ((1ULL << 31) - 1);
        ull z = x1 * y2 + x2 * y1, z1 = z >> 30, z2 = z & ((1ULL << 30) - 1);
        return calc_mod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));
    }

    ull pow(ull x, ull n) const {
        ull ret = 1;
        for (; n > 0; n >>= 1, x = mul(x, x)) {
            if (n & 1) ret = mul(ret, x);
        }
        return ret;
    }

    ull base; // 基数
    vector<ull> hashed, pw;

    void set_base() { // 基数は乱数を用いて生成する
        Random_Number_Generator rng;
        while (true) {
            ull k = rng(mod);
            if (gcd(mod - 1, k) != 1) continue;
            base = pow(3, k);
            if (base < 256) continue;
            break;
        }
    }

    Rolling_Hash(const string &s) {
        set_base();
        int n = s.size();
        hashed.resize(n + 1), pw.resize(n + 1);
        hashed[0] = 0, pw[0] = 1;
        for (int i = 0; i < n; i++) {
            pw[i + 1] = mul(pw[i], base);
            hashed[i + 1] = mul(hashed[i], base) + s[i];
            if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
        }
    }

    ull query(int l, int r) const { // 文字列の [l,r) の部分のハッシュ値
        ull ret = hashed[r] + mod - mul(hashed[l], pw[r - l]);
        return ret - (ret >= mod ? mod : 0);
    }

    ull get_hash(const string &s) const {
        ull ret = 0;
        for (int i = 0; i < (int)s.size(); i++) {
            ret = mul(ret, base) + s[i];
            if (ret >= mod) ret -= mod;
        }
        return ret;
    }
};

template <typename T>
struct Array_Hash {
    const ull mod = (1ULL << 61) - 1;

    ull calc_mod(ull x) const {
        ull ret = (x >> 61) + (x & mod);
        return ret - (ret >= mod ? mod : 0);
    }

    ull mul(ull x, ull y) const {
        x = calc_mod(x), y = calc_mod(y);
        ull x1 = x >> 31, x2 = x & ((1ULL << 31) - 1), y1 = y >> 31, y2 = y & ((1ULL << 31) - 1);
        ull z = x1 * y2 + x2 * y1, z1 = z >> 30, z2 = z & ((1ULL << 30) - 1);
        return calc_mod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));
    }

    ull pow(ull x, ull n) const {
        ull ret = 1;
        for (; n > 0; n >>= 1, x = mul(x, x)) {
            if (n & 1) ret = mul(ret, x);
        }
        return ret;
    }

    ull base;
    vector<ull> pw;

    void set_base(T m) {
        while (true) {
            ull k = rng(mod);
            if (gcd(mod - 1, k) != 1) continue;
            base = pow(3, k);
            if (base <= ull(m)) continue;
            break;
        }
    }

    Array_Hash(int n, T m) { // 配列の長さ、要素の最大値
        set_base(m);
        pw.resize(n + 1);
        pw[0] = 1;
        for (int i = 0; i < n; i++) { pw[i + 1] = mul(pw[i], base); }
    }

    ull get_hash(const vector<T> &v) const {
        ull ret = 0;
        for (int i = 0; i < (int)v.size(); i++) {
            ret += mul(v[i], pw[i]);
            if (ret >= mod) ret -= mod;
        }
        return ret;
    }
};

int main() {
    int N;
    cin >> N;

    Array_Hash<ull> ah(1000000, 10000);

    using ull = unsigned long long;
    set<ull> s;

    rep(t, N) {
        string S;
        cin >> S;

        int K = sz(S);

        vector<ull> v(K);
        rep(i, K) v[i] = S[i];

        ull x = ah.get_hash(v);
        cout << (s.count(x) ? "Yes\n" : "No\n");
        s.emplace(x);

        rep(i, K - 1) {
            ull y = x;
            y += ah.mod - ah.mul(v[i], ah.pw[i]);
            y += ah.mod - ah.mul(v[i + 1], ah.pw[i + 1]);
            y += ah.mul(v[i + 1], ah.pw[i]);
            y += ah.mul(v[i], ah.pw[i + 1]);
            y %= ah.mod;
            s.emplace(y);
        }
    }
}
0