結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー |
![]() |
提出日時 | 2022-10-14 22:50:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 153 ms / 3,000 ms |
コード長 | 3,139 bytes |
コンパイル時間 | 2,279 ms |
コンパイル使用メモリ | 224,480 KB |
最終ジャッジ日時 | 2025-02-08 04:31:58 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 70 |
ソースコード
#include<bits/stdc++.h> namespace { #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wunused-function" #include<atcoder/all> #pragma GCC diagnostic pop using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair<int,int>; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<ll>; using VVL = vector<VL>; class mint61 { using ull = unsigned long long; using ui128 = __uint128_t; public: static constexpr unsigned long long mod = (1ULL << 61) - 1; ull v = 0; explicit constexpr mint61() {} explicit constexpr mint61(ull x) { v = (x >> 61) + (x & mod); if (v >= mod) v -= mod; } static constexpr mint61 raw(ull x) { mint61 res; res.v = x; return res; } friend constexpr mint61 operator+(mint61 lhs, mint61 rhs) { auto res = lhs.v + rhs.v; return raw(res < mod ? res : res - mod); } friend constexpr mint61 operator-(mint61 lhs, mint61 rhs) { return raw(lhs.v >= rhs.v ? lhs.v - rhs.v : mod + lhs.v - rhs.v); } static constexpr ull multiply_loose_mod(mint61 lhs, mint61 rhs) { // ab = q(m+1)+r = qm+q+r // q+r = ab-qm = ab-floor(ab/(m+1))m < ab-(ab/(m+1)-1)m = ab/(m+1)+m <= (m-1)^2/(m+1)+m = 2m-1-2/(m+1) auto mul = ui128(lhs.v) * rhs.v; return ull(mul >> 61) + ull(mul & mod); } friend constexpr mint61 operator*(mint61 lhs, mint61 rhs) { auto res = multiply_loose_mod(lhs, rhs); return raw(res < mod ? res : res - mod); } mint61& operator+=(mint61 rhs) { return *this = *this + rhs; } mint61& operator-=(mint61 rhs) { return *this = *this - rhs; } mint61& operator*=(mint61 rhs) { return *this = *this * rhs; } friend ostream& operator<<(ostream& os, mint61 x) { return os << x.v; } }; static auto RNG = std::mt19937(std::chrono::system_clock::now().time_since_epoch().count()); static auto Distribution = std::uniform_int_distribution<unsigned long long>(1, mint61::mod - 1); const auto B = mint61::raw(Distribution(RNG)); constexpr int MX = 1000100; mint61 powB[1000100]; } int main() { ios::sync_with_stdio(false); cin.tie(0); powB[0] = mint61::raw(1); rep(i, MX - 1) powB[i + 1] = powB[i] * B; using ull = unsigned long long; unordered_set<ull> seen; int n; cin >> n; rep(_, n) { string s; cin >> s; mint61 hash; int sz = s.size(); rep(i, sz) hash += powB[i] * mint61(s[i]); bool ok = false; if (seen.count(hash.v)) ok = true; rep(i, sz - 1) { mint61 v0 = mint61(s[i]), v1 = mint61(s[i+1]); mint61 d = v1 - v0; hash += powB[i] * d; hash -= powB[i+1] * d; if (seen.count(hash.v)) ok = true; hash -= powB[i] * d; hash += powB[i+1] * d; } cout << (ok ? "Yes\n" : "No\n"); seen.insert(hash.v); } }