Problem: 2050B - Transfusion
Language: java

Solution 1 (runtime: 296 ms):
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.Collections.*;
import java.util.logging.Logger;
import java.util.stream.Collectors;
import java.util.stream.Stream;

import static java.lang.Math.*;


// can use min max abs directly

// my code
// methods
/*

    min
    max
    abs
    findEle => check if the element is present in the array or not
    findInd => finds index from the array.

 */

// class name should be changed as required
public class Main {
    private static final int MOD = (int)(1e9 + 7);
    private static final int INF = (int)(1e9);
    private static int[] seive;
    //    private static List<HashSet<Integer>> setSeive;
    // if testcases are set to 1 then only one test will be dont else testcases will be taken as input
    private static int TOTAL_TESTCASES = -1;

    static void solve(Reader r,PrintWriter out,int testcase) throws IOException {
       int n = r.nextInt();
       int[] arr = r.readArr(n);

       long sumo = 0;
       long sume = 0;
       int poso = 0;
       int pose = 0;

       for(int i = 0;i<n;i+=2){
           pose++;
           sume += arr[i];
       }

        for(int i = 1;i<n;i+=2){
            poso++;
            sumo += arr[i];
        }

        if(sume % pose != 0 || sumo % poso != 0 || (sume/pose) != (sumo / poso)){
            out.println("NO");
        }else out.println("YES");
    }




    public static void main(String[] args) throws IOException {
        Reader r = new Reader();
        PrintWriter out = new PrintWriter(System.out);
        if(TOTAL_TESTCASES != 1){
            TOTAL_TESTCASES = r.nextInt();
        }

        int t = 0;
        while(t++ < TOTAL_TESTCASES){
            solve(r,out,t);
        }
        out.flush();
    }

    public static int maxSubArraySum(int[] arr){
        int n = arr.length;
        if(n < 1){
            return 0;
        }
        int ans = arr[0];
        int j = 1;
        int curr = arr[0];
        int mini = min(0,arr[0]);

        while(j < n) {
            curr += arr[j];
            ans = max(ans,curr-mini);
            mini = min(mini,curr);
            j++;
        }
        return ans;
    }

    public static long[] sortDesc(long[] array) {
        Long[] boxedArray = Arrays.stream(array).boxed().toArray(Long[]::new);
        Arrays.sort(boxedArray, (a, b) -> Long.compare(b, a));
        return Arrays.stream(boxedArray).mapToLong(Long::longValue).toArray();
    }
    public static int[] sortDesc(int[] array) {
        Integer[] boxedArray = Arrays.stream(array).boxed().toArray(Integer[]::new);
        Arrays.sort(boxedArray, (a, b) -> b - a);
        return Arrays.stream(boxedArray).mapToInt(Integer::intValue).toArray();
    }

    // sorts treemap by values
    public static <K, V extends Comparable<? super V>> LinkedHashMap<K, V> sortByValues(Map<K, V> map) {
        List<Map.Entry<K, V>> entryList = new ArrayList<>(map.entrySet());
        entryList.sort(Map.Entry.comparingByValue());
        LinkedHashMap<K, V> sortedMap = new LinkedHashMap<>();
        for (Map.Entry<K, V> entry : entryList) {
            sortedMap.put(entry.getKey(), entry.getValue());
        }
        return sortedMap;
    }

    static int binarySearch(int[] arr,int ele){
        int n = arr.length;
        int l = 0;
        int r = n-1;

        int ans = -1;

        while(l <= r){
            int mid = l + (r-l)/2;

            // here in if we have the monotonic function this should be designed such that we get the first one as ans in a monotonic array represetation
            if(arr[mid] == ele){
                ans = mid;
                r = mid-1;
            }else{
                l = mid+1;
            }
        }
        return ans;
    }


    // gives first value >= x
    static int lowerBound(int[] arr,int ele){
        int n = arr.length;
        int l = 0;
        int r = n-1;

        int ans = -1;

        while(l <= r){
            int mid = l + (r-l)/2;

            if(arr[mid] >= ele){
                ans = mid;
                r = mid-1;
            }else{
                l = mid+1;
            }
        }
        return ans;
    }

