zoukankan      html  css  js  c++  java
  • Codeforces Round #292 (Div. 2)——B——Drazil and His Happy Friends

    Drazil has many friends. Some of them are happy and some of them are unhappy. Drazil wants to make all his friends become happy. So he invented the following plan.

    There are n boys and m girls among his friends. Let's number them from 0 to n - 1 and 0 to m - 1 separately. In i-th day, Drazil invites -th boy and -th girl to have dinner together (as Drazil is programmer, i starts from 0). If one of those two people is happy, the other one will also become happy. Otherwise, those two people remain in their states. Once a person becomes happy (or if he/she was happy originally), he stays happy forever.

    Drazil wants to know whether he can use this plan to make all his friends become happy at some moment.

    Input

    The first line contains two integer n and m (1 ≤ n, m ≤ 100).

    The second line contains integer b (0 ≤ b ≤ n), denoting the number of happy boys among friends of Drazil, and then follow b distinct integers x1, x2, ..., xb (0 ≤ xi < n), denoting the list of indices of happy boys.

    The third line conatins integer g (0 ≤ g ≤ m), denoting the number of happy girls among friends of Drazil, and then follow g distinct integers y1, y2, ... , yg (0 ≤ yj < m), denoting the list of indices of happy girls.

    It is guaranteed that there is at least one person that is unhappy among his friends.

    Output

    If Drazil can make all his friends become happy by this plan, print "Yes". Otherwise, print "No".

    Sample test(s)
    input
    2 3
    0
    1 0
    output
    Yes
    input
    2 4
    1 0
    1 2
    output
    No
    input
    2 3
    1 0
    1 1
    output
    Yes
    Note

    By  we define the remainder of integer division of i by k.

    In first sample case:

    • On the 0-th day, Drazil invites 0-th boy and 0-th girl. Because 0-th girl is happy at the beginning, 0-th boy become happy at this day.
    • On the 1-st day, Drazil invites 1-st boy and 1-st girl. They are both unhappy, so nothing changes at this day.
    • On the 2-nd day, Drazil invites 0-th boy and 2-nd girl. Because 0-th boy is already happy he makes 2-nd girl become happy at this day.
    • On the 3-rd day, Drazil invites 1-st boy and 0-th girl. 0-th girl is happy, so she makes 1-st boy happy.
    • On the 4-th day, Drazil invites 0-th boy and 1-st girl. 0-th boy is happy, so he makes the 1-st girl happy. So, all friends become happy at this moment.

    大意:暴力水题,不过循环的次数一直开太小一直样例不过

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    int n,m,h,g,x;
    int a[1100],b[1100];
    int main()
    {
       while(~scanf("%d%d",&n,&m)){
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        scanf("%d",&h);
        for(int i = 1; i <= h ; i++){
            scanf("%d",&x);
            a[x] = 1;
        }
        scanf("%d",&g);
        for(int i = 1; i <= g; i++){
            scanf("%d",&x);
            b[x] = 1;
        }
        int t = max(n,m);
        for(int i = 0 ; i <= t*1000; i++){
            if(a[i%n] == 1){
            b[i%m] = 1;
            continue;
            }
            if(b[i%m] == 1)
            a[i%n] = 1;
        }
        int flag  = 0;
        for(int i = 0; i < n; i++){
            if(a[i] == 0) flag = 1;
        }
        for(int i = 0; i < m ; i++){
            if(b[i] == 0 ) flag = 1;
        }
        if(flag) printf("No
    ");
        else printf("Yes
    ");
       }
       return 0;
    }
    View Code
  • 相关阅读:
    Java基础知识强化之集合框架笔记20:数据结构之 栈 和 队列
    Java基础知识强化之集合框架笔记19:List集合迭代器使用之 并发修改异常的产生原因 以及 解决方案
    模块已加载,但对dllregisterServer的调用失败
    sql回滚
    BAT 批处理脚本 教程
    shell脚本小技巧
    shell if
    REDHAT4.8安装yum
    Linux中文显示乱码解决
    Nginx配置文件详细说明
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4344224.html
Copyright © 2011-2022 走看看