Submission #4022739
Source Code Expand
#include <stdio.h> #include <stdlib.h> #include <vector> using namespace std; int main(int argc, char *argv[]) { // read inputs long N; vector<long> as; scanf("%ld", &N); for (int i = 0; i < N; i++) { long a; scanf("%ld", &a); as.push_back(a); } // solve long ans = 0; ans += as[N - 1]; for (long i = N - 2; i >= 0; i--) { if (as[i] < as[i + 1] - 1) { ans = -1; break; } else if (as[i] > as[i + 1] - 1) { // 0 will not be a corner case ans += as[i]; } } if (as[0] > 0) { ans = -1; } printf("%ld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Sequence Growing Easy |
User | khir |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 633 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 2420 KB |
Compile Error
./Main.cpp: In function ‘int main(int, char**)’: ./Main.cpp:11:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%ld", &N); ^ ./Main.cpp:14:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%ld", &a); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 25 ms | 2420 KB |
02.txt | AC | 26 ms | 2420 KB |
03.txt | AC | 23 ms | 2420 KB |
04.txt | AC | 23 ms | 2420 KB |
05.txt | AC | 22 ms | 2420 KB |
06.txt | AC | 22 ms | 2420 KB |
07.txt | AC | 23 ms | 2420 KB |
08.txt | AC | 21 ms | 2420 KB |
09.txt | AC | 23 ms | 2420 KB |
10.txt | AC | 23 ms | 2420 KB |
11.txt | AC | 23 ms | 2420 KB |
12.txt | AC | 23 ms | 2420 KB |
13.txt | AC | 23 ms | 2420 KB |
14.txt | AC | 23 ms | 2420 KB |
15.txt | AC | 23 ms | 2420 KB |
16.txt | AC | 23 ms | 2420 KB |
17.txt | AC | 23 ms | 2420 KB |
18.txt | AC | 23 ms | 2420 KB |
19.txt | AC | 23 ms | 2420 KB |
20.txt | AC | 23 ms | 2420 KB |
21.txt | AC | 21 ms | 2420 KB |
22.txt | AC | 21 ms | 2420 KB |
23.txt | AC | 21 ms | 2420 KB |
24.txt | AC | 20 ms | 2420 KB |
25.txt | AC | 21 ms | 2420 KB |
26.txt | AC | 23 ms | 2420 KB |
27.txt | AC | 23 ms | 2420 KB |
28.txt | AC | 23 ms | 2420 KB |
29.txt | AC | 23 ms | 2420 KB |
30.txt | AC | 22 ms | 2420 KB |
31.txt | AC | 23 ms | 2420 KB |
32.txt | AC | 23 ms | 2420 KB |
33.txt | AC | 19 ms | 2420 KB |
34.txt | AC | 21 ms | 2420 KB |
35.txt | AC | 23 ms | 2420 KB |
36.txt | AC | 23 ms | 2420 KB |
37.txt | AC | 23 ms | 2420 KB |
38.txt | AC | 23 ms | 2420 KB |
39.txt | AC | 23 ms | 2420 KB |
40.txt | AC | 23 ms | 2420 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |