Submission #2368465


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main(){

  long long n;
  long long a[1000000];
  long long ans1=0,ans2=0,sum=0;

  cin>>n;

  for(int i=0;i<n;i++)cin>>a[i];

  
  //一つ目がプラス
  for(int i=0;i<n;i++){
    sum+=a[i];
    if( (i+1)%2==1 && sum<0 ){
      ans1+=abs(sum)+1;
      sum=1;
    }
    if( (i+1)%2==0 && sum>0 ){
      ans1+=abs(sum)+1;
      sum=-1;
    }
  }

  sum=0;

  //一つ目はマイナス
  for(int i=0;i<n;i++){
    sum+=a[i];
    if( (i+1)%2==0 && sum<=0 ){
      ans2+=abs(sum)+1;
      //cout<<i+1<<" "<<abs(sum)+1<<endl;
      sum=1;
    }
    if( (i+1)%2==1 && sum>=0 ){
      ans2+=abs(sum)+1;
      //cout<<i+1<<" 奇数 "<<abs(sum)+1<<endl;
      sum=-1;
    }
  }


  //cout<<"ans1:"<<ans1<<"  "<<"ans2:"<<ans2<<endl;

  if(ans1>ans2)
    cout<<ans2<<endl;
  else 
    cout<<ans1<<endl;


  return 0;
}

Submission Info

Submission Time
Task C - Sequence
User Oike7
Language C++14 (GCC 5.4.1)
Score 0
Code Size 935 Byte
Status WA
Exec Time 44 ms
Memory 2944 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 17
WA × 1
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 1 ms 256 KB
00-01.txt AC 2 ms 2304 KB
00-02.txt AC 1 ms 256 KB
01-00.txt AC 44 ms 1024 KB
01-01.txt AC 43 ms 1024 KB
01-02.txt AC 42 ms 1024 KB
01-03.txt AC 40 ms 2816 KB
01-04.txt WA 39 ms 896 KB
01-05.txt AC 35 ms 896 KB
01-06.txt AC 42 ms 1024 KB
01-07.txt AC 38 ms 2432 KB
01-08.txt AC 43 ms 1024 KB
01-09.txt AC 38 ms 896 KB
01-10.txt AC 32 ms 768 KB
01-11.txt AC 42 ms 2560 KB
01-12.txt AC 44 ms 2944 KB
01-13.txt AC 39 ms 896 KB
01-14.txt AC 43 ms 1024 KB