Submission #2636155

Source Code Expand

Copy
#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))

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

template <typename T>
vector<T> accum(vector<T>& v){
    vector<T> res(v.size()+1);
    res[0] = 0;
    partial_sum(ALL(v), res.begin()+1);
#ifdef DEBUG
    cerr << v << " -> accum -> " << res << endl;
#endif
    return res;
}



ll move(int n, vi& a, int target) {
    int ac = 0;
    ll mv = 0;
    rep(i, n){
        ac += a[i];
        // targetとsignが同じなら何もしない
        // そうでなければtargetに持っていく
        if (target * ac <= 0) {
            mv += llabs(target - ac);
            ac = target;
        }
        target = -target;
    }
    return mv;
}

ll solve(int n, vi& a) {
    // vi ac = accum(a);
    return min(move(n,a,1), move(n,a,-1));
}

int main() {
    vi a;
    int N = loadvec(a);
    cout << solve(N,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Sequence
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2620 Byte
Status
Exec Time 7 ms
Memory 1664 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00-00.txt, 00-01.txt, 00-02.txt
All 300 / 300 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 1 ms 256 KB
00-01.txt 1 ms 256 KB
00-02.txt 1 ms 256 KB
01-00.txt 7 ms 1664 KB
01-01.txt 7 ms 1664 KB
01-02.txt 7 ms 1664 KB
01-03.txt 6 ms 1536 KB
01-04.txt 6 ms 1536 KB
01-05.txt 6 ms 1408 KB
01-06.txt 7 ms 1664 KB
01-07.txt 6 ms 1408 KB
01-08.txt 7 ms 1664 KB
01-09.txt 6 ms 1536 KB
01-10.txt 5 ms 1280 KB
01-11.txt 7 ms 1664 KB
01-12.txt 7 ms 1664 KB
01-13.txt 6 ms 1536 KB
01-14.txt 7 ms 1664 KB