Submission #1496996


Source Code Expand

def sorted_arrays():
	n = int(raw_input())
	a = map(int, raw_input().split(" "))
	if n==1:
		print 1
		return
	ans = 1
	tag=0
	for i in range(1, n):
		if a[i-1]<a[i]:
			if tag==0:
				tag=1
			elif tag==-1:
				ans+=1
				# tag=0 because for the next most left subarray
				# we do not know whether increasing or decreasing
				tag=0
		if a[i-1]>a[i]:
			if tag==0:
				tag=-1
			elif tag==1:
				ans+=1
				tag=0
	print ans

if __name__ == "__main__":
	sorted_arrays()

Submission Info

Submission Time
Task A - Sorted Arrays
User zhuang
Language Python (2.7.6)
Score 300
Code Size 496 Byte
Status AC
Exec Time 72 ms
Memory 11320 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 10 ms 2568 KB
sample_02.txt AC 10 ms 2568 KB
sample_03.txt AC 10 ms 2568 KB
subtask_1_01.txt AC 44 ms 7860 KB
subtask_1_02.txt AC 36 ms 6704 KB
subtask_1_03.txt AC 27 ms 5088 KB
subtask_1_04.txt AC 66 ms 11320 KB
subtask_1_05.txt AC 66 ms 11320 KB
subtask_1_06.txt AC 72 ms 11320 KB
subtask_1_07.txt AC 68 ms 11308 KB
subtask_1_08.txt AC 68 ms 11308 KB
subtask_1_09.txt AC 69 ms 11308 KB
subtask_1_10.txt AC 10 ms 2568 KB
subtask_1_11.txt AC 10 ms 2568 KB