    // gives first element > x
    static int uppperBound(int[] arr,int ele){
        int n = arr.length;
        int l = 0;
        int r = n-1;

        int ans = -1;

        while(l <= r){
            int mid = l + (r-l)/2;

            if(arr[mid] > ele){
                ans = mid;
                r = mid-1;
            }else{
                l = mid+1;
            }
        }
        return ans;
    }

    static int toInt(char c){
        return Integer.parseInt(Character.toString(c));
    }

    // join list of items
    static <T> String joinList(List<T> list, String delimiter) {
        if (list == null || list.isEmpty()) {
            return "";
        }

        return list.stream()
                .map(String::valueOf)
                .collect(Collectors.joining(delimiter));
    }

    // is the number prime
    static boolean isPrime(int n){
        if(n == 1) return false;
        if(n == 2 || n == 3) return true;
        if((n % 2) == 0 || (n % 3) == 0) return false;

        for(int i = 5;i*i<=n;i=i+6){
            if((n%i) == 0 || (n%(i+2)) == 0) return false;
        }
        return true;
    }

    // gcd of the number
    static long gcd(long a, long b){
        if(a==0) return b;
        else return gcd(b%a,a);
    }

    //extended gcd (gets a solution for ax + by = c )

    public static int exGcd(int a, int b, int[] result) {
        if (b == 0) {
            result[0] = 1; // x
            result[1] = 0; // y
            return a; // gcd(a, 0) = a
        }

        int[] tempResult = new int[2];
        int gcd = exGcd(b, a % b, tempResult);
        // Update x and y using results of recursion
        result[0] = tempResult[1];
        result[1] = tempResult[0] - (a / b) * tempResult[1];

        return gcd;
    }
    static long facc(int n){
        if(n <= 2){
            return 2;
        }
        int[] arr = new int[n+1];
        arr[1] = 1;
        arr[2] = 2;
        for(int i = 3;i<=n;i++){
            arr[i] = arr[i-1]*i;
        }

        return arr[n];
    }


    // Fast  power using binary exponiantian
    static int power(int a,int b){
        if(b == 0){
            return 1;
        }
        int half_pow = power(a , b/2);
        if(a % 2 == 0){
            return half_pow * half_pow;
        }else return half_pow * half_pow + a;
    }

    // calculates the lcm of the given number
    static long lcm(long a, long b){
        return (a*b)/gcd(a,b);
    }

    //TC - n logx
    static void calcSeive(int n){
        seive = new int[n+1];
        for(int i = 2;i<=n;i++){
            if(seive[i] != 0) continue; // skipping non prime numbers
            for(int j = 2*i;j<=n;j+=i){
                seive[j]++;
            }
        }
    }

    // till permutations are possible it permutes the passed list else return false;
    private static boolean nextPermutation(List<Integer> perm) {
        int n = perm.size();
        int i = n - 2;
        while (i >= 0 && perm.get(i) >= perm.get(i + 1)) {
            i--;
        }
        if (i < 0)
            return false;

        int j = n - 1;
        while (perm.get(j) <= perm.get(i)) {
            j--;
        }
        Collections.swap(perm, i, j);
        Collections.reverse(perm.subList(i + 1, n));
        return true;
    }

    public static List<Long> getFactors(long number) {
        if (number <= 0) {
            return Collections.emptyList();
        }

        List<Long> factors = new ArrayList<>();

        for(long i = 2; (long) i *i <= number; i++){
            while(number % i == 0){
                factors.add(i);
                number /= i;
            }
        }
        if(number != 1){
            factors.add(number);
        }
        return factors;
    }

    static void debug(int[] a,String... identifier){
        PrintWriter out = new PrintWriter(System.out);
        out.println( ("debug : ") + Arrays.toString(a));
        out.flush();
    }

    // is the number palindrome
    public static boolean isPal(String str1){
        int i = 0;
        int j = str1.length()-1;

        while(i<=j){
            if(str1.charAt(i) != str1.charAt(j)){
                return false;
            }
            i++;
            j--;
        }

        return true;
    }

    static String sort(String str){
        char[] arr = str.toCharArray();
        Arrays.sort(arr);
        return new String(arr);
    }

    static void print(List<Integer> ls ) throws IOException{
        PrintWriter out = new PrintWriter(System.out);
        for(int i : ls){
            out.print(i + " ");
        }
        out.println();
        out.flush();

    }

    static <T> void print(T[] arr ) throws IOException{
        PrintWriter out = new PrintWriter(System.out);

        for(T i : arr){
            out.print(i + " ");
        }
        out.println();
        out.flush();
    }

