Submission #1985820
Source Code Expand
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}
const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, a[100000];
ll s, _s, co;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
FOR(i, 0, n){
cin >> a[i];
}
ll ans = linf;
FOR(j, 0, 2){
s = 0;
co = 0;
FOR(i, 0, n){
_s = s + a[i];
if((i+j)%2){
if(_s >= 0){
co += _s + 1;
s = -1;
}else{
s = _s;
}
}else{
if(_s <= 0){
co += 1 - _s;
s = 1;
}else{
s = _s;
}
}
}
mins(ans, co);
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Sequence |
User |
char134217728 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1914 Byte |
Status |
AC |
Exec Time |
13 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00-00.txt, 00-01.txt, 00-02.txt |
All |
00-00.txt, 00-01.txt, 00-02.txt, 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt |
Case Name |
Status |
Exec Time |
Memory |
00-00.txt |
AC |
2 ms |
256 KB |
00-01.txt |
AC |
1 ms |
256 KB |
00-02.txt |
AC |
1 ms |
256 KB |
01-00.txt |
AC |
13 ms |
640 KB |
01-01.txt |
AC |
13 ms |
640 KB |
01-02.txt |
AC |
12 ms |
640 KB |
01-03.txt |
AC |
12 ms |
640 KB |
01-04.txt |
AC |
11 ms |
640 KB |
01-05.txt |
AC |
10 ms |
640 KB |
01-06.txt |
AC |
12 ms |
640 KB |
01-07.txt |
AC |
11 ms |
640 KB |
01-08.txt |
AC |
13 ms |
640 KB |
01-09.txt |
AC |
12 ms |
640 KB |
01-10.txt |
AC |
10 ms |
512 KB |
01-11.txt |
AC |
13 ms |
640 KB |
01-12.txt |
AC |
13 ms |
640 KB |
01-13.txt |
AC |
11 ms |
640 KB |
01-14.txt |
AC |
13 ms |
640 KB |