結果

問題 No.996 Phnom Penh
ユーザー neterukun
提出日時 2020-02-21 23:02:15
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,035 bytes
コンパイル時間 281 ms
コンパイル使用メモリ 82,644 KB
実行使用メモリ 72,832 KB
最終ジャッジ日時 2024-10-08 23:34:00
合計ジャッジ時間 2,755 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 7 WA * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

s = input()
n = len(s)

ans = 0
for i in range(n - 3):
    if s[i:i+4] == "penh":
        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 = max(ans, tmp * 2 + 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 = max(ans, tmp * 2 + 2)
                break
        else:
            ans = max(ans, tmp * 2 + 2)

for i in range(n - 4):
    if s[i:i+5] == "phnom":
        tmp = 0
        flag_o = False
        for j in range(i + 5, n):
            if s[j] == "h":
                continue
            if s[j] == "e":
                if tmp >= 1:
                    continue
                else:
                    ans = max(ans, tmp * 2 + 3)
                    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 = max(ans, tmp * 2 + 3)
                break
        else:
            ans = max(ans, tmp * 2 + 3)

if "h" in s:
    ans = max(ans, 1)
if "e" in s:
    ans = max(ans, 2)


s = s.replace("h", "")
s = s.replace("e", "h")
n = len(s)
for i in range(n - 3):
    if s[i:i+4] == "penh":
        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 = max(ans, tmp * 2 + 3)
                    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 = max(ans, tmp * 2 + 3)
                break
        else:
            ans = max(ans, tmp * 2 + 3)

for i in range(n - 4):
    if s[i:i+5] == "phnom":
        tmp = 0
        flag_o = False
        for j in range(i + 5, n):
            if s[j] == "h":
                continue
            if s[j] == "e":
                if tmp >= 1:
                    continue
                else:
                    ans = max(ans, tmp * 2 + 4)
                    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 = max(ans, tmp * 2 + 4)
                break
        else:
            ans = max(ans, tmp * 2 + 4)


print(ans)
0