Submission #1221934
Source Code Expand
n=gets.to_i a=gets.split.map(&:to_i) s=0;i=0;j=0 nn=0 while(nn<n) while((i<n-1)&&(a[i]<=a[i+1]));i+=1;end while((j<n-1)&&(a[j]>=a[j+1]));j+=1;end i=j=nn= i>j ? i+1 : j+1 s+=1 end p s
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | hanada3355 |
Language | Ruby (2.3.3) |
Score | 300 |
Code Size | 206 Byte |
Status | AC |
Exec Time | 59 ms |
Memory | 8580 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 | 7 ms | 1788 KB |
sample_02.txt | AC | 7 ms | 1788 KB |
sample_03.txt | AC | 7 ms | 1788 KB |
subtask_1_01.txt | AC | 40 ms | 5892 KB |
subtask_1_02.txt | AC | 28 ms | 4740 KB |
subtask_1_03.txt | AC | 21 ms | 3588 KB |
subtask_1_04.txt | AC | 59 ms | 8452 KB |
subtask_1_05.txt | AC | 54 ms | 8452 KB |
subtask_1_06.txt | AC | 59 ms | 8452 KB |
subtask_1_07.txt | AC | 59 ms | 8580 KB |
subtask_1_08.txt | AC | 54 ms | 8452 KB |
subtask_1_09.txt | AC | 58 ms | 8452 KB |
subtask_1_10.txt | AC | 7 ms | 1788 KB |
subtask_1_11.txt | AC | 7 ms | 1788 KB |