zoukankan      html  css  js  c++  java
  • (匈牙利算法DFS)hdu 3729

    I'm Telling the Truth

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


    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
     
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    int tt,n,mark[100010],link[100010],vis[100010];
    struct node
    {
          int x,y;
    }e[100010];
    bool dfs(int t)
    {
          for(int i=e[t].x;i<=e[t].y;i++)
          {
                if(mark[i]==-1)
                {
                      mark[i]=1;
                      if(link[i]==-1||dfs(link[i]))
                      {
                            link[i]=t;
                            vis[t]=1;
                            return true;
                      }
                }
          }
          return false;
    }
    int main()
    {
          scanf("%d",&tt);
          while(tt--)
          {
               memset(vis,0,sizeof(vis));
               int sum=0;
               scanf("%d",&n);
               for(int i=1;i<=n;i++)
                      scanf("%d%d",&e[i].x,&e[i].y);
               memset(link,-1,sizeof(link));
               for(int i=n;i>=1;i--)
               {
                     memset(mark,-1,sizeof(mark));
                     if(dfs(i))
                            sum++;
               }
               printf("%d
    ",sum);
               for(int i=1;i<=n;i++)
               {
                     if(vis[i])
                     {
                           if(sum>1)
                                  printf("%d ",i);
                           else
                                  printf("%d
    ",i);
                           sum--;
                     }
               }
          }
          return 0;
    }
    

      

  • 相关阅读:
    这些特效对于学习前端我们很有用
    每周前端开源推荐第二期
    每周前端开源推荐第七期
    BeeFramework:以极客的方式开发你的应用
    node-webkit文档翻译#package.json
    android批量文件上传(android批量图片上传)
    VC多线程临界区
    【美妙的Python之三】Python 对象解析
    (转载)屌丝从毕业时的月入3000到三年后亿万身家的精彩励志之旅
    fedora 安装 pidgin-lwqq
  • 原文地址:https://www.cnblogs.com/a972290869/p/4247889.html
Copyright © 2011-2022 走看看