    static String revStr(String str){
        StringBuilder sb = new StringBuilder("");

        for(int i = str.length()-1;i>=0;i--){
            sb.append(str.charAt(i));
        }

        return sb.toString();
    }

    static class Reader {
        BufferedReader in; StringTokenizer st;
        public Reader() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
            st = new StringTokenizer("");
        }
        public boolean hasNextLine() throws IOException {
            return in.ready();
        }
        public String nextLine() throws IOException {
            st = new StringTokenizer("");
            return in.readLine();
        }
        public String next() throws IOException {
            while (!st.hasMoreTokens())
                st = new StringTokenizer(in.readLine());
            return st.nextToken();
        }
        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public int[] readArr(int n) throws IOException{
            int[] arr = new int[n];
            int i  = 0;
            while(i<n){
                arr[i++] = nextInt();
            }
            return arr;
        }
        public long[] readLongArr(int n) throws IOException{
            long[] arr = new long[n];
            int i  = 0;
            while(i<n){
                arr[i++] = nextLong();
            }
            return arr;
        }
    }
    public static void sort(int[] arr) {
        List<Integer> list = new ArrayList<>();
        for (int i : arr) list.add(i);
        Collections.sort(list);
        for (int i = 0; i < arr.length; i++)
            arr[i] = list.get(i);
    }

    public static class Pair<K,V>{
        public K key;
        public V val;
        public Pair(K _key,V _val){
            this.key = _key;
            this.val = _val;
        }

        @Override
        public String toString() {
            return "{" +
                    key +
                    "," + val +
                    '}';
        }
    }
}


Solution 2 (runtime: 311 ms):
import java.io.BufferedOutputStream;

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.io.PrintWriter;

import java.util.ArrayList;

import java.util.HashMap;

import java.util.HashSet;

import java.util.List;

import java.util.Map;

import java.util.Set;

import java.util.StringTokenizer;





public class Transfusion {

    private boolean debug = false;

    private PrintWriter outWriter;

    

    public static void main(String[] args) {

        new Transfusion().solve();

    }



    public void solve() {

        MyScanner sc = new MyScanner();

        outWriter = new PrintWriter(new BufferedOutputStream(System.out));

        int t = sc.nextInt();

        while (t-- > 0) {

            int n = sc.nextInt();

            int[] arr = new int[n];

            long sumOdd = 0;

            long sumEven = 0;

            for (int i = 0; i < n; i++) {

                arr[i] = sc.nextInt();

                if (i % 2 == 0) {

                    sumOdd += arr[i];

                } else {

                    sumEven += arr[i];

                }

            }

            int evenCount = n / 2;

            int oddCount = n - evenCount;

            if (sumEven % evenCount == 0 && sumOdd % oddCount == 0 && sumEven / evenCount == sumOdd / oddCount) {

                outWriter.println("YES");

            } else {

                outWriter.println("NO");

            }

        }

        outWriter.flush();

    }







    class PairIntegers implements Comparable<PairIntegers> {

        int left;

        int right;



        public PairIntegers(int x, int y) {

            this.left = x;

            this.right = y;

        }



        @Override

        public int compareTo(PairIntegers o) {

            int result = Integer.compare(left, o.left);

            if (result == 0) {

                result = Integer.compare(right, o.right);

            }

            return result;

        }



        @Override

        public boolean equals(Object obj) {

            if (this == obj)

                return true;

            if (obj == null || getClass() != obj.getClass())

                return false;

            PairIntegers other = (PairIntegers) obj;

            return left == other.left && right == other.right;

        }



        @Override

        public int hashCode() {

            return 31 * left + right;

        }



        @Override

        public String toString() {

            return "PairIntegers{" + "left=" + left + ", right=" + right + '}';

        }

    }



    public void debugPrintln(String str) {

        debugPrint(str.trim() + "\n");

    }



    public void debugPrint(String str) {

        if (debug) {

            outWriter.print(str);

        }

    }



    static final HashMap<Integer, Long> savedFactorials = new HashMap<>();



