Candies

input/code.cpp: In function 'int main()':
input/code.cpp:23:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
input/code.cpp:29:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld",&inp[i]);
                              ^

#include <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>

#define all(x) (x).begin(),x.end()

#define pb push_back
#define mp make_pair
#define x1 first
#define x2 second.first
#define x3 second.second
#define trip(a,b,c) mp(a,mp(b,c))

using namespace std;
const int inf = 1000000007;

int main()
{
    int n;
    scanf("%d",&n);
    vector<long long> inp(n);

    long long sum = 0;
    for(int i=0;i<n;i++)
    {
        scanf("%lld",&inp[i]);
        sum += inp[i];
    }
    if(sum%2)
    {
        puts("QAQ");
        return 0;
    }
    for(int i=0;2*i<n;i++)
    {
        long long diff = inp[i]-inp[i+n/2];
        inp[i]=diff;
        inp[i+n/2]=-diff;
    }
    vector<long long> partial(n);
    for(int i=1;i<n;i++)
        partial[i]=partial[i-1]+inp[i-1];
    sort(all(partial));
    long long ans = 0;
    for(int i=0;i<n;i++)
        ans += abs(partial[i]-partial[n/2]);
    printf("%lld\n",ans/2);
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED