Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- using namespace std;
- using namespace __gnu_pbds;
- #define ll long long
- #define ull unsigned long long
- #define nl '\n'
- #define sz(x) int(x.size())
- #define all(x) x.begin(),x.end()
- #define rall(s) s.rbegin(), s.rend()
- #define getline(s) getline(cin>>ws,s)
- #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define pi 3.141592653589793
- #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
- #define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
- void Fast_IO(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- // freopen("filename.in", "r", stdin);
- // freopen("filename.txt", "w", stdout);
- #ifndef ONLINE_JUDGE
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- }
- int x[8] = { 2, 1, -1, -2, -2, -1, 1, 2 };
- int y[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
- void solve(){
- ll n; cin>>n;
- vector<ll> v(n),ans1(n),ans2(n);
- for(int i=0;i<n;i++) cin>>v[i];
- ans1[0] = ans2[0] = v[0];
- for(int i=1; i<n; i++){
- ans1[i] = v[i] + ans1[i-1];
- ans2[i] = ans2[i-1] - v[i];
- ans2[i] = ans2[i] <0? ans1[i]:ans2[i];
- }
- if(ans1 != ans2) cout<<"-1";
- else for(auto &i:ans1) cout<<i<<" ";
- cout<<nl;
- }
- int main(){
- Fast_IO();
- int t =1;
- cin>>t;
- while(t--){
- solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement