zoukankan      html  css  js  c++  java
  • Hdu 1068 最小路径覆盖

    Girls and Boys

    Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 6942    Accepted Submission(s): 3118


    Problem Description
    the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: there are no two students in the set who have been “romantically involved”. The result of the program is the number of students in such a set.

    The input contains several data sets in text format. Each data set represents one set of subjects of the study, with the following description:

    the number of students
    the description of each student, in the following format
    student_identifier:(number_of_romantic_relations) student_identifier1 student_identifier2 student_identifier3 ...
    or
    student_identifier:(0)

    The student_identifier is an integer number between 0 and n-1, for n subjects.
    For each given data set, the program should write to standard output a line containing the result.
    Sample Input
    7 0: (3) 4 5 6 1: (2) 4 6 2: (0) 3: (0) 4: (2) 0 1 5: (1) 0 6: (2) 0 1 3 0: (2) 1 2 1: (1) 0 2: (1) 0
    Sample Output
    5 2
    最小路径覆盖 = 顶点数 - 最大匹配数
    本题由于左边集合与右边集合相同,所以每个匹配计算了两次,所以求得的最大匹配应除以2
    Accepted Code:
     1 /*************************************************************************
     2     > File Name: 1068.cpp
     3     > Author: Stomach_ache
     4     > Mail: sudaweitong@gmail.com
     5     > Created Time: 2014年07月14日 星期一 16时29分38秒
     6     > Propose: 
     7  ************************************************************************/
     8 
     9 #include <cmath>
    10 #include <string>
    11 #include <cstdio>
    12 #include <vector>
    13 #include <fstream>
    14 #include <cstring>
    15 #include <iostream>
    16 #include <algorithm>
    17 using namespace std;
    18 
    19 const int MAX_N = 1000 + 5;
    20 int n;
    21 int cx[MAX_N], cy[MAX_N], mark[MAX_N];
    22 vector<int> G[MAX_N];
    23 
    24 int 
    25 path(int u) {
    26       for (int i = 0; i < (int)G[u].size(); i++) {
    27           int v = G[u][i];
    28           if (!mark[v]) {
    29               mark[v] = 1;
    30               if (cy[v] == -1 || path(cy[v])) {
    31                   cx[u] = v;
    32                 cy[v] = u;
    33                 return 1;
    34             }
    35         }
    36     }
    37     return 0;
    38 }
    39 
    40 int
    41 MaxMatch() {
    42       memset(cx, -1, sizeof(cx));
    43     memset(cy, -1, sizeof(cy));
    44     int res = 0;
    45     for (int i = 0; i < n; i++) {
    46           if (cx[i] == -1) {
    47               memset(mark, 0, sizeof(mark));
    48             res += path(i);
    49         }
    50     }
    51     return res;
    52 }
    53 
    54 int 
    55 main(void) {
    56       while (~scanf("%d", &n)) {
    57           for (int i = 0; i < n; i++) G[i].clear();
    58           for (int i = 0; i < n; i++) {
    59               int a, b;
    60             scanf("%d: (%d)", &a, &b);
    61             for (int j = 0; j < b; j++) {
    62                   int c;
    63                   scanf("%d", &c);
    64                 G[a].push_back(c);
    65             }
    66         }
    67         printf("%d
    ", n - MaxMatch() / 2);
    68     }
    69 
    70     return 0;
    71 }
  • 相关阅读:
    查询session内容
    7个月工作总结
    clob字段的值插入和查询N种方法【包括java调用存储过程传入clob参数】
    javascript实现jsp页面的打印预览
    Ext:添加进度条
    js实现非模态窗口增加数据后刷新父窗口数据
    websphere:rs.getDate()无法使用的解决方法
    POI实现excel各种验证和导入的思路总结
    Tomcat迁移到WebsphereURL获取中文参数乱码问题
    JS函数参数
  • 原文地址:https://www.cnblogs.com/Stomach-ache/p/3843696.html
Copyright © 2011-2022 走看看