Submission #2536484


Source Code Expand

Copy
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 200005
using namespace std;
typedef long long ll;
typedef double db;
int n,a[N];
ll ans;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	if(a[1]!=0){printf("-1\n");return 0;}
	for(int i=2;i<=n;++i)
	{
		if(a[i]<=a[i-1]) ans+=a[i];
		else if(a[i]==a[i-1]+1) ans++;
		else {printf("-1\n");return 0;}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - Sequence Growing Easy
User jyc
Language C++14 (GCC 5.4.1)
Score 700
Code Size 465 Byte
Status
Exec Time 24 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:14:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;++i) scanf("%d",&a[i]);
                                         ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 700 / 700 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 24 ms 1024 KB
02.txt 24 ms 1024 KB
03.txt 22 ms 1024 KB
04.txt 22 ms 1024 KB
05.txt 21 ms 1024 KB
06.txt 21 ms 1024 KB
07.txt 21 ms 1024 KB
08.txt 21 ms 1024 KB
09.txt 21 ms 1024 KB
10.txt 21 ms 1024 KB
11.txt 20 ms 1024 KB
12.txt 20 ms 1024 KB
13.txt 20 ms 1024 KB
14.txt 20 ms 1024 KB
15.txt 21 ms 1024 KB
16.txt 21 ms 1024 KB
17.txt 21 ms 1024 KB
18.txt 21 ms 1024 KB
19.txt 21 ms 1024 KB
20.txt 21 ms 1024 KB
21.txt 19 ms 1024 KB
22.txt 18 ms 1024 KB
23.txt 19 ms 1024 KB
24.txt 17 ms 1024 KB
25.txt 20 ms 1024 KB
26.txt 20 ms 1024 KB
27.txt 20 ms 1024 KB
28.txt 20 ms 1024 KB
29.txt 20 ms 1024 KB
30.txt 20 ms 1024 KB
31.txt 20 ms 1024 KB
32.txt 20 ms 1024 KB
33.txt 16 ms 1024 KB
34.txt 18 ms 1024 KB
35.txt 21 ms 1024 KB
36.txt 21 ms 1024 KB
37.txt 20 ms 1024 KB
38.txt 20 ms 1024 KB
39.txt 21 ms 1024 KB
40.txt 21 ms 1024 KB
41.txt 1 ms 256 KB
42.txt 1 ms 256 KB
43.txt 1 ms 256 KB
44.txt 1 ms 256 KB
45.txt 1 ms 256 KB
46.txt 1 ms 256 KB
s1.txt 1 ms 256 KB
s2.txt 1 ms 256 KB
s3.txt 1 ms 256 KB