結果
問題 | No.1534 おなかがいたい |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 12:43:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 284 ms / 2,000 ms |
コード長 | 1,635 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 87,080 KB |
実行使用メモリ | 92,960 KB |
最終ジャッジ日時 | 2023-08-17 18:37:18 |
合計ジャッジ時間 | 8,170 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 259 ms
92,496 KB |
testcase_01 | AC | 256 ms
92,284 KB |
testcase_02 | AC | 255 ms
92,164 KB |
testcase_03 | AC | 260 ms
92,288 KB |
testcase_04 | AC | 261 ms
92,240 KB |
testcase_05 | AC | 268 ms
92,344 KB |
testcase_06 | AC | 261 ms
92,148 KB |
testcase_07 | AC | 260 ms
92,280 KB |
testcase_08 | AC | 258 ms
92,104 KB |
testcase_09 | AC | 257 ms
92,160 KB |
testcase_10 | AC | 262 ms
92,284 KB |
testcase_11 | AC | 264 ms
92,168 KB |
testcase_12 | AC | 262 ms
92,936 KB |
testcase_13 | AC | 262 ms
92,260 KB |
testcase_14 | AC | 264 ms
92,256 KB |
testcase_15 | AC | 257 ms
92,284 KB |
testcase_16 | AC | 266 ms
92,944 KB |
testcase_17 | AC | 274 ms
92,960 KB |
testcase_18 | AC | 284 ms
92,880 KB |
testcase_19 | AC | 259 ms
92,340 KB |
testcase_20 | AC | 260 ms
92,944 KB |
testcase_21 | AC | 255 ms
92,200 KB |
testcase_22 | AC | 247 ms
92,356 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): S = input() lenS = len(S) if 'pain' not in S: print(-1) exit() p = 0 for i in range(lenS-3): if S[i:i+4] == 'pain': p = i break SS = S[:p] ans = SS.count('pon') if ans <= 1: print(-1) else: print(ans-1) if __name__ == '__main__': main()