結果
問題 | No.996 Phnom Penh |
ユーザー | neterukun |
提出日時 | 2020-02-21 23:14:15 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,098 bytes |
コンパイル時間 | 560 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 71,936 KB |
最終ジャッジ日時 | 2024-10-09 02:16:21 |
合計ジャッジ時間 | 4,508 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
52,096 KB |
testcase_01 | AC | 39 ms
52,736 KB |
testcase_02 | AC | 40 ms
52,096 KB |
testcase_03 | AC | 41 ms
52,480 KB |
testcase_04 | AC | 40 ms
52,864 KB |
testcase_05 | AC | 48 ms
60,416 KB |
testcase_06 | AC | 40 ms
52,480 KB |
testcase_07 | AC | 41 ms
52,864 KB |
testcase_08 | AC | 48 ms
60,416 KB |
testcase_09 | AC | 45 ms
59,136 KB |
testcase_10 | AC | 40 ms
52,480 KB |
testcase_11 | AC | 42 ms
52,608 KB |
testcase_12 | AC | 42 ms
52,736 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 38 ms
52,480 KB |
testcase_19 | AC | 39 ms
52,608 KB |
testcase_20 | AC | 39 ms
52,096 KB |
testcase_21 | AC | 39 ms
52,224 KB |
testcase_22 | AC | 39 ms
52,352 KB |
testcase_23 | AC | 40 ms
52,352 KB |
testcase_24 | AC | 60 ms
66,176 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
ソースコード
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) res = ans ans = 0 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": tmp = 0 flag_o = False flag = True for j in range(i + 4, 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 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 + 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 + 2 break else: ans += tmp * 2 + 2 if flag: ans += 2 print(max(res, ans))