結果
問題 | No.2102 [Cherry Alpha *] Conditional Reflection |
ユーザー | roaris |
提出日時 | 2022-10-14 23:22:44 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,182 bytes |
コンパイル時間 | 639 ms |
コンパイル使用メモリ | 87,240 KB |
実行使用メモリ | 258,052 KB |
最終ジャッジ日時 | 2023-09-08 23:46:25 |
合計ジャッジ時間 | 44,313 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 88 ms
71,564 KB |
testcase_01 | AC | 87 ms
71,516 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 543 ms
87,436 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 398 ms
83,520 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 640 ms
95,460 KB |
testcase_43 | AC | 642 ms
95,560 KB |
testcase_44 | AC | 639 ms
95,292 KB |
testcase_45 | AC | 636 ms
95,504 KB |
testcase_46 | AC | 640 ms
95,584 KB |
testcase_47 | AC | 595 ms
88,576 KB |
testcase_48 | AC | 584 ms
88,356 KB |
testcase_49 | AC | 581 ms
88,460 KB |
testcase_50 | AC | 582 ms
88,540 KB |
testcase_51 | AC | 580 ms
88,668 KB |
testcase_52 | AC | 411 ms
256,292 KB |
testcase_53 | AC | 402 ms
256,120 KB |
testcase_54 | AC | 405 ms
255,928 KB |
testcase_55 | AC | 560 ms
79,272 KB |
testcase_56 | AC | 561 ms
79,112 KB |
testcase_57 | AC | 560 ms
79,164 KB |
testcase_58 | AC | 569 ms
258,052 KB |
testcase_59 | AC | 742 ms
113,296 KB |
testcase_60 | WA | - |
testcase_61 | AC | 559 ms
79,280 KB |
testcase_62 | AC | 167 ms
78,892 KB |
testcase_63 | AC | 286 ms
79,416 KB |
testcase_64 | AC | 285 ms
79,408 KB |
testcase_65 | AC | 294 ms
80,128 KB |
testcase_66 | AC | 545 ms
79,156 KB |
testcase_67 | AC | 369 ms
80,440 KB |
testcase_68 | AC | 554 ms
79,360 KB |
testcase_69 | AC | 373 ms
79,808 KB |
ソースコード
import sys input = sys.stdin.readline from collections import * class RollingHash1: def __init__(self, s): self.base = 17 self.mod = 10**9+7 self.acc = [0] self.power = [1] for i in range(len(s)): self.acc.append((self.acc[-1]*self.base%self.mod+(ord(s[i])-ord('a')))%self.mod) self.power.append(self.power[-1]*self.base%self.mod) def get(self, l, r): return (self.acc[r]-self.acc[l]*self.power[r-l])%self.mod class RollingHash2: def __init__(self, s): self.base = 31 self.mod = 998244353 self.acc = [0] self.power = [1] for i in range(len(s)): self.acc.append((self.acc[-1]*self.base%self.mod+(ord(s[i])-ord('a')))%self.mod) self.power.append(self.power[-1]*self.base%self.mod) def get(self, l, r): return (self.acc[r]-self.acc[l]*self.power[r-l])%self.mod N = int(input()) ws = set() for _ in range(N): S = input()[:-1] n = len(S) rh1 = RollingHash1(S) rh2 = RollingHash2(S) h1 = rh1.get(0, n) h2 = rh2.get(0, n) if (h1, h2) in ws: print('Yes') else: for i in range(n-1): nh1 = h1 nh1 -= (ord(S[i])-ord('a'))*rh1.power[n-1-i]%rh1.mod nh1 %= rh1.mod nh1 -= (ord(S[i+1])-ord('a'))*rh1.power[n-2-i]%rh1.mod nh1 %= rh1.mod nh1 += (ord(S[i+1])-ord('a'))*rh1.power[n-1-i]%rh1.mod nh1 %= rh1.mod nh1 += (ord(S[i])-ord('a'))*rh1.power[n-2-i]%rh1.mod nh1 %= rh1.mod nh2 = h2 nh2 -= (ord(S[i])-ord('a'))*rh2.power[n-1-i]%rh2.mod nh2 %= rh2.mod nh2 -= (ord(S[i+1])-ord('a'))*rh2.power[n-2-i]%rh2.mod nh2 %= rh2.mod nh2 += (ord(S[i+1])-ord('a'))*rh2.power[n-1-i]%rh2.mod nh2 %= rh2.mod nh2 += (ord(S[i])-ord('a'))*rh2.power[n-2-i]%rh2.mod nh2 %= rh2.mod if (nh1, nh2) in ws: print('Yes') break else: print('No') ws.add((h1, h2))