POJ1468 Sorting Slides

Sorting Slides

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 4442		Accepted: 1757

Description

Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk, he has to sort the slides. Being a kind of minimalist, he wants to do this with the minimum amount of work possible. 

The situation is like this. The slides all have numbers written on them according to their order in the talk. Since the slides lie on each other and are transparent, one cannot see on which slide each number is written. 

Well, one cannot see on which slide a number is written, but one may deduce which numbers are written on which slides. If we label the slides which characters A, B, C, ... as in the figure above, it is obvious that D has number 3, B has number 1, C number 2 and A number 4. 

Your task, should you choose to accept it, is to write a program that automates this process.

Input

The input consists of several heap descriptions. Each heap descriptions starts with a line containing a single integer n, the number of slides in the heap. The following n lines contain four integers xmin, xmax, ymin and ymax, each, the bounding coordinates of the slides. The slides will be labeled as A, B, C, ... in the order of the input. 

This is followed by n lines containing two integers each, the x- and y-coordinates of the n numbers printed on the slides. The first coordinate pair will be for number 1, the next pair for 2, etc. No number will lie on a slide boundary. 

The input is terminated by a heap description starting with n = 0, which should not be processed. 

Output

For each heap description in the input first output its number. Then print a series of all the slides whose numbers can be uniquely determined from the input. Order the pairs by their letter identifier. 

If no matchings can be determined from the input, just print the word none on a line by itself. 

Output a blank line after each test case. 

Sample Input

4
6 22 10 20
4 18 6 16
8 20 2 18
10 24 4 8
9 15
19 17
11 7
21 11
2
0 2 0 2
0 2 0 2
1 1
1 1
0

Sample Output

Heap 1
(A,4) (B,1) (C,2) (D,3)

Heap 2
none

Source

————————————————————————————————————

题目的意思是给出n个矩形，里面每个分配一个数字，问唯一的数字有哪几个

思路：二分图匹配关键边判定，先求二分图匹配，再枚举去掉已匹配的每一条边，判是否匹配数减少，若减少则为关键边

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

const int MAXN=1000;
int uN,vN;  //u,v数目
int g[MAXN][MAXN];//编号是0~n-1的
int linker[MAXN];
bool used[MAXN];
int mat[MAXN];
int aa[MAXN];
struct area
{
    int x1,x2,y1,y2;
} s[100005];
struct point
{
    int x,y;
} p[100005];

bool dfs(int u)
{
    int v;
    for(v=0; v<vN; v++)
        if(g[u][v]&&!used[v])
        {
            used[v]=true;
            if(linker[v]==-1||dfs(linker[v]))
            {
                linker[v]=u;
                return true;
            }
        }
    return false;
}
int hungary()
{
    int res=0;
    int u;
    memset(linker,-1,sizeof(linker));
    for(u=0; u<uN; u++)
    {
        memset(used,0,sizeof(used));
        if(dfs(u))  res++;
    }
    return res;
}

int main()
{
    int k,n;
    int cas=1;
    while(~scanf("%d",&n)&&n)
    {
        for(int i=0; i<n; i++)
            scanf("%d%d%d%d",&s[i].x1,&s[i].x2,&s[i].y1,&s[i].y2);
        for(int i=0; i<n; i++)
            scanf("%d%d",&p[i].x,&p[i].y);
        memset(g,0,sizeof g);
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
            {
                if(p[i].x>s[j].x1&&p[i].x<s[j].x2&&p[i].y>s[j].y1&&p[i].y<s[j].y2)
                    g[i][j]=1;
            }
        uN=vN=n;
        int Match=hungary();
        printf("Heap %d\n",cas++);

        if(Match<n)
        {
            printf("none\n");
            continue;
        }
        for(int i=0; i<n; i++)
            mat[i]=linker[i];
        int ct=0;
        for(int i=0; i<n; i++)
        {
            g[mat[i]][i]=0;
            if(hungary()<n)
            {
                aa[ct++]=i;
            }
            g[mat[i]][i]=1;
        }
        if(ct==0)
            printf("none\n");
        else
        {
            int q=0;
            for(int i=0; i<ct; i++)
            {
                if(q++)
                    printf(" ");
                printf("(%c,%d)",'A'+aa[i],mat[aa[i]]+1);
            }
            printf("\n");
        }
        printf("\n");
    }
    return 0;
}