結果
| 問題 |
No.8061 uxs hxixtya pyuyn ixc hyixa kxuyn
|
| コンテスト | |
| ユーザー |
tamato
|
| 提出日時 | 2020-04-01 22:10:47 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,284 bytes |
| コンパイル時間 | 151 ms |
| コンパイル使用メモリ | 81,880 KB |
| 実行使用メモリ | 54,260 KB |
| 最終ジャッジ日時 | 2024-06-27 11:05:04 |
| 合計ジャッジ時間 | 1,886 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 11 WA * 8 |
ソースコード
def main():
import sys
input = sys.stdin.readline
S = input().rstrip('\n')
N = len(S)
seen = set()
new = [s for s in S]
for i in range(0, N, 2):
seen.add(S[i])
new[i] = ' '
for i in range(1, N, 2):
if S[i] in seen:
new[i] = ' '
exist = []
for i in range(N):
if new[i] != ' ':
exist.append(i)
if len(exist) >= 2:
diff = [exist[i+1] - exist[i] for i in range(len(exist) - 1)]
if min(diff) == max(diff) == 2:
print('Yes')
exit()
if len(exist) == 1:
if exist[0] != N-1:
print('Yes')
exit()
seen = set()
new = [s for s in S]
for i in range(1, N, 2):
seen.add(S[i])
new[i] = ' '
for i in range(0, N, 2):
if S[i] in seen:
new[i] = ' '
exist = []
for i in range(N):
if new[i] != ' ':
exist.append(i)
if len(exist) >= 2:
diff = [exist[i + 1] - exist[i] for i in range(len(exist) - 1)]
if min(diff) == max(diff) == 2:
print('Yes')
exit()
if len(exist) == 1:
if exist[0] != N-1:
print('Yes')
exit()
print('NO')
if __name__ == '__main__':
main()
tamato