結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | bayashiko |
提出日時 | 2022-10-15 00:38:56 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,085 ms / 3,000 ms |
コード長 | 3,378 bytes |
コンパイル時間 | 6,089 ms |
コンパイル使用メモリ | 297,384 KB |
実行使用メモリ | 91,172 KB |
最終ジャッジ日時 | 2023-09-09 01:21:50 |
合計ジャッジ時間 | 47,116 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
19,108 KB |
testcase_01 | AC | 12 ms
19,040 KB |
testcase_02 | AC | 620 ms
54,196 KB |
testcase_03 | AC | 662 ms
69,020 KB |
testcase_04 | AC | 653 ms
52,280 KB |
testcase_05 | AC | 488 ms
35,420 KB |
testcase_06 | AC | 675 ms
54,372 KB |
testcase_07 | AC | 209 ms
46,560 KB |
testcase_08 | AC | 169 ms
20,972 KB |
testcase_09 | AC | 473 ms
70,748 KB |
testcase_10 | AC | 317 ms
30,724 KB |
testcase_11 | AC | 208 ms
40,768 KB |
testcase_12 | AC | 483 ms
52,008 KB |
testcase_13 | AC | 633 ms
80,824 KB |
testcase_14 | AC | 561 ms
44,044 KB |
testcase_15 | AC | 765 ms
55,828 KB |
testcase_16 | AC | 912 ms
81,988 KB |
testcase_17 | AC | 168 ms
41,608 KB |
testcase_18 | AC | 340 ms
62,368 KB |
testcase_19 | AC | 382 ms
39,536 KB |
testcase_20 | AC | 669 ms
84,688 KB |
testcase_21 | AC | 307 ms
22,392 KB |
testcase_22 | AC | 981 ms
90,844 KB |
testcase_23 | AC | 968 ms
91,096 KB |
testcase_24 | AC | 970 ms
90,896 KB |
testcase_25 | AC | 923 ms
90,912 KB |
testcase_26 | AC | 948 ms
91,000 KB |
testcase_27 | AC | 982 ms
91,072 KB |
testcase_28 | AC | 939 ms
91,048 KB |
testcase_29 | AC | 969 ms
90,924 KB |
testcase_30 | AC | 1,000 ms
90,864 KB |
testcase_31 | AC | 999 ms
90,844 KB |
testcase_32 | AC | 984 ms
90,948 KB |
testcase_33 | AC | 977 ms
90,872 KB |
testcase_34 | AC | 991 ms
90,884 KB |
testcase_35 | AC | 991 ms
90,972 KB |
testcase_36 | AC | 992 ms
91,016 KB |
testcase_37 | AC | 962 ms
91,172 KB |
testcase_38 | AC | 963 ms
90,916 KB |
testcase_39 | AC | 975 ms
91,112 KB |
testcase_40 | AC | 985 ms
90,808 KB |
testcase_41 | AC | 977 ms
90,852 KB |
testcase_42 | AC | 497 ms
29,560 KB |
testcase_43 | AC | 511 ms
29,432 KB |
testcase_44 | AC | 531 ms
29,536 KB |
testcase_45 | AC | 517 ms
29,652 KB |
testcase_46 | AC | 505 ms
29,512 KB |
testcase_47 | AC | 386 ms
25,344 KB |
testcase_48 | AC | 381 ms
25,276 KB |
testcase_49 | AC | 403 ms
25,380 KB |
testcase_50 | AC | 384 ms
25,292 KB |
testcase_51 | AC | 363 ms
25,292 KB |
testcase_52 | AC | 22 ms
19,748 KB |
testcase_53 | AC | 22 ms
19,824 KB |
testcase_54 | AC | 21 ms
19,760 KB |
testcase_55 | AC | 22 ms
19,616 KB |
testcase_56 | AC | 22 ms
19,660 KB |
testcase_57 | AC | 21 ms
19,672 KB |
testcase_58 | AC | 56 ms
19,876 KB |
testcase_59 | AC | 1,085 ms
81,536 KB |
testcase_60 | AC | 66 ms
19,028 KB |
testcase_61 | AC | 141 ms
19,480 KB |
testcase_62 | AC | 24 ms
19,540 KB |
testcase_63 | AC | 48 ms
19,032 KB |
testcase_64 | AC | 48 ms
19,048 KB |
testcase_65 | AC | 60 ms
19,180 KB |
testcase_66 | AC | 142 ms
19,208 KB |
testcase_67 | AC | 152 ms
19,132 KB |
testcase_68 | AC | 99 ms
19,148 KB |
testcase_69 | AC | 104 ms
19,048 KB |
ソースコード
#if defined(LOCAL) #include<stdc++.h> #else #include<bits/stdc++.h> #endif #include<random> #pragma GCC optimize("Ofast") //#pragma GCC target("avx2") #pragma GCC optimize("unroll-loops") using namespace std; //#include<boost/multiprecision/cpp_int.hpp> //#include<boost/multiprecision/cpp_dec_float.hpp> //namespace mp=boost::multiprecision; //#define mulint mp::cpp_int //#define mulfloat mp::cpp_dec_float_100 struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init; //#define INF (1<<30) #define LINF (lint)(1LL<<56) #define MINF (lint)(2e18) #define endl "\n" #define rep(i,n) for(lint (i)=0;(i)<(n);(i)++) #define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--) #define flc(x) __builtin_popcountll(x) #define pint pair<int,int> #define pdouble pair<double,double> #define plint pair<lint,lint> #define fi first #define se second #define all(x) x.begin(),x.end() //#define vec vector<lint> #define nep(x) next_permutation(all(x)) typedef long long lint; int dx[8]={1,1,0,-1,-1,-1,0,1}; int dy[8]={0,1,1,1,0,-1,-1,-1}; const int MAX_N=3e5+5; template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;} //vector<int> bucket[MAX_N/1000]; constexpr int MOD107=1000000007; constexpr int MOD998=998244353; #include<atcoder/all> using namespace atcoder; typedef __int128_t llint; int main(void){ int N; cin >> N; map<vector<int>,set<lint>> nums998,nums107; lint pow998[1000010],pow107[1000010]; pow998[0]=1,pow107[0]=1; using mint998=modint998244353; using mint107=modint1000000007; rep(i,1000005){ pow998[i+1]=pow998[i]*26; pow998[i+1]%=MOD998; pow107[i+1]=pow107[i]*26; pow107[i+1]%=MOD107; } while(N--){ string S; cin >> S; vector<int> cnt(26); rep(i,S.length()) cnt[S[i]-'a']++; lint md998=0,md107=0,mul998=1,mul107=1; rep(i,S.length()){ md998+=(S[i]-'a')*mul998; md107+=(S[i]-'a')*mul107; mul998*=26; mul107*=26; mul998%=MOD998; mul107%=MOD107; md998%=MOD998; md107%=MOD107; } if(nums998[cnt].empty()){ cout << "No" << endl; } else{ if(nums998[cnt].count(md998) && nums107[cnt].count(md107)){ cout << "Yes" << endl; } else if(S.length()==1){ cout << "No" << endl; } else{ bool ans=false; rep(i,S.length()-1){ mint998 c998=md998; mint107 c107=md107; c998-=S[i]*pow998[i]; c998-=S[i+1]*pow998[i+1]; c998+=S[i+1]*pow998[i]; c998+=S[i]*pow998[i+1]; c107-=S[i]*pow107[i]; c107-=S[i+1]*pow107[i+1]; c107+=S[i+1]*pow107[i]; c107+=S[i]*pow107[i+1]; if(nums998[cnt].count(c998.val()) && nums107[cnt].count(c107.val())) ans=true; } if(ans) cout << "Yes" << endl; else cout << "No" << endl; } } nums998[cnt].insert(md998); nums107[cnt].insert(md107); } }