結果
問題 | No.1159 Sashiming String |
ユーザー | McGregorsh |
提出日時 | 2022-07-12 09:05:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 324 ms / 2,000 ms |
コード長 | 1,648 bytes |
コンパイル時間 | 1,004 ms |
コンパイル使用メモリ | 86,664 KB |
実行使用メモリ | 95,668 KB |
最終ジャッジ日時 | 2023-09-05 08:17:09 |
合計ジャッジ時間 | 6,541 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 248 ms
92,244 KB |
testcase_01 | AC | 253 ms
92,200 KB |
testcase_02 | AC | 324 ms
93,340 KB |
testcase_03 | AC | 259 ms
93,112 KB |
testcase_04 | AC | 269 ms
93,100 KB |
testcase_05 | AC | 271 ms
93,476 KB |
testcase_06 | AC | 265 ms
93,224 KB |
testcase_07 | AC | 265 ms
93,344 KB |
testcase_08 | AC | 274 ms
95,668 KB |
testcase_09 | AC | 278 ms
94,832 KB |
testcase_10 | AC | 252 ms
92,244 KB |
testcase_11 | AC | 252 ms
92,348 KB |
testcase_12 | AC | 252 ms
91,996 KB |
testcase_13 | AC | 252 ms
92,312 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 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() nums = [] for i in range(len(s)-2): if s[i:i+3] == 'ing': nums.append(i) len_num = len(nums) ans = 0 for i in range(len(s)): if s[i] == 'S': score = len_num - bisect_left(nums, i) ans += score print(ans) if __name__ == '__main__': main()