結果
| 問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
| ユーザー |
 leaf_1415
|
| 提出日時 | 2022-10-14 22:44:17 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 2,055 ms / 3,000 ms |
| コード長 | 10,489 bytes |
| コンパイル時間 | 1,943 ms |
| コンパイル使用メモリ | 111,672 KB |
| 実行使用メモリ | 144,000 KB |
| 最終ジャッジ日時 | 2024-06-26 16:29:04 |
| 合計ジャッジ時間 | 102,622 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 85 ms
50,296 KB |
| testcase_01 | AC | 85 ms
50,176 KB |
| testcase_02 | AC | 844 ms
83,992 KB |
| testcase_03 | AC | 1,169 ms
102,528 KB |
| testcase_04 | AC | 823 ms
82,420 KB |
| testcase_05 | AC | 488 ms
63,872 KB |
| testcase_06 | AC | 892 ms
84,608 KB |
| testcase_07 | AC | 1,770 ms
131,456 KB |
| testcase_08 | AC | 158 ms
51,328 KB |
| testcase_09 | AC | 1,259 ms
112,384 KB |
| testcase_10 | AC | 345 ms
59,392 KB |
| testcase_11 | AC | 459 ms
71,552 KB |
| testcase_12 | AC | 774 ms
82,304 KB |
| testcase_13 | AC | 1,520 ms
120,624 KB |
| testcase_14 | AC | 663 ms
73,140 KB |
| testcase_15 | AC | 968 ms
86,400 KB |
| testcase_16 | AC | 1,626 ms
117,632 KB |
| testcase_17 | AC | 1,045 ms
102,912 KB |
| testcase_18 | AC | 1,627 ms
129,984 KB |
| testcase_19 | AC | 491 ms
68,352 KB |
| testcase_20 | AC | 1,577 ms
125,588 KB |
| testcase_21 | AC | 229 ms
52,224 KB |
| testcase_22 | AC | 1,806 ms
129,536 KB |
| testcase_23 | AC | 1,831 ms
129,408 KB |
| testcase_24 | AC | 1,797 ms
129,360 KB |
| testcase_25 | AC | 1,811 ms
129,408 KB |
| testcase_26 | AC | 1,831 ms
129,484 KB |
| testcase_27 | AC | 1,794 ms
129,448 KB |
| testcase_28 | AC | 1,835 ms
129,360 KB |
| testcase_29 | AC | 1,811 ms
129,408 KB |
| testcase_30 | AC | 1,796 ms
129,408 KB |
| testcase_31 | AC | 1,767 ms
129,408 KB |
| testcase_32 | AC | 1,813 ms
129,452 KB |
| testcase_33 | AC | 1,812 ms
129,488 KB |
| testcase_34 | AC | 1,865 ms
129,512 KB |
| testcase_35 | AC | 1,845 ms
129,408 KB |
| testcase_36 | AC | 1,838 ms
129,504 KB |
| testcase_37 | AC | 1,814 ms
129,448 KB |
| testcase_38 | AC | 1,818 ms
129,280 KB |
| testcase_39 | AC | 1,810 ms
129,408 KB |
| testcase_40 | AC | 1,782 ms
129,364 KB |
| testcase_41 | AC | 1,821 ms
129,408 KB |
| testcase_42 | AC | 1,479 ms
77,636 KB |
| testcase_43 | AC | 1,476 ms
77,696 KB |
| testcase_44 | AC | 1,476 ms
77,616 KB |
| testcase_45 | AC | 1,454 ms
77,568 KB |
| testcase_46 | AC | 1,485 ms
77,648 KB |
| testcase_47 | AC | 2,053 ms
144,000 KB |
| testcase_48 | AC | 2,031 ms
143,980 KB |
| testcase_49 | AC | 2,055 ms
143,988 KB |
| testcase_50 | AC | 2,001 ms
143,996 KB |
| testcase_51 | AC | 2,014 ms
143,856 KB |
| testcase_52 | AC | 1,985 ms
141,168 KB |
| testcase_53 | AC | 1,972 ms
141,044 KB |
| testcase_54 | AC | 1,961 ms
141,172 KB |
| testcase_55 | AC | 2,002 ms
140,352 KB |
| testcase_56 | AC | 1,995 ms
140,416 KB |
| testcase_57 | AC | 1,983 ms
140,368 KB |
| testcase_58 | AC | 765 ms
50,648 KB |
| testcase_59 | AC | 1,923 ms
137,584 KB |
| testcase_60 | AC | 224 ms
50,188 KB |
| testcase_61 | AC | 2,019 ms
140,400 KB |
| testcase_62 | AC | 115 ms
50,688 KB |
| testcase_63 | AC | 868 ms
50,508 KB |
| testcase_64 | AC | 838 ms
50,304 KB |
| testcase_65 | AC | 896 ms
51,072 KB |
| testcase_66 | AC | 1,987 ms
139,524 KB |
| testcase_67 | AC | 683 ms
50,216 KB |
| testcase_68 | AC | 776 ms
50,224 KB |
| testcase_69 | AC | 677 ms
50,268 KB |
ソースコード
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
struct edge{
ll to, cost;
edge(){}
edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const int mod = 1000000007;
//const int mod = 998244353;
struct mint{
int x;
mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
mint(const mint &ope) {x = ope.x;}
mint operator-(){return mint(-x);}
mint operator+(const mint &ope){return mint(x) += ope;}
mint operator-(const mint &ope){return mint(x) -= ope;}
mint operator*(const mint &ope){return mint(x) *= ope;}
mint operator/(const mint &ope){return mint(x) /= ope;}
mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
mint& operator/=(const mint &ope){
ll n = mod-2; mint mul = ope;
while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
return *this;
}
mint inverse(){return mint(1) / *this;}
bool operator ==(const mint &ope){return x == ope.x;}
bool operator !=(const mint &ope){return x != ope.x;}
bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
if(n == 0) return mint(1);
if(n % 2) return a * modpow(a, n-1);
else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope.x = t; return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
ll modpow(ll a, ll n, ll mod){
if(n == 0) return 1;
if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
else return modpow((a*a)%mod, n/2, mod) % mod;
}
vector<mint> fact, fact_inv;
void make_fact(int n){
fact.resize(n+1), fact_inv.resize(n+1);
fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
template<typename T> T comb2(ll n, ll k){ T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}
vector<int> prime, pvec, qrime;
void make_prime(int n){
prime.resize(n+1);
rep(i, 2, n){
if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
}
}
void make_qrime(int n){
qrime.resize(n+1);
rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll arith(ll x){return x*(x+1)/2;}
ll arith(ll l, ll r){return arith(r) - arith(l-1);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}
template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i, deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}
//まずhmod[]の値を決める！！
const ll L = 6; ll hmod[L] = {950009857, 943718401, 935329793, 924844033, 469762049, 167772161};
struct Hash{
ll h[L];
Hash(){ rep(i, 0, L-1) h[i] = 0;}
Hash(ll x){ rep(i, 0, L-1) h[i] = x % hmod[i];}
Hash operator+(const Hash &ope){Hash h = *this; return h += ope;}
Hash operator-(const Hash &ope){Hash h = *this; return h -= ope;}
Hash operator*(const Hash &ope){Hash h = *this; return h *= ope;}
Hash operator^(const Hash &ope){Hash h = *this; return h^= ope;}
Hash& operator+=(const Hash &ope){
rep(i, 0, L-1){
h[i] += ope.h[i];
if(h[i] >= hmod[i]) h[i] -= hmod[i];
}
return *this;
}
Hash& operator-=(const Hash &ope){
rep(i, 0, L-1){
h[i] += hmod[i] - ope.h[i];
if(h[i] >= hmod[i]) h[i] -= hmod[i];
}
return *this;
}
Hash& operator*=(const Hash &ope){
rep(i, 0, L-1) h[i] *= ope.h[i], h[i] %= hmod[i];
return *this;
}
Hash& operator^=(const Hash &ope){
rep(i, 0, L-1) h[i] ^= ope.h[i];
return *this;
}
bool operator<(const Hash &ope) const{
rep(i, 0, L-1) if(h[i] != ope.h[i]) return h[i] < ope.h[i];
return false;
}
bool operator ==(const Hash &ope){
rep(i, 0, L-1) if(h[i] != ope.h[i]) return false;
return true;
}
bool operator !=(const Hash &ope){return !(*this == ope);}
Hash inverse(){
Hash ret;
rep(i, 0, L-1) ret.h[i] = modpow(h[i], hmod[i]-2, hmod[i]);
return ret;
}
};
ostream& operator <<(ostream &os, Hash &ope){
cout << "("; for(int i = 0; i < L; i++) os << ope.h[i] << (i + 1 == L ? "" : ", "); cout << ")";
return os;
}
ostream& operator <<(ostream &os, const Hash &ope){
cout << "("; for(int i = 0; i < L; i++) os << ope.h[i] << (i + 1 == L ? "" : ", "); cout << ")";
return os;
}
ll n;
set<Hash> S;
Hash beki[1000005];
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
Hash H = Hash(998244353);
beki[0] = Hash(1);
rep(i, 1, 1000000) beki[i] = beki[i-1] * H;
string s;
rep(i, 1, n){
cin >> s;
Hash h = Hash(0);
reps(i, s) h += Hash(s[i]) * beki[i];
if(S.count(h)) cout << "Yes" << "\n";
else cout << "No" << "\n";
S.insert(h);
rep(i, 1, sz(s)-1){
Hash h2 = h;
h2 -= Hash(s[i-1]) * beki[i-1] + Hash(s[i]) * beki[i];
h2 += Hash(s[i]) * beki[i-1] + Hash(s[i-1]) * beki[i];
S.insert(h2);
}
}
return 0;
}