Submission #1482399


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) {
				up=v<poll;
			}
			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 0
Code Size 749 Byte
Status WA
Exec Time 469 ms
Memory 48788 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 15
WA × 2
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 91 ms 21460 KB
sample_02.txt AC 91 ms 20688 KB
sample_03.txt AC 92 ms 19540 KB
subtask_1_01.txt AC 338 ms 41872 KB
subtask_1_02.txt AC 307 ms 47384 KB
subtask_1_03.txt AC 245 ms 37020 KB
subtask_1_04.txt AC 406 ms 46080 KB
subtask_1_05.txt AC 397 ms 45192 KB
subtask_1_06.txt AC 403 ms 47852 KB
subtask_1_07.txt WA 411 ms 47732 KB
subtask_1_08.txt AC 408 ms 47200 KB
subtask_1_09.txt WA 469 ms 48788 KB
subtask_1_10.txt AC 91 ms 21716 KB
subtask_1_11.txt AC 91 ms 20564 KB