UVa 11039 - Building designing Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 500010

struct Z{
        int hi;
        int col;
        bool operator < (const Z &p) const{
        return hi<p.hi;
        }
};

int main()
{
    int a,b,c,tc,w,x,y,n,m,u,v,cnt,mx,mn,p,q,r,sum;
    //int flr[MX];
    //bool clr[MX];
    Z z;
    string s,s2;
    cin>>tc;
    while(tc--)
    {
        cin>>n;
        vector<Z>v;//CLR(clr);
        for(int i=0;i<n;i++)
        {
            cin>>x;
            if(x>0) {z.hi=x; z.col=1;}
            else    {z.hi=x*-1; z.col=0;}
            v.push_back(z);
        }
        sort(ALL(v));
        cnt=1;
        int bit=v[0].col;
        //cout<<bit<<endl;
        for(int i=1;i<n;i++)
        {
            if(v[i].col!=bit)
            {
                cnt++;
                bit=v[i].col;
            }
        }
        cout<<cnt<<endl;
    }
    return 0;
}