Submission #2536814
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define NDEBUG #ifdef DEBUG #include "cout11.h" #undef NDEBUG #endif #include <cassert> typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> ii; typedef pair<ll,ll> llll; typedef pair<double,double> dd; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<ii> vii; typedef vector<vector<ii>> vvii; typedef vector<ll> vll; #define sz(a) int((a).size()) #define pb push_back #define FOR(var,from,to) for(int var=(from);var<=(to);++var) #define rep(var,n) for(int var=0;var<(n);++var) #define rep1(var,n) for(int var=1;var<=(n);++var) #define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj) #define ALL(c) (c).begin(),(c).end() #define RALL(c) (c).rbegin(),(c).rend() #define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i) #define found(s,e) ((s).find(e)!=(s).end()) #define mset(arr,val) memset(arr,val,sizeof(arr)) #define mid(x,y) ((x)+((y)-(x))/2) #define IN(x,a,b) ((a)<=(x)&&(x)<=(b)) ll solve(int N,vi& a) { // cerr << a << endl; if (a[0] != 0) return -1; ll ans = 0; // a[0] = 0 for (int i=0,last=0; i<N; ++i) { // fprintf(stderr, "i=%d, last=%d; a[%d]=%d, ans=%lld\n", i,last, i,a[i], ans); if (a[i] == 0) { // last = a[i]; // continue; } else if (a[i] == last+1) { // ++last; // last = a[i]; ++ans; // this } else if (a[i] > last+1) { return -1; } else if (a[i] <= last) { // 1...(this-1) // last = a[i]; ans += a[i]; } last = a[i]; } return ans; } int main() { int N; cin >> N; vi a(N); rep(i,N) cin >> a[i]; cout << solve(N,a) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Sequence Growing Easy |
User | naoya_t |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1914 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 1024 KB |
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 | 79 ms | 1024 KB |
02.txt | AC | 79 ms | 1024 KB |
03.txt | AC | 60 ms | 1024 KB |
04.txt | AC | 59 ms | 1024 KB |
05.txt | AC | 56 ms | 1024 KB |
06.txt | AC | 57 ms | 1024 KB |
07.txt | AC | 57 ms | 1024 KB |
08.txt | AC | 57 ms | 1024 KB |
09.txt | AC | 57 ms | 1024 KB |
10.txt | AC | 57 ms | 1024 KB |
11.txt | AC | 57 ms | 1024 KB |
12.txt | AC | 59 ms | 1024 KB |
13.txt | AC | 56 ms | 1024 KB |
14.txt | AC | 56 ms | 1024 KB |
15.txt | AC | 58 ms | 1024 KB |
16.txt | AC | 58 ms | 1024 KB |
17.txt | AC | 59 ms | 1024 KB |
18.txt | AC | 58 ms | 1024 KB |
19.txt | AC | 60 ms | 1024 KB |
20.txt | AC | 60 ms | 1024 KB |
21.txt | AC | 47 ms | 1024 KB |
22.txt | AC | 42 ms | 1024 KB |
23.txt | AC | 46 ms | 1024 KB |
24.txt | AC | 38 ms | 1024 KB |
25.txt | AC | 55 ms | 1024 KB |
26.txt | AC | 56 ms | 1024 KB |
27.txt | AC | 56 ms | 1024 KB |
28.txt | AC | 56 ms | 1024 KB |
29.txt | AC | 56 ms | 1024 KB |
30.txt | AC | 54 ms | 1024 KB |
31.txt | AC | 56 ms | 1024 KB |
32.txt | AC | 57 ms | 1024 KB |
33.txt | AC | 34 ms | 1024 KB |
34.txt | AC | 45 ms | 1024 KB |
35.txt | AC | 57 ms | 1024 KB |
36.txt | AC | 61 ms | 1024 KB |
37.txt | AC | 57 ms | 1024 KB |
38.txt | AC | 57 ms | 1024 KB |
39.txt | AC | 60 ms | 1024 KB |
40.txt | AC | 60 ms | 1024 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 |