Submission #1353924
Source Code Expand
import java.util.Scanner; public class Main { static Scanner in = new Scanner(System.in); static boolean[][] r; public static void main(String[] args){ int N = in.nextInt(); int[] a = new int[N]; for(int i = 0; i < N; i++){ a[i] = in.nextInt(); } int ud = 0; int sum = 1; for(int i = 1; i < N; i++){ if(i == 0){ }else if(ud == 1){ if(a[i - 1] > a[i]){ ud = 0; sum++; } }else if(ud == -1){ if(a[i - 1] < a[i]){ ud = 0; sum++; } }else{ if(a[i - 1] < a[i]){ ud = 1; }else if(a[i - 1] > a[i]){ ud = -1; } } } System.out.println(sum); } }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | mosmos21 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 677 Byte |
Status | AC |
Exec Time | 463 ms |
Memory | 50884 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 98 ms | 17876 KB |
sample_02.txt | AC | 97 ms | 21844 KB |
sample_03.txt | AC | 97 ms | 21204 KB |
subtask_1_01.txt | AC | 411 ms | 47060 KB |
subtask_1_02.txt | AC | 366 ms | 44760 KB |
subtask_1_03.txt | AC | 302 ms | 37152 KB |
subtask_1_04.txt | AC | 459 ms | 50884 KB |
subtask_1_05.txt | AC | 463 ms | 47948 KB |
subtask_1_06.txt | AC | 451 ms | 50516 KB |
subtask_1_07.txt | AC | 437 ms | 45720 KB |
subtask_1_08.txt | AC | 449 ms | 48412 KB |
subtask_1_09.txt | AC | 446 ms | 49948 KB |
subtask_1_10.txt | AC | 96 ms | 21716 KB |
subtask_1_11.txt | AC | 94 ms | 20560 KB |