Problem: 2050B - Transfusion
Language: java

Solution 1 (runtime: 718 ms):
#include <iostream>

#include <vector>

#include <algorithm>

#include <cmath>

#include <set>

#include <map>



using namespace std;

using ll = long long;

using vi = vector<int>;

using vvi = vector<vector<int>>;



void solve()

{



    ll n;

    cin >> n;

    vector<ll> a(n);



    ll summ = 0;

    for (ll i = 0; i < n; i++)

    {

        cin >> a[i];

        summ += a[i];

    }



    if (summ % n != 0)

    {

        cout << "NO\n";

        return;

    }



    ll v = summ / n;

    for (ll i = 1; i < n - 1; i++)

    {

        if (a[i - 1] < v)

        {

            ll op = v - a[i - 1];

            if (a[i + 1] < op)

            {

                cout << "NO\n";

                return;

            }

            else

            {

                a[i - 1] = v;

                a[i + 1] -= op;

            }

        }

        else

        {

            ll op = a[i - 1] - v;

            a[i + 1] += op;

            a[i - 1] = v;

        }

    }



    // for(auto num : a) cout << num << " ";

    // cout << "\n";



    if (a[n - 1] == v && a[n - 2] == v)

        cout << "YES\n";

    else

        cout << "NO\n";

}

int main()

{

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

    cout.tie(nullptr);



    int t = 1;

    cin >> t;

    while (t--)

        solve();

}

Solution 2 (runtime: 202 ms):
import java.io.*;

import java.util.*;



public class Code {



    // Input and Output

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

    static PrintWriter out = new PrintWriter(System.out);



    // For parsing integers, longs, and strings efficiently

    static StringTokenizer st;



    // Entry point

    public static void main(String[] args) throws IOException {

        int t; // Number of test cases

        t = nextInt(); // Uncomment this line if multiple test cases

        while (t-- > 0) {

            solve(); // Call the solve function for each test case

        }

        out.close(); // Close the output stream

    }







    // Solve function for each test case



    static void solve() throws IOException {

        int n = nextInt();



        int[] arr= new int[n];

        long evensum = 0,oddsum=0;



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

            arr[i] = nextInt();



            if(i%2==0){

                evensum+=arr[i];

            }

            else{

                oddsum+= arr[i];

            }

        }

        int evencount = n%2==0?n/2:n/2+1;

        boolean flag = true;



        if((evensum+oddsum)%n == 0){

            if( !(evensum%evencount == 0 && evensum/evencount == (evensum+oddsum)/n &&  oddsum%(n-evencount) == 0 && oddsum/(n-evencount) == (evensum+oddsum)/n) ){

                flag =false;

            }

        }

        else{

            flag = false;

        }



        out.println(flag?"YES":"NO");



    }



    // Utility methods for faster input

    static String next() throws IOException {

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

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

        }

        return st.nextToken();

    }



    static int nextInt() throws IOException {

        return Integer.parseInt(next());

    }



    static long nextLong() throws IOException {

        return Long.parseLong(next());

    }



    static double nextDouble() throws IOException {

        return Double.parseDouble(next());

    }



    char nextChar() {

        try {

            return (char) br.read();

        } catch (IOException e) {

            e.printStackTrace();

            return '\0'; // Return null character in case of an error

        }

    }



    static String nextLine() throws IOException {

        return br.readLine();

    }



    // Utility functions

    static int gcd(int a, int b) {

        if (b == 0) return a;

        return gcd(b, a % b);

    }



    static int lcm(int a, int b) {

        return a * (b / gcd(a, b));

    }



    static boolean isPrime(int n) {

        if (n <= 1) return false;

        if (n <= 3) return true;

        if (n % 2 == 0 || n % 3 == 0) return false;

        for (int i = 5; i * i <= n; i += 6) {

            if (n % i == 0 || n % (i + 2) == 0) return false;

        }

        return true;

    }



    static long power(long x, long y, long p) {

        long res = 1;

        x = x % p;

        while (y > 0) {

            if ((y & 1) == 1)

                res = (res * x) % p;

            y = y >> 1;

            x = (x * x) % p;

        }

        return res;

    }



    public static void sort(int[] arr)

    {

        //because Arrays.sort() uses quicksort which is dumb

        //Collections.sort() uses merge sort

        ArrayList<Integer> ls = new ArrayList<Integer>();

        for(int x: arr)

            ls.add(x);

        Collections.sort(ls);

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

            arr[i] = ls.get(i);

    }



    public static void sort(long[] arr)

    {

        //because Arrays.sort() uses quicksort which is dumb

        //Collections.sort() uses merge sort

        ArrayList<Long> ls = new ArrayList<Long>();

        for(long x: arr)

            ls.add(x);

        Collections.sort(ls);

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

            arr[i] = ls.get(i);

    }

}