結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー |
|
提出日時 | 2022-10-14 23:11:14 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,304 bytes |
コンパイル時間 | 2,292 ms |
コンパイル使用メモリ | 179,564 KB |
実行使用メモリ | 21,580 KB |
最終ジャッジ日時 | 2024-06-26 17:04:11 |
合計ジャッジ時間 | 23,257 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 15 WA * 55 |
コンパイルメッセージ
main.cpp: In function 'void in(T& ...)': main.cpp:28:55: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 28 | template<class... T> void in(T&... a){ (cin >> ... >> a); } | ^ main.cpp: In function 'void out(const T&, const Ts& ...)': main.cpp:30:112: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 30 | template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } | ^
ソースコード
#include <bits/stdc++.h>using namespace std;#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(a) a.begin(), a.end()#define Sort(a) sort(a.begin(), a.end())#define RSort(a) sort(a.rbegin(), a.rend())typedef long long int ll;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef pair<long long, long long> P;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; i++){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }struct RollingHash{vector<unsigned long> hashed, power;static constexpr unsigned long mod = (1uL << 61) - 1;unsigned long mul(__int128_t a, __int128_t b) const {__int128_t t = a * b;t = (t >> 61) + (t & mod);if(t >= mod) return t - mod;return t;}RollingHash(const string &s, unsigned base = 10007){int siz = (int) s.size();hashed.assign(siz + 1, 0);power.assign(siz + 1, 0);power[0] = 1;for(int i = 0; i < siz; i++){power[i + 1] = mul(power[i], base);hashed[i + 1] = mul(hashed[i], base) + s[i];if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;}}unsigned long get(int l, int r) const {unsigned long ret = hashed[r] + mod - mul(hashed[l], power[r - l]);if(ret >= mod) ret -= mod;return ret;}unsigned long connect(unsigned h1, int h2, int h2len) const {unsigned long ret = mul(h1, power[h2len]) + h2;if(ret >= mod) ret -= mod;return ret;}int LCP(const RollingHash &b, int l1, int r1, int l2, int r2){int len = min(r1 - l1, r2 - l2);int low = -1, high = len + 1;while(high - low > 1){int mid = (low + high) / 2;if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;else high = mid;}return low;}};template <typename T>T modpow(T x, T n, const T &m){T ret = 1 % m;x %= m;while(n > 0){if(n & 1) (ret *= x) %= m;(x *= x) %= m;n >>= 1;}return ret;}template <typename T>T modinv(T a, T m){T b = m, u = 1, v = 0;while(b){T t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}ll BASE = 10007;ll n;vst s;void input(){in(n);vin(s, n);}void solve(){map<ll, ll> mp;rep(i, n){string ans = "No";ll hashed = 0;ll m = s[i].size();rep(j, (int) m){hashed += ((ll) s[i][j]) * modpow(BASE, (ll) j + 1, MOD);hashed %= MOD;}rep(j, m - 1){ll a = ((ll) s[i][j]) * (modpow(BASE, (ll) j + 2, MOD) + MOD - modpow(BASE, (ll) j + 1, MOD)), b = ((ll) s[i][j + 1]) * (modpow(BASE, (ll) j + 2, MOD) + MOD - modpow(BASE, (ll) j + 1, MOD));a %= MOD; b %= MOD;hashed += a; hashed += MOD - b;hashed %= MOD;if(mp.count(hashed) != 0){ans = "Yes";break;}hashed += MOD - a; hashed += b;hashed %= MOD;}mp[hashed] = 1;out(ans);}}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);input();solve();}