Candies

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <unordered_set>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <fstream>
#include <set>
#include <map>

#define MOD 1000000007
#define ll long long
#define N (1<<17)
#define float double

using namespace std;

ll m1[100000];

int main(){
    int n;
    cin>>n;
    n/=2;

    for(int i=0; i<n; i++)
        cin>>m1[i];
    for(int i=0; i<n; i++){
        ll a;
        cin>>a;
        m1[i]-=a;
    }

    ll s=0;
    for(int i=0; i<n; i++)
        s+=m1[i];
    if(s%2!=0){
        cout<<"QAQ"<<endl;
        return 0;
    }
    s/=2;
    ll vast=0;

    m1[0]-=s;
    m1[n-1]-=s;

    vast+=abs(s);

    for(int i=0; i<n-1; i++){
        vast+=abs(m1[i]);
        m1[i+1]+=m1[i];
    }

    cout<<vast<<endl;
    return 0;
}

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