Submission #1222340
Source Code Expand
#include <stdio.h> int main(int argc, const char * argv[]) { // insert code here... int N; scanf("%d", &N); int state = 0; int arrCount = 1; int lastNum; scanf("%d", &lastNum); int newNum; for(int i = 1; i < N; i++) { scanf("%d", &newNum); // if (newNum == lastNum) continue; if (newNum > lastNum) { if (state >= 0) { state = 1; } else { state = 0; arrCount++; } } else if (newNum < lastNum) { if (state <= 0) { state = -1; } else { state = 0; arrCount++; } } lastNum = newNum; } printf("%d\n", arrCount); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | DingChao |
Language | C (Clang 3.8.0) |
Score | 300 |
Code Size | 881 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 128 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 | 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 | 8 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 | 13 ms | 128 KB |
subtask_1_05.txt | AC | 13 ms | 128 KB |
subtask_1_06.txt | AC | 13 ms | 128 KB |
subtask_1_07.txt | AC | 13 ms | 128 KB |
subtask_1_08.txt | AC | 13 ms | 128 KB |
subtask_1_09.txt | AC | 13 ms | 128 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 1 ms | 128 KB |