Submission #919888

#TimeUsernameProblemLanguageResultExecution timeMemory
919888vjudge1Monkey and Apple-trees (IZhO12_apple)Cpython 2
0 / 100
55 ms262144 KiB
M = int(input()) apple_trees = [0] * 1000000000 # initialize list with all zeros C = 0 for _ in range(M): D, X, Y = map(int, input().split()) if D == 1: count = 0 for i in range(X+C, Y+C+1): if apple_trees[i] == 1: count += 1 print(count) C = count elif D == 2: for i in range(X+C, Y+C+1): apple_trees[i] = 1
#Verdict Execution timeMemoryGrader output
Fetching results...