結果

問題 No.1535 五七五
ユーザー McGregorshMcGregorsh
提出日時 2022-07-20 23:28:13
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,609 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 86,960 KB
実行使用メモリ 267,784 KB
最終ジャッジ日時 2023-09-15 10:19:18
合計ジャッジ時間 11,524 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 239 ms
92,448 KB
testcase_03 AC 238 ms
92,516 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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():
   
   n = int(input())
   a, b, c = i_map()
   s = s_list()
   
   num_s = []
   for i in range(n):
   	  num_s.append(len(s[i]))
   
   A = set()
   que1 = deque()
   total1 = 0
   for i in range(n):
   	  que1.append(num_s[i])
   	  total1 += num_s[i]
   	  
   	  while total1 > a:
   	  	  num1 = que1.popleft()
   	  	  total1 -= num1
   	  
   	  if total1 == a:
   	  	  A.add(i)
   
   B = []
   que2 = deque()
   total2 = 0
   start = 0
   goal = 0
   for i in range(n):
   	  que2.append(num_s[i])
   	  total2 += num_s[i]
   	  goal += 1
   	  
   	  while total2 > b:
   	  	  num2 = que2.popleft()
   	  	  total2 -= num2
   	  	  start += 1
   	  
   	  if total2 == b:
   	  	  B.append([start, goal-1])
   
   C = set()
   que3 = deque()
   total3 = 0
   start1 = 0
   for i in range(n):
   	  que3.append(num_s[i])
   	  total3 += num_s[i]
   	  
   	  while total3 > c:
   	  	  num3 = que3.popleft()
   	  	  total3 -= num3
   	  	  start1 += 1
   	  if total3 == c:
   	  	  C.add(start1)
   
   #print(A)
   #print(B)
   #print(C)
   
   len_b = len(B)
   ans = 0
   for i in range(len_b):
   	  point1, point2 = B[i]
   	  if point1-1 in A and point2+1 in C:
   	  	  print(point1-1, point2+1)
   	  	  ans += 1
   print(ans)
   
if __name__ == '__main__':
    main()
0