二分图+hdu3729

最新推荐文章于 2021-10-20 17:16:32 发布

u010660276

最新推荐文章于 2021-10-20 17:16:32 发布

阅读量454

点赞数

分类专栏：二分图图论

本文链接：https://blog.csdn.net/u010660276/article/details/38442789

版权

二分图同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

图论

13 篇文章 0 订阅

订阅专栏

Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q Hand In Hand Online Acmers Forum \| Discuss Statistical Charts	Problem Archive Realtime Judge Status Authors Ranklist	C/C++/Java Exams ACM Steps Go to Job Contest LiveCast ICPC@China	Best Coder ^beta VIP \| STD Contests Virtual Contests DIY \| Web-DIY ^beta Recent Contests	lee Mail 0 (0) Control Panel Sign Out

***重磅消息——[BestCoder Round #4]冠军将获得iPad Mini一部！
《BestCoder用户手册》下载

I'm Telling the Truth

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1371 Accepted Submission(s): 697

Problem Description

After this year’s college-entrance exam, the teacher did a survey in his class on students’ score. There are n students in the class. The students didn’t want to tell their teacher their exact score; they only told their teacher their rank in the province (in the form of intervals).

After asking all the students, the teacher found that some students didn’t tell the truth. For example, Student1 said he was between 5004th and 5005th, Student2 said he was between 5005th and 5006th, Student3 said he was between 5004th and 5006th, Student4 said he was between 5004th and 5006th, too. This situation is obviously impossible. So at least one told a lie. Because the teacher thinks most of his students are honest, he wants to know how many students told the truth at most.

Input

There is an integer in the first line, represents the number of cases (at most 100 cases). In the first line of every case, an integer n (n <= 60) represents the number of students. In the next n lines of every case, there are 2 numbers in each line, X _i and Y _i (1 <= X _i <= Y _i <= 100000), means the i-th student’s rank is between X _i and Y _i, inclusive.

Output

Output 2 lines for every case. Output a single number in the first line, which means the number of students who told the truth at most. In the second line, output the students who tell the truth, separated by a space. Please note that there are no spaces at the head or tail of each line. If there are more than one way, output the list with maximum lexicographic. (In the example above, 1 2 3;1 2 4;1 3 4;2 3 4 are all OK, and 2 3 4 with maximum lexicographic)

Sample Input

Sample Output

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;

#define debug(a)  printf("debug : %d ***\n", a);
#define INF 0x3f3f3f3f
int n;
int mi, ma;
bool w[65][100000+5];
bool vis[100000+5];
int col[100000+5];

bool find(int x)
{
    int i, j;
    for(j = mi;j <= ma;j++)
    {

        if(w[x][j] == true && vis[j] == false)
        {
            vis[j] = true;
            if(col[j] == 0 || find(col[j]))
            {

                col[j] = x;
                return true;
            }
        }
    }
    return false;
}

int main()
{
    int a, b;
    int T;
    scanf("%d", &T);
    while(T--)
    {
        memset(w, 0, sizeof(w));
        memset(vis, 0, sizeof(vis));
        memset(col, 0, sizeof(col));
        scanf("%d", &n);
        mi = INF;
        ma = 0;
        for(int i = 1;i <= n;i++)
        {
            scanf("%d %d", &a, &b);
            mi = min(mi, a);
            ma = max(ma, b);
            for(int j = a;j <= b;j++)
                w[i][j] = true;
        }
        int ans[65];
        int t = 0;
        for(int i = n;i > 0;i--)
        {
            memset(vis, 0, sizeof(vis));
            if(find(i))
            {
                ans[t++] = i;
            }
        }
        if(t == 0)
        {
            printf("0\n");
            continue;
        }
        printf("%d\n", t);
        for(int i = t-1;i > 0;i--)
        {
            printf("%d ", ans[i]);
        }
        printf("%d\n", ans[0]);
    }
    return 0;
}