-
Notifications
You must be signed in to change notification settings - Fork 0
/
Likes.cpp
93 lines (85 loc) · 1.75 KB
/
Likes.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll ac[300009];
string stx="";
vector<ll>anxs;
bool compa(pair<ll,ll>p1,pair<ll,ll>p2)
{
if(p1.first==p2.first)
{
return p1.second<p2.second;
}
return p1.second<p2.second;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,i,j,k,l=1,s=0,zr=0,t;
cin>>t;
while(t--){
cin>>n;
//vector<ll>ac(n);
s=0;
for(i=0;i<n;i++){
cin>>ac[i];
if(ac[i]>0)
s++;
}
ll nos=n-s;
ll ct=0,tz=s,tb=nos;
for ( i = 0; i < n; i++)
{
if (s)
{
ct++;
s--;
}
else
{
ct--;
nos--;
}
cout << ct << " ";
}
cout <<'\n';
ll par=0;
ct=0;
for ( i = 0; i < n; i++)
{
if (par<=0)
{
if (tz)
{
ct++;
cout << ct << " ";
tz--;
}
else
{
ct--;
cout << ct << " ";
tb--;
}
}
else
{
if (tb)
{
ct--;
cout << ct << " ";
tb--;
}
else
{
ct++;
cout << ct << " ";
tz--;
}
}
par =1-par;
}
cout <<'\n';
}
}