Submission #69341816


Source Code Expand

import sys

def main():
  try:
    readline = sys.stdin.readline
    
    N_str, R_str = readline().split()
    N = int(N_str)
    R = int(R_str)
    
    L_str_list = readline().split()
    L = [int(x) for x in L_str_list]
  except (IOError, ValueError):
    return

  unlocked_indices = []
  for i in range(N):
    if L[i] == 0:
      unlocked_indices.append(i + 1)

  if not unlocked_indices:
    print(0)
    return

  l = unlocked_indices[0]
  r = unlocked_indices[-1]
  l_room = l - 1

  start_door, end_door = 0, 0
  if R > r:
    start_door = l
    end_door = R
  elif R < l_room:
    start_door = R + 1
    end_door = r
  else:
    start_door = l
    end_door = r

  P = [0] * (N + 1)
  for i in range(N):
    P[i + 1] = P[i] + L[i]

  def count_locked(start, end):
    if start > end:
      return 0
    return P[end] - P[start - 1]

  num_doors_in_range = end_door - start_door + 1
  num_locked_in_range = count_locked(start_door, end_door)

  total_switches = num_doors_in_range + num_locked_in_range
  
  print(total_switches)

if __name__ == "__main__":
  main()

Submission Info

Submission Time
Task C - Lock All Doors
User SegMan123
Language Python (CPython 3.11.4)
Score 300
Code Size 1134 Byte
Status AC
Exec Time 51 ms
Memory 23820 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 33
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt
Case Name Status Exec Time Memory
sample00.txt AC 9 ms 8888 KiB
sample01.txt AC 9 ms 8872 KiB
sample02.txt AC 10 ms 8900 KiB
testcase00.txt AC 35 ms 17696 KiB
testcase01.txt AC 49 ms 21476 KiB
testcase02.txt AC 44 ms 20216 KiB
testcase03.txt AC 48 ms 21376 KiB
testcase04.txt AC 13 ms 9528 KiB
testcase05.txt AC 32 ms 12144 KiB
testcase06.txt AC 26 ms 11712 KiB
testcase07.txt AC 32 ms 12188 KiB
testcase08.txt AC 24 ms 14220 KiB
testcase09.txt AC 51 ms 23820 KiB
testcase10.txt AC 40 ms 20528 KiB
testcase11.txt AC 51 ms 23808 KiB
testcase12.txt AC 13 ms 10396 KiB
testcase13.txt AC 50 ms 23804 KiB
testcase14.txt AC 45 ms 22196 KiB
testcase15.txt AC 51 ms 23808 KiB
testcase16.txt AC 46 ms 20988 KiB
testcase17.txt AC 46 ms 20096 KiB
testcase18.txt AC 10 ms 8872 KiB
testcase19.txt AC 50 ms 23228 KiB
testcase20.txt AC 31 ms 16168 KiB
testcase21.txt AC 46 ms 20908 KiB
testcase22.txt AC 45 ms 21168 KiB
testcase23.txt AC 46 ms 20616 KiB
testcase24.txt AC 42 ms 19500 KiB
testcase25.txt AC 46 ms 20108 KiB
testcase26.txt AC 44 ms 20064 KiB
testcase27.txt AC 51 ms 23312 KiB
testcase28.txt AC 45 ms 19800 KiB
testcase29.txt AC 46 ms 19868 KiB