Submission #2631844

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;
}

ll solve(int N, vi& a) {
    vector<ll> ac(N+1, 0);
    rep(i,N) ac[i+1] = ac[i] + a[i];
    // cerr << ac << endl;
    ll ans = 0x7fffffffffffffffLL;
    rep(i,N-1) {
        ll x = ac[i+1] - ac[0], y = ac[N] - ac[i+1];
        ll diff = x-y; if (diff < 0) diff = -diff;
        // cerr << i << " " << x << " " << y << " " << diff << endl;
        ans = min(ans, diff);
    }
    return ans;
}

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

Submission Info

Submission Time
Task C - Splitting Pile
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2297 Byte
Status
Exec Time 11 ms
Memory 3840 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 300 / 300 00_example_01.txt, 00_example_02.txt, 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
Case Name Status Exec Time Memory
00_example_01.txt 1 ms 256 KB
00_example_02.txt 1 ms 256 KB
01.txt 6 ms 2048 KB
02.txt 3 ms 896 KB
03.txt 3 ms 768 KB
04.txt 7 ms 2560 KB
05.txt 3 ms 768 KB
06.txt 10 ms 3840 KB
07.txt 11 ms 3840 KB
08.txt 10 ms 3840 KB
09.txt 11 ms 3840 KB
10.txt 10 ms 3840 KB
11.txt 1 ms 256 KB
12.txt 1 ms 256 KB
13.txt 9 ms 3328 KB
14.txt 1 ms 256 KB