Submission #312735

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
312735	2020-10-14 09:13:15	DEPRomaniac	Non-boring sequences (CERC12_D)	Cpython 3	0 / 1	27 ms	4212 KiB

D

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
def check_boring(first, last):
  if first>=last:
    return 1
  for i in range(first,int((first+last)/2)+1):
    if prev[i]<first and next[i]>last:
      return (check_boring(first,i-1) and check_boring(i+1, last))
    if prev[last-i]<first and next[last-i]>last:
      return (check_boring(first,last-i-1) and check_boring(last-i+1, last))
  return 0
def assign_prev():
  d.clear()
  for i in range(0,n):
    if arr[i] in d:
      prev[i] = d[arr[i]]
    else:
      prev[i] = -1
    d[arr[i]] = i
def assign_next():
  d.clear()
  for i in range(n-1, -1, -1):
    if arr[i] in d:
      next[i] = d[arr[i]]
    else:
      next[i] = n
    d[arr[i]] = i
d = dict()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 1