zoukankan      html  css  js  c++  java
  • CF292-B

    B. Drazil and His Happy Friends
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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.

    水题,暴力模拟一下就可以,比赛的时候天真的以为只用循环n*m/gcd(n,m)次就可以了,结果WA了,可惜啊

    将循环次数调大一点就能过了.

    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int main()
    {
        int boy[105];
        int girl[105];
        memset(boy,0,sizeof(boy));
        memset(girl,0,sizeof(girl));
        int n,m;
        cin>>n>>m;
        int a,b;
        cin>>a;
        int x;
        for(int i=1;i<=a;i++)
        {
            cin>>x;
            boy[x]=1;
        }
        cin>>b;
        for(int i=1;i<=b;i++)
        {
            cin>>x;
            girl[x]=1;
        }
        for(int i=0;i<=20000;i++)
        {
            if(boy[i%n])
            {
                girl[i%m]=1;
            }
            if(girl[i%m])
            {
                boy[i%n]=1;
            }
        }
        bool flag=true;
        for(int i=0;i<n;i++)
            if(!boy[i])
                flag=false;
        for(int i=0;i<m;i++)
            if(!girl[i])
                flag=false;
        if(flag)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
        return 0;
    }
    
    
  • 相关阅读:
    程序员面试金典题解
    Leetcode 解题报告
    常用小算法
    BestCoder 百度之星2016
    jQuery 删除或是清空某个HTML元素。
    dataTable 默认排序设定
    jquery tableExport 插件导出excel (无乱码) 比较简单的表格
    php 根据周数获取当周的开始日期与最后日期
    thinkphp5使用load和use引入第三方类
    判断checkbox是否选中
  • 原文地址:https://www.cnblogs.com/wzsblogs/p/4295806.html
Copyright © 2011-2022 走看看