Codeforces Round #797 (Div. 3)(C. Restoring the Duration of Tasks)

 

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n,tst;

    cin>>tst;

    while(tst--)

    {

        cin>>n;

        ll arr_a[n+2],arr_b[n+2],ans[n+2];

        for(ll i=0;i<n;i++) cin>>arr_a[i];

        for(ll i=0;i<n;i++) cin>>arr_b[i];

        ans[0]=arr_b[0]-arr_a[0];

        ll last=arr_b[0];

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

        {

            if(arr_a[i]>last) ans[i]=arr_b[i]-arr_a[i];

            else ans[i]=arr_b[i]-last;

            last=arr_b[i];

        }

        for(ll i=0;i<n;i++) cout<<ans[i]<<" ";

            cout<<endl;

    }

    return 0;

}

///Alhamdulillah

Problem Link: https://codeforces.com/contest/1690/problem/C