Competitive/Collaborative Programming Class

/* Class:   CSC 2700 Programming Competitions
 * Prof:    Isaac Traxler
 * Name:    Matthew Gavin
 * Problem: 638 - Rectangles
 *
 * Note: Only 3 loops are required... I don't know why I was trying to recursively backtrack ;)
 *       This is a very simple problem!
 */ 

#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <algorithm>

using namespace std;

//#define DEBUG  //comment this line to pull out print statements
#ifdef DEBUG
#define TAB '\t'
#define debug(a, end) cout << #a << ": " << a << end
#define dbg(end) end
#else
#define debug(a, end)
#define dbg(end)
#endif

typedef vector<int> vi; //?

#define UN(v) SORT(v),v.erase(unique(v.begin(),v.end()),v.end())   
#define SORT(c) sort((c).begin(),(c).end())   
#define FOR(i,a,b) for (int  i=(a); i < (b); i++)    
#define REP(i,n) FOR(i,0,n)    
#define CL(a,b) memset(a,b,sizeof(a))
#define CL2d(a,b,x,y) memset(a, b, sizeof(a[0][0])*x*y)

/*global variables*/

struct point {
    char ltr;
    int x;
    int y;
};

int num_pt;
vector<point> pts;
vector<string> rects;
/*global variables*/

void dump()
{
    //dump data
}

bool getInput()
{
    //get input
    scanf("%d ", &num_pt);
    if (num_pt == 0) return false;
    //debug(num_pt, endl);
    point p;
    REP(i, num_pt)
    {
        scanf("%c %d %d ", &p.ltr, &p.x, &p.y);
        //debug(p.ltr, TAB); debug(p.x, TAB); debug(p.y, endl);
        pts.push_back(p);
    }
    
    return true;
}

void process()
{
    //process input
    string r;
    REP(i, pts.size())
    {
        r += pts[i].ltr;
        FOR(j, 0, pts.size())
        {
            //if (j == i) continue;
            //right
            if (pts[j].x > pts[i].x && pts[j].y == pts[i].y)
            {
                //found right
                r += pts[j].ltr;
                debug(r, endl);
                FOR(k, 0, pts.size())
                {
                    //if (k == i || k == j) continue;
                    //go down
                    if (pts[k].y < pts[j].y && pts[k].x == pts[j].x)
                    {
                        //found down
                        r += pts[k].ltr;
                        debug(r, endl);
                        FOR(l, 0, pts.size())
                        {
                            //if (l == i || l == j || l == k) continue;
                            //go left
                            if ((pts[l].x < pts[k].x && pts[l].y == pts[k].y) &&
                                (pts[l].x == pts[i].x && pts[i].y > pts[l].y))
                            {
                                debug(r, endl);
                                //found left and compared with the starting point
                                r += pts[l].ltr;
                                rects.push_back(r);
                                r.erase(3, 1); //take out the ltr for the next iter
                            }
                        }
                        r.erase(2, 1); //take out the ltr for the next iter
                    }
                }
                r.erase(1, 1); //take out the ltr for the next iter
            }
        }
        r.clear(); //clear the str for the next iter
    }

    
    
    SORT(rects);
    if (rects.size() == 0)
        printf(" No rectangles");
    else
    {
        printf("\n");
        REP(i, (int)rects.size())
        {
            if (i % 10 == 0 && i != 0)
                printf("\n");
            cout << " " << rects[i];
        }
    }
    printf("\n");
}

int main()
{
    int nc = 0;
    while (getInput())
    {
        printf("Point set %d:", ++nc);
        process();

        /*CLEAR GLOBAL VARIABLES!*/
        rects.clear();
        pts.clear();
        /*CLEAR GLOBAL VARIABLES!*/
    }

    return 0;
}

The statements and opinions included in these pages are those of  only. Any statements and 
          opinions included in these pages are not those of Louisiana 
          State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014