LightOJ - Shadow Sum

By -

 Problem Link Shadow Sum


/*

    Accepted


    It is a data structure problem. I have used the array and map to track same positive

    , negative, single, and multiple times appeared numbers. Done the summation finally.


*/


#include <bits/stdc++.h>


using namespace std;


#define sf scanf

#define pf printf


typedef long long LL;

const LL high = 2e4 + 10;


int ar[high];


map<int,int>br;

map<int,int>flag;


void clean()

{

    br.clear();

    flag.clear();

}


int main()

{

    int i, N, test, tc=0;


    sf("%d", &test);


    while(test--)

    {

        clean();


        sf("%d", &N);


        for(i=0;i<N;i++)

        {

            sf("%d", &ar[i]);

        }


        //for(i=0;i<N;i++) cout << br[ar[i]] << "; ";


        int x , y;


        for(i=0;i<N;i++)

        {

            x = ar[i];


            if(x < 0)

            {

                y = x * (-1);


                br[y] = x;

            }


            else

            {

                br[x] = x;

            }

        }


        LL sum = 0;


        for(i=0;i<N;i++)

        {

            x = ar[i];


            if(x < 0)

            {

                y = x * (-1);


                if(flag[br[y]] == 0)

                {

                    sum += br[y];


                    flag[br[y]] = 1;


                    //cout << br[y] << "; ";

                }

            }


            else

            {

                if(flag[br[x]] == 0)

                {

                    sum += br[x];


                    flag[br[x]] = 1;


                    //cout << br[x] << "; ";

                }

            }

        }


        //cout << "\nsum = " << sum << "\n";

        pf("Case %d: %lld\n", ++tc, sum);

    }


    return 0;

}


Comments

Post a Comment

Popular posts from this blog

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

Hackerearth Bishu and his Girlfriend

By -
/* Lionel Messi is such a player that you may catch him, you may touch him, you may feel him and definitely you may Love him. Lionel Messi is Messi. A little Magician in this World. */ // Accepted #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define nl puts("") #define psb push_back #define loop0(n) for(int i=0; i<n; i++) #define loop1(n) for(int i=1; i<=n; i++) #define mpair(x , y) make_pair(x , y) #define all(x) x.begin(), x.end() #define pi acos(-1.0) #define psb push_back typedef unsigned long long ull; typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; typedef vector<string>vs; typedef map<int, int>mpii; typedef map<string, int>mpsi; typedef map<char, int>mpci; typedef map<LL, LL>mpll; cons...
Read more

Uva 10650 - Determinate Prime

By -
/*     Verdict : Accepted     Link: Determinate Prime Solution Link */ #include<bits/stdc++.h> #define limit 32009 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<int>vi; int prm[limit], plen=1; bitset<limit> bs; void sieve() {     LL i,j;     bs.set();     bs[1] = bs[0] = 0;     for(i=2; i<limit; i++)     {         if(bs[i])         {             if(i != 2)             {                 prm[plen++] = i;             }          ...
Read more