Submission #1482401


Source Code Expand

import java.util.ArrayDeque;
import java.util.Scanner;
class Main{
	static Scanner s=new Scanner(System.in);
	static int getInt(){return Integer.parseInt(s.next());}
	public static void main(String[]$){
		int n=getInt();
		ArrayDeque<Integer>a=new ArrayDeque<>(),b=new ArrayDeque<>();
		for(int i=0;i<n;++i) {
			int in=getInt();
			a.add(in);
			b.add(in);
		}

		System.out.println(Math.min(fal(a,true),fal(b,false)));
	}
	private static int fal(ArrayDeque<Integer>a,Boolean up){
		long v=up?-1:Long.MAX_VALUE;
		int c=1;
		while(!a.isEmpty()) {
			int poll=a.pollFirst();
			if(up==null) {
				if(v!=poll)
					up=v<poll;
			}else if(!((up&&v<=poll)||((!up)&&v>=poll))) {
				++c;
				up=null;
			}
			v=poll;
		}
		return c;
	}
}

Submission Info

Submission Time
Task A - Sorted Arrays
User fal_rnd
Language Java8 (OpenJDK 1.8.0)
Score 300
Code Size 765 Byte
Status AC
Exec Time 443 ms
Memory 50376 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 95 ms 21972 KB
sample_02.txt AC 87 ms 21844 KB
sample_03.txt AC 90 ms 19924 KB
subtask_1_01.txt AC 321 ms 42832 KB
subtask_1_02.txt AC 306 ms 43444 KB
subtask_1_03.txt AC 258 ms 36588 KB
subtask_1_04.txt AC 393 ms 48840 KB
subtask_1_05.txt AC 401 ms 46416 KB
subtask_1_06.txt AC 440 ms 50376 KB
subtask_1_07.txt AC 404 ms 47052 KB
subtask_1_08.txt AC 443 ms 46316 KB
subtask_1_09.txt AC 402 ms 47284 KB
subtask_1_10.txt AC 88 ms 21204 KB
subtask_1_11.txt AC 88 ms 19796 KB