zoukankan      html  css  js  c++  java
  • I'm Telling the Truth(二分图)

    、I’m Telling the Truth
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1740 Accepted Submission(s): 871

    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, Xi and Yi (1 <= Xi <= Yi <= 100000), means the i-th student’s rank is between Xi and Yi, 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

    2
    4
    5004 5005
    5005 5006
    5004 5006
    5004 5006
    7
    4 5
    2 3
    1 2
    2 2
    4 4
    2 3
    3 4

    Sample Output

    3
    2 3 4
    5
    1 3 5 6 7

    Source
    2010 Asia Tianjin Regional Contest
    二分图模板题

    #include <set>
    #include <map>
    #include <list>
    #include <stack>
    #include <cmath>
    #include <queue>
    #include <string>
    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    #define PI cos(-1.0)
    #define RR freopen("input.txt","r",stdin)
    using namespace std;
    const int Max= 100010;
    bool Mark[Max];
    int pre[Max];
    struct node
    {
        int L;
        int R;
    }a[65];
    int b[65];
    int vis[65];
    int num,n;
    bool DFS(int s)
    {
        for(int i=a[s].L;i<=a[s].R;i++)
        {
            if(!Mark[i])
            {
                Mark[i]=true;
                if(pre[i]==-1||DFS(pre[i]))
                {
                    pre[i]=s;
                    return 1;
                }
            }
        }
        return 0;
    }
    
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d",&n);
            for(int i=1;i<=n;i++)
            {
                scanf("%d %d",&a[i].L,&a[i].R);
            }
            num=0;
            memset(pre,-1,sizeof(pre));
            for(int i=n;i>=1;i--)
            {
                memset(Mark,false,sizeof(Mark));
                if(DFS(i))
                {
                    b[num++]=i;
                }
            }
            printf("%d
    ",num);
            for(int i=num-1;i>=0;i--)
            {
                if(i!=num-1)
                {
                    printf(" ");
                }
                printf("%d",b[i]);
            }
            printf("
    ");
        }
        return 0;
    }
    
    
  • 相关阅读:
    用友U8存货分类通过DataTable生成EasyUI Tree JSON
    脚本加密与解密
    CKFinker 2.5.0.1 去demo标示
    C#压缩图片时保留原始的Exif信息
    Newtonsoft.Json转换强类型DataTable错误:Self referencing loop detected with type ......
    Access无法启动应用程序,工作组信息文件丢失,或是已被其他用户已独占方式打开
    C#获取邮件客户端保存的邮箱密码
    网站ASHX不执行故障
    水晶报表打印时出现:出现通信错误 将停止打印
    UILabel居上对齐居下对齐类别扩展
  • 原文地址:https://www.cnblogs.com/juechen/p/5255956.html
Copyright © 2011-2022 走看看