poj 1486 Sorting Slides(二分图匹配的查找应用)

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

Southwestern European Regional Contest 1998

 

给出一些矩形的坐标和一些点的坐标，若点在矩形内，则该点和该矩形匹配，问是否存在某个匹配在所有的完美匹配中，这题可以先任意找出一个完美匹配，然后依次删除该匹配的每一条边，若仍能构成完美匹配，则这个匹配不唯一，若不能构成完美匹配，则该匹配唯一

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 100
int n;
int x1[N],x2[N],y1[N],y2[N];
int mp[N][N];
int match[N];
int path[N];
int vis[N];
bool dfs(int x){
    for(int i=0;i<n;i++){
        if(!vis[i] && mp[x][i]){
            vis[i]=1;
            if(match[i]==-1 || dfs(match[i])){
                match[i]=x;
                return true;
            }
        }
    }
    return false;
}
int solve(){
    int ans=0;
    memset(match,-1,sizeof(match));

    for(int i=0;i<n;i++){
        memset(vis,0,sizeof(vis));
        if(dfs(i)){
            ans++;
        }
    }
    return ans;
}
int main()
{
    int ac=0;
    while(scanf("%d",&n)==1 && n){
            printf("Heap %d
",++ac);
        for(int i=0;i<n;i++){
            scanf("%d%d%d%d",&x1[i],&x2[i],&y1[i],&y2[i]);
        }
        memset(mp,0,sizeof(mp));
        for(int i=0;i<n;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            for(int j=0;j<n;j++){
                if(a>x1[j] && a<x2[j] && b>y1[j] && b<y2[j]){
                    mp[i][j]=1;
                }
            }
        }

        int ans=solve();
        //printf("===%d
",ans);
        int flag=0;
        if(ans==n){
            for(int i=0;i<n;i++){
                path[i]=match[i];
            }
            for(int i=0;i<n;i++){
                int u=path[i];
                mp[u][i]=0;//这个表示匹配的每一条边？
                if(solve()==n) continue;
                else{
                    if(flag)
                      printf(" ");
                    printf("(%c,%d)",'A'+i,path[i]+1);
                    flag=1;
                }
                mp[u][i]=1;

            }
        }
        if(!flag){
            printf("none");
        }
        printf("

");

    }
    return 0;
}