Submission #1221350
Source Code Expand
#include<cstdio> #include<algorithm> #define rep(i,x,y) for(int i=(x);i<=(y);++i) #define per(i,x,y) for(int i=(x);i>=(y);--i) int n; int main(){ scanf("%d",&n); int lst=0,dir=0; int ans=1; rep(i,1,n){ int x;scanf("%d",&x); if(dir==0){ if(lst){ if(lst<x)dir=1; if(lst>x)dir=-1; } }else{ if((dir==1&&lst>x)||(dir==-1&&lst<x)){ lst=0;++ans;dir=0; } } lst=x; } printf("%d",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | sjj118 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 455 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:11:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int x;scanf("%d",&x); ^
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 | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
subtask_1_01.txt | AC | 7 ms | 128 KB |
subtask_1_02.txt | AC | 6 ms | 128 KB |
subtask_1_03.txt | AC | 4 ms | 128 KB |
subtask_1_04.txt | AC | 12 ms | 128 KB |
subtask_1_05.txt | AC | 12 ms | 128 KB |
subtask_1_06.txt | AC | 12 ms | 128 KB |
subtask_1_07.txt | AC | 12 ms | 128 KB |
subtask_1_08.txt | AC | 12 ms | 128 KB |
subtask_1_09.txt | AC | 12 ms | 128 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 1 ms | 128 KB |