    public long ncr(int n, int r) {

        long mod = 998244353;

        savedFactorials.put(1, 1L);

        // f[n, r] = n! / {(n-r)! * r!}

        long res = 1;

        for (long x = n; x > n - r; x--) {

            res = (res * x) % mod;

        }

        long rFactorial = rFactorial(r);

        // debugPrintln(String.format("calculating (%d)C(%d): numerator: %d,

        // denominator: %d, result: %d", n, r, res, rFactorial, modDivision(res,

        // rFactorial, mod)));

        return modDivision(res, rFactorial, mod);

    }



    long rFactorial(int r) {

        if (savedFactorials.containsKey(r)) {

            return savedFactorials.get(r);

        }

        return r * rFactorial(r - 1);

    }



    long modDivision(long a, long b, long primeMod) {

        return a * modInverse(b, primeMod) % primeMod;

    }



    long modInverse(long b, long primeMod) {

        // b^(m-2) mod primeMod

        // using modular exponentation (divide & conquer)

        long result = 1;

        long base = b % primeMod; // Reduce base modulo m initially

        long e = primeMod - 2;

        while (e > 0) {

            if (e % 2 == 1) // If e is odd

                result = (result * base) % primeMod;

            base = (base * base) % primeMod; // Square the base

            e /= 2; // Divide exponent by 2

        }

        // debugPrintln(String.format("Modular inverse of %d is %d", b, result));

        return result;

    }



    class SieveOfErastothenes {

        List<Integer> primes;

        int limit;

        int[] arr;

        Map<Integer, List<Integer>> factors;



        public SieveOfErastothenes(int limit) {

            this.arr = new int[limit + 1];

            this.limit = limit;

            this.factors = new HashMap<>();

        }



        public Map<Integer, List<Integer>> getFactors() {

            for (int i = 2; i <= limit; i++) {

                for (int j = 1; i * j <= limit; j++) {

                    factors.putIfAbsent(i * j, new ArrayList<>());

                    factors.get(i * j).add(i);

                }

            }

            return factors;

        }



        public List<Integer> getPrimes() {

            List<Integer> result = new ArrayList<>();

            int i;

            for (i = 2; i <= Math.sqrt(limit); i++) {

                if (arr[i] == 0) {

                    result.add(i);

                    for (int j = 1; j * i <= limit; j++) {

                        arr[j * i] = -1; // j * i == xyz

                    }

                }

            }

            while (i <= limit) {

                if (arr[i] == 0)

                    result.add(i);

                i++;

            }

            return result;

        }

    }



    class DisJointSetUnion {

        int[] arr;



        public DisJointSetUnion(int size) {

            size++;

            this.arr = new int[size];

            for (int i = 0; i < size; i++) {

                arr[i] = i;

            }

        }



        public Map<Integer, Set<Integer>> expandSets() {

            Map<Integer, Set<Integer>> result = new HashMap<>();

            for (int i = 1; i < arr.length; i++) {

                int parent = find(i);

                if (!result.containsKey(parent)) {

                    result.put(parent, new HashSet<>());

                }

                result.get(parent).add(i);

                result.put(i, result.get(parent));

            }

            return result;

        }



        public int find(int i) {

            if (arr[i] == i) {

                return i;

            }

            arr[i] = find(arr[i]);

            return arr[i];

        }



        public int union(int i, int j) {

            int iKaBaap = find(i);

            int jKaBaap = find(j);

            if (iKaBaap > jKaBaap) {

                arr[iKaBaap] = jKaBaap;

            } else {

                arr[jKaBaap] = iKaBaap;

            }

            return jKaBaap;

        }

    }



    // -----------PrintWriter for faster output---------------------------------

    public static PrintWriter out;



    // -----------MyScanner class for faster input----------

    public static class MyScanner {

        BufferedReader br;

        StringTokenizer st;



        public MyScanner() {

            br = new BufferedReader(new InputStreamReader(System.in));

        }



        String next() {

            while (st == null || !st.hasMoreElements()) {

                try {

                    st = new StringTokenizer(br.readLine());

                } catch (IOException e) {

                    e.printStackTrace();

                }

            }

            return st.nextToken();

        }



        int nextInt() {

            return Integer.parseInt(next());

        }



        long nextLong() {

            return Long.parseLong(next());

        }



        double nextDouble() {

            return Double.parseDouble(next());

        }



        String nextLine() {

            String str = "";

            try {

                str = br.readLine();

            } catch (IOException e) {

                e.printStackTrace();

            }

            return str;

        }



    }

    // --------------------------------------------------------

}