zoukankan      html  css  js  c++  java
  • A Bug's Life POJ

    A Bug's Life

    Background 
    Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs. 
    Problem 
    Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.

    Input

    The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.

    Output

    The output for every scenario is a line containing "Scenario #i:", where i is the number of the scenario starting at 1, followed by one line saying either "No suspicious bugs found!" if the experiment is consistent with his assumption about the bugs' sexual behavior, or "Suspicious bugs found!" if Professor Hopper's assumption is definitely wrong.
     
    题目:教授假设这种虫子有两种性别,且只有异性的虫子之间才有交流,每个虫子从1开始编号。接下来给出每对虫子之间的交流,问是不是只有异性之间才有交流。
    思路:带权并查集板子题(不清楚带权并查集的点这里------>传送门)。同性权值为0,异性权值为1。
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <algorithm>
     4 #include <queue>
     5 #include <vector>
     6 #include <cmath>
     7 
     8 using namespace std;
     9 
    10 #define ll long long
    11 #define pb push_back
    12 #define fi first
    13 #define se second
    14 
    15 const int N = 2000 << 1;
    16 struct node
    17 {
    18     int rt, v;
    19 }fa[N];
    20 
    21 int Find(int x)
    22 {
    23     if(fa[x].rt == x) return x;
    24     else{
    25         int tmp = fa[x].rt;
    26         fa[x].rt = Find(tmp);
    27         fa[x].v = (fa[x].v + fa[tmp].v) % 2;
    28         return fa[x].rt;
    29     }
    30 }
    31 
    32 bool Union(int x, int y)
    33 {
    34     int fax = Find(x);
    35     int fay = Find(y);
    36     if(fax != fay){
    37         fa[fay].rt = fax;
    38         fa[fay].v = (fa[x].v + 1 - fa[y].v) % 2;
    39         return true;
    40     }else{
    41         if(0 == (fa[x].v + 1 - fa[y].v) % 2) return true;
    42         else return false;
    43     }
    44 }
    45 
    46 void solve()
    47 {   
    48     int T;
    49     scanf("%d", &T);
    50     for(int _case = 1; _case <= T; ++_case){
    51         int n, m;
    52         scanf("%d%d", &n, &m);
    53         for(int i = 0; i <= n; ++i){
    54             fa[i].rt = i;
    55             fa[i].v = 0;
    56         }
    57         vector<pair<int ,int > > info;
    58         int x, y;
    59         for(int i = 1; i <= m; ++i){
    60             scanf("%d%d", &x, &y);
    61             info.pb({x, y});
    62         }
    63 
    64         int error = 0;
    65         for(int i = 0; i < m; ++i){
    66             x = info[i].fi;
    67             y = info[i].se;
    68             if(!Union(x, y)){
    69                 error = 1;
    70                 break;
    71             }
    72         }
    73 
    74         printf("Scenario #%d:
    ", _case);
    75         printf("%s
    
    ", error == 1 ? "Suspicious bugs found!" : "No suspicious bugs found!");
    76     }
    77 }
    78 
    79 int main()
    80 {
    81 
    82     solve();
    83 
    84     return 0;
    85 }
  • 相关阅读:
    python_函数_文件
    Day_2_Python_str_list_dict的使用
    Day_1_Python_循环和格式化
    influxdb2.0版本部署+自启
    格式化Java内存工具JOL输出
    卷心菜的屯币日记
    influxDB时序数据库2.0FLUX查询语法使用记录
    两种转换2021-01-01T00:00:00Z为2021-01-01 00:00:00时间格式的方式(UTC时间转为yyyy-MM-dd HH:mm:ss)
    ThreadLocal的用处
    CentOS7使用ISO镜像文件作为离线Yum源
  • 原文地址:https://www.cnblogs.com/SSummerZzz/p/13284000.html
Copyright © 2011-2022 走看看