結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | TKTYI |
提出日時 | 2022-10-14 22:01:40 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 803 ms / 3,000 ms |
コード長 | 2,951 bytes |
コンパイル時間 | 5,187 ms |
コンパイル使用メモリ | 278,280 KB |
実行使用メモリ | 31,056 KB |
最終ジャッジ日時 | 2023-09-08 21:32:38 |
合計ジャッジ時間 | 40,709 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
18,896 KB |
testcase_01 | AC | 26 ms
18,756 KB |
testcase_02 | AC | 449 ms
24,372 KB |
testcase_03 | AC | 530 ms
25,912 KB |
testcase_04 | AC | 503 ms
24,384 KB |
testcase_05 | AC | 372 ms
21,800 KB |
testcase_06 | AC | 503 ms
24,652 KB |
testcase_07 | AC | 315 ms
22,260 KB |
testcase_08 | AC | 211 ms
19,172 KB |
testcase_09 | AC | 399 ms
25,168 KB |
testcase_10 | AC | 258 ms
21,008 KB |
testcase_11 | AC | 173 ms
21,532 KB |
testcase_12 | AC | 356 ms
23,796 KB |
testcase_13 | AC | 524 ms
26,940 KB |
testcase_14 | AC | 416 ms
22,948 KB |
testcase_15 | AC | 574 ms
24,972 KB |
testcase_16 | AC | 695 ms
27,980 KB |
testcase_17 | AC | 213 ms
21,408 KB |
testcase_18 | AC | 385 ms
23,908 KB |
testcase_19 | AC | 304 ms
22,132 KB |
testcase_20 | AC | 568 ms
27,280 KB |
testcase_21 | AC | 346 ms
19,360 KB |
testcase_22 | AC | 761 ms
29,092 KB |
testcase_23 | AC | 745 ms
29,316 KB |
testcase_24 | AC | 767 ms
29,132 KB |
testcase_25 | AC | 803 ms
29,192 KB |
testcase_26 | AC | 787 ms
29,152 KB |
testcase_27 | AC | 765 ms
29,196 KB |
testcase_28 | AC | 777 ms
29,132 KB |
testcase_29 | AC | 768 ms
29,132 KB |
testcase_30 | AC | 792 ms
29,156 KB |
testcase_31 | AC | 767 ms
29,132 KB |
testcase_32 | AC | 773 ms
29,128 KB |
testcase_33 | AC | 763 ms
29,144 KB |
testcase_34 | AC | 775 ms
29,068 KB |
testcase_35 | AC | 755 ms
29,192 KB |
testcase_36 | AC | 782 ms
29,056 KB |
testcase_37 | AC | 763 ms
29,260 KB |
testcase_38 | AC | 758 ms
29,192 KB |
testcase_39 | AC | 738 ms
29,056 KB |
testcase_40 | AC | 736 ms
29,192 KB |
testcase_41 | AC | 746 ms
29,180 KB |
testcase_42 | AC | 512 ms
25,704 KB |
testcase_43 | AC | 506 ms
25,888 KB |
testcase_44 | AC | 521 ms
25,580 KB |
testcase_45 | AC | 515 ms
25,824 KB |
testcase_46 | AC | 527 ms
25,696 KB |
testcase_47 | AC | 398 ms
23,052 KB |
testcase_48 | AC | 384 ms
22,692 KB |
testcase_49 | AC | 381 ms
22,668 KB |
testcase_50 | AC | 387 ms
22,872 KB |
testcase_51 | AC | 385 ms
23,116 KB |
testcase_52 | AC | 67 ms
20,796 KB |
testcase_53 | AC | 67 ms
20,768 KB |
testcase_54 | AC | 62 ms
20,804 KB |
testcase_55 | AC | 130 ms
18,860 KB |
testcase_56 | AC | 130 ms
18,776 KB |
testcase_57 | AC | 128 ms
18,784 KB |
testcase_58 | AC | 59 ms
20,320 KB |
testcase_59 | AC | 801 ms
31,056 KB |
testcase_60 | AC | 195 ms
18,656 KB |
testcase_61 | AC | 130 ms
18,708 KB |
testcase_62 | AC | 41 ms
19,232 KB |
testcase_63 | AC | 204 ms
18,848 KB |
testcase_64 | AC | 206 ms
18,828 KB |
testcase_65 | AC | 247 ms
18,736 KB |
testcase_66 | AC | 132 ms
18,772 KB |
testcase_67 | AC | 359 ms
18,840 KB |
testcase_68 | AC | 70 ms
18,824 KB |
testcase_69 | AC | 355 ms
18,692 KB |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i<r;i++) #define REP(i,n) FOR(i,0,n) #define RFOR(i,l,r) for(ll i=r-1;i>=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair<ll,ll> #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include<boost/multiprecision/cpp_int.hpp> namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>; template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;} template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;} template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;} template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;} template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;} ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));} using mint1=modint1000000007; using mint2=modint998244353; const ll mod1=1000000007; const ll mod2=998244353; //using mint=modint; //ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;} vector<ll>fast_mod_convolution(vector<ll>&a,vector<ll>&b,ll mod){ const ll m1=167772161,m2=469762049,m3=1224736769; const ll m1_inv_m2=inv_mod(m1,m2); const ll m12_inv_m3=inv_mod(m1*m2,m3); const ll m12_mod=m1*m2%mod; auto x=convolution<m1>(a,b); auto y=convolution<m2>(a,b); auto z=convolution<m3>(a,b); vector<ll>ret(sz(a)+1); REP(i,sz(a)+1){ ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2; ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3; ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod; } return ret; } int main(){ ll N;cin>>N; set<pair<ll,PA>>M; vector<mint1>p1(2e6,1); vector<mint2>p2(2e6,1); FOR(i,1,2e6)p1[i]=p1[i-1]*26; FOR(i,1,2e6)p2[i]=p2[i-1]*26; while(N--){ string S; cin>>S; mint1 hs1; mint2 hs2; REP(i,sz(S))hs1+=p1[i]*(S[i]-'a'); REP(i,sz(S))hs2+=p2[i]*(S[i]-'a'); bool ok=0; if(M.count(make_pair(sz(S),PA(hs1.val(),hs2.val()))))ok=1; REP(i,sz(S)-1){ hs1+=(p1[i]-p1[i+1])*(S[i+1]-S[i]); hs2+=(p2[i]-p2[i+1])*(S[i+1]-S[i]); if(M.count(make_pair(sz(S),PA(hs1.val(),hs2.val()))))ok=1; hs1-=(p1[i]-p1[i+1])*(S[i+1]-S[i]); hs2-=(p2[i]-p2[i+1])*(S[i+1]-S[i]); } cout<<(ok?"Yes":"No")<<endl; M.insert(make_pair(sz(S),PA(hs1.val(),hs2.val()))); } return 0; }