提出 #2535405
ソースコード 拡げる
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 200010
#define ll long long
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
return x*f;
}
int n,a[N];
int main()
{
n=read();
for(int i=1;i<=n;i++)
a[i]=read();
a[0]=-1;
for(int i=1;i<=n;i++)
if(a[i]-a[i-1]>1) {puts("-1");return 0;}
ll ans=0;
for(int i=2;i<=n;i++)
if(a[i]==a[i-1]+1) ans++;
else ans+=a[i];
printf("%lld",ans);
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - Sequence Growing Easy |
| ユーザ | DOFYPXY |
| 言語 | C++14 (GCC 5.4.1) |
| 得点 | 700 |
| コード長 | 596 Byte |
| 結果 | AC |
| 実行時間 | 31 ms |
| メモリ | 1152 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 700 / 700 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| 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 |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| 01.txt | AC | 16 ms | 1024 KiB |
| 02.txt | AC | 16 ms | 1024 KiB |
| 03.txt | AC | 12 ms | 1024 KiB |
| 04.txt | AC | 12 ms | 1024 KiB |
| 05.txt | AC | 11 ms | 1024 KiB |
| 06.txt | AC | 11 ms | 1024 KiB |
| 07.txt | AC | 11 ms | 1024 KiB |
| 08.txt | AC | 11 ms | 1024 KiB |
| 09.txt | AC | 11 ms | 1024 KiB |
| 10.txt | AC | 12 ms | 1024 KiB |
| 11.txt | AC | 10 ms | 1024 KiB |
| 12.txt | AC | 10 ms | 1024 KiB |
| 13.txt | AC | 10 ms | 1024 KiB |
| 14.txt | AC | 10 ms | 1024 KiB |
| 15.txt | AC | 11 ms | 1024 KiB |
| 16.txt | AC | 11 ms | 1024 KiB |
| 17.txt | AC | 11 ms | 1024 KiB |
| 18.txt | AC | 11 ms | 1024 KiB |
| 19.txt | AC | 11 ms | 1024 KiB |
| 20.txt | AC | 12 ms | 1024 KiB |
| 21.txt | AC | 8 ms | 1024 KiB |
| 22.txt | AC | 7 ms | 1024 KiB |
| 23.txt | AC | 8 ms | 1024 KiB |
| 24.txt | AC | 6 ms | 1024 KiB |
| 25.txt | AC | 10 ms | 1024 KiB |
| 26.txt | AC | 11 ms | 1024 KiB |
| 27.txt | AC | 10 ms | 1024 KiB |
| 28.txt | AC | 10 ms | 1024 KiB |
| 29.txt | AC | 10 ms | 1024 KiB |
| 30.txt | AC | 10 ms | 1024 KiB |
| 31.txt | AC | 31 ms | 1152 KiB |
| 32.txt | AC | 10 ms | 1024 KiB |
| 33.txt | AC | 5 ms | 1024 KiB |
| 34.txt | AC | 8 ms | 1024 KiB |
| 35.txt | AC | 11 ms | 1024 KiB |
| 36.txt | AC | 11 ms | 1024 KiB |
| 37.txt | AC | 11 ms | 1024 KiB |
| 38.txt | AC | 11 ms | 1024 KiB |
| 39.txt | AC | 12 ms | 1024 KiB |
| 40.txt | AC | 12 ms | 1024 KiB |
| 41.txt | AC | 1 ms | 256 KiB |
| 42.txt | AC | 1 ms | 256 KiB |
| 43.txt | AC | 1 ms | 256 KiB |
| 44.txt | AC | 1 ms | 256 KiB |
| 45.txt | AC | 1 ms | 256 KiB |
| 46.txt | AC | 1 ms | 256 KiB |
| s1.txt | AC | 1 ms | 256 KiB |
| s2.txt | AC | 1 ms | 256 KiB |
| s3.txt | AC | 1 ms | 256 KiB |