結果
| 問題 | No.996 Phnom Penh |
| コンテスト | |
| ユーザー |
neterukun
|
| 提出日時 | 2020-02-21 23:33:24 |
| 言語 | PyPy3 (7.3.17) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 3,124 bytes |
| 記録 | |
| コンパイル時間 | 298 ms |
| コンパイル使用メモリ | 82,304 KB |
| 実行使用メモリ | 72,064 KB |
| 最終ジャッジ日時 | 2024-10-09 02:38:54 |
| 合計ジャッジ時間 | 2,578 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 18 WA * 7 |
ソースコード
s = input()
n = len(s)
ans = 0
flag = False
for i in range(n - 3):
if s[i:i+4] == "penh":
flag = True
tmp = 0
flag_o = False
for j in range(i + 4, n):
if s[j] == "h":
continue
if s[j] == "e":
if tmp >= 1:
continue
else:
ans += tmp * 2
break
if s[j] == "o" and not flag_o:
flag_o = True
continue
if s[j] == "m" and flag_o:
flag_o = False
tmp += 1
continue
else:
ans += tmp * 2
break
else:
ans += tmp * 2
for i in range(n - 4):
if s[i:i+5] == "phnom":
tmp = 0
flag_o = False
flag = True
for j in range(i + 5, n):
if s[j] == "h":
continue
if s[j] == "e":
if tmp >= 1:
continue
else:
ans += tmp * 2 + 1
break
if s[j] == "o" and not flag_o:
flag_o = True
continue
if s[j] == "m" and flag_o:
flag_o = False
tmp += 1
continue
else:
ans += tmp * 2 + 1
break
else:
ans += tmp * 2 + 1
if flag:
ans += 2
if "h" in s:
ans = max(ans, 1)
if "e" in s:
ans = max(ans, 2)
if ans == 0:
print(ans)
exit()
res = ans
ans = 1
s = s.replace("h", "")
s = s.replace("e", "h")
n = len(s)
flag = False
for i in range(n - 3):
if s[i:i+4] == "penh":
flag = True
tmp = 0
flag_o = False
for j in range(i + 4, n):
if s[j] == "h":
continue
if s[j] == "e":
if tmp >= 1:
continue
else:
ans += tmp * 2
break
if s[j] == "o" and not flag_o:
flag_o = True
continue
if s[j] == "m" and flag_o:
flag_o = False
tmp += 1
continue
else:
ans += tmp * 2
break
else:
ans += tmp * 2
for i in range(n - 4):
if s[i:i+5] == "phnom":
tmp = 0
flag_o = False
flag = True
for j in range(i + 5, n):
if s[j] == "h":
continue
if s[j] == "e":
if tmp >= 1:
continue
else:
ans += tmp * 2 + 1
break
if s[j] == "o" and not flag_o:
flag_o = True
continue
if s[j] == "m" and flag_o:
flag_o = False
tmp += 1
continue
else:
ans += tmp * 2 + 1
break
else:
ans += tmp * 2 + 1
if flag:
ans += 2
print(max(res, ans))
neterukun