結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | kwm_t |
提出日時 | 2022-10-15 17:01:16 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,259 bytes |
コンパイル時間 | 2,257 ms |
コンパイル使用メモリ | 207,276 KB |
実行使用メモリ | 24,808 KB |
最終ジャッジ日時 | 2023-09-09 02:47:21 |
合計ジャッジ時間 | 26,013 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
6,212 KB |
testcase_01 | AC | 5 ms
6,268 KB |
testcase_02 | AC | 237 ms
14,924 KB |
testcase_03 | AC | 279 ms
17,088 KB |
testcase_04 | AC | 244 ms
14,444 KB |
testcase_05 | AC | 153 ms
10,824 KB |
testcase_06 | AC | 249 ms
15,036 KB |
testcase_07 | AC | 210 ms
11,012 KB |
testcase_08 | AC | 41 ms
6,736 KB |
testcase_09 | AC | 247 ms
15,760 KB |
testcase_10 | AC | 99 ms
9,488 KB |
testcase_11 | AC | 81 ms
10,560 KB |
testcase_12 | AC | 198 ms
13,656 KB |
testcase_13 | AC | 311 ms
18,356 KB |
testcase_14 | AC | 197 ms
12,732 KB |
testcase_15 | AC | 307 ms
15,400 KB |
testcase_16 | AC | 455 ms
20,624 KB |
testcase_17 | AC | 139 ms
10,164 KB |
testcase_18 | AC | 258 ms
13,992 KB |
testcase_19 | AC | 130 ms
11,172 KB |
testcase_20 | AC | 389 ms
19,148 KB |
testcase_21 | AC | 75 ms
7,264 KB |
testcase_22 | AC | 469 ms
21,844 KB |
testcase_23 | AC | 491 ms
21,728 KB |
testcase_24 | AC | 505 ms
21,848 KB |
testcase_25 | AC | 532 ms
21,896 KB |
testcase_26 | AC | 498 ms
21,740 KB |
testcase_27 | AC | 542 ms
21,724 KB |
testcase_28 | AC | 525 ms
21,780 KB |
testcase_29 | WA | - |
testcase_30 | AC | 515 ms
21,852 KB |
testcase_31 | AC | 514 ms
21,780 KB |
testcase_32 | AC | 513 ms
21,968 KB |
testcase_33 | AC | 471 ms
21,836 KB |
testcase_34 | AC | 481 ms
21,728 KB |
testcase_35 | AC | 468 ms
21,732 KB |
testcase_36 | AC | 519 ms
21,740 KB |
testcase_37 | WA | - |
testcase_38 | AC | 518 ms
21,780 KB |
testcase_39 | AC | 514 ms
21,832 KB |
testcase_40 | AC | 501 ms
21,908 KB |
testcase_41 | AC | 526 ms
21,828 KB |
testcase_42 | AC | 368 ms
16,564 KB |
testcase_43 | AC | 378 ms
16,588 KB |
testcase_44 | AC | 353 ms
16,560 KB |
testcase_45 | AC | 340 ms
16,504 KB |
testcase_46 | AC | 379 ms
16,456 KB |
testcase_47 | AC | 270 ms
12,664 KB |
testcase_48 | AC | 271 ms
12,552 KB |
testcase_49 | AC | 258 ms
12,592 KB |
testcase_50 | AC | 271 ms
12,596 KB |
testcase_51 | AC | 262 ms
12,668 KB |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | RE | - |
testcase_55 | AC | 80 ms
6,140 KB |
testcase_56 | AC | 80 ms
6,260 KB |
testcase_57 | AC | 82 ms
6,200 KB |
testcase_58 | RE | - |
testcase_59 | AC | 536 ms
24,808 KB |
testcase_60 | AC | 24 ms
6,144 KB |
testcase_61 | AC | 80 ms
6,196 KB |
testcase_62 | AC | 12 ms
6,732 KB |
testcase_63 | AC | 75 ms
6,144 KB |
testcase_64 | AC | 92 ms
6,092 KB |
testcase_65 | AC | 171 ms
6,260 KB |
testcase_66 | AC | 79 ms
6,192 KB |
testcase_67 | AC | 52 ms
6,212 KB |
testcase_68 | AC | 27 ms
6,164 KB |
testcase_69 | AC | 44 ms
6,196 KB |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair<int,int> template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; long long mod1 = 1000000007; long long mod2 = 998244353; int kind = 27; vector<long long>table1(200005), table2(200005); table1[0] = 1, table2[0] = 1; rep2(i, 1, table1.size()) { table1[i] = (table1[i - 1] * kind) % mod1; table2[i] = (table2[i - 1] * kind) % mod2; } set<long long>st1, st2; rep(i, n) { string s; cin >> s; long long base1 = 0; long long base2 = 0; rep(j, s.size()) { base1 += table1[j] * (s[j] - 'a' + 1); base1 %= mod1; base2 += table2[j] * (s[j] - 'a' + 1); base2 %= mod2; } bool chk = false; if (st1.count(base1) && st2.count(base2))chk = true; rep(j, s.size() - 1) { long long val1 = base1; val1 += mod1 - table1[j + 0] * (s[j + 0] - 'a' + 1) % mod1; val1 += mod1 - table1[j + 1] * (s[j + 1] - 'a' + 1) % mod1; val1 += table1[j + 0] * (s[j + 1] - 'a' + 1); val1 += table1[j + 1] * (s[j + 0] - 'a' + 1); val1 %= mod1; long long val2 = base2; val2 += mod2 - table2[j + 0] * (s[j + 0] - 'a' + 1) % mod2; val2 += mod2 - table2[j + 1] * (s[j + 1] - 'a' + 1) % mod2; val2 += table2[j + 0] * (s[j + 1] - 'a' + 1); val2 += table2[j + 1] * (s[j + 0] - 'a' + 1); val2 %= mod2;\ if (st1.count(val1) && st2.count(val2))chk = true; } if (chk)cout << "Yes" << endl; else cout << "No" << endl; st1.insert(base1); st2.insert(base2); } return 0; }