zoukankan      html  css  js  c++  java
  • HDU 5943 Kingdom of Obsession 【二分图匹配 匈牙利算法】 (2016年中国大学生程序设计竞赛(杭州))

    Kingdom of Obsession

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 49    Accepted Submission(s): 14


    Problem Description
    There is a kindom of obsession, so people in this kingdom do things very strictly.

    They name themselves in integer, and there are n people with their id continuous (s+1,s+2,,s+n) standing in a line in arbitrary order, be more obsessively, people with id x wants to stand at yth position which satisfy

    xmody=0


    Is there any way to satisfy everyone's requirement?
     
    Input
    First line contains an integer T, which indicates the number of test cases.

    Every test case contains one line with two integers ns.

    Limits
    1T100.
    1n109.
    0s109.
     
    Output
    For every test case, you should output 'Case #x: y', where x indicates the case number and counts from 1 and y is the result string.

    If there is any way to satisfy everyone's requirement, y equals 'Yes', otherwise y equals 'No'.
     
    Sample Input
    2 5 14 4 11
     
    Sample Output
    Case #1: No Case #2: Yes
     
    Source
     
    Recommend
    liuyiding   |   We have carefully selected several similar problems for you:  5943 5942 5941 5940 5939 
     
    Statistic | Submit | Discuss | Note

    题目链接:

      http://acm.hdu.edu.cn/showproblem.php?pid=5943

    题目大意:

      给定S,N,把S+1,S+2,...S+N这N个数填到1,2,...,N里,要求X只能填到X的因子的位置。(即X%Y=0,那么X才能放在Y位置)

      问是否能够放满。

    题目思路:

      【二分图匹配 匈牙利算法】

      首先,如果S<N,那么S+1,S+2...N这些数直接放在S+1,S+2...N的位置上

      (如果其他数x放在这些位置上面,这些数不放在对应位置,那么x一定能放在这些数放的位置,所以直接交换即可)

      所以可以直接将S和N调换,缩小N。

      接着看N个连续的数,如果出现2个素数。那么必然无解(都只能放1)

      所以可以估算一下素数的最大间隔(我取504),N超过必然无解。

      N小于504的情况下,直接暴力建边(能整除就连边),然后跑二分图匹配即可。

    View Code
  • 相关阅读:
    阿里云短信支付微信支付
    python 阿里云短信群发推送
    python twilio 短信群发 知识留存
    python爬虫 发送定时气象预报
    python beautifulsoup爬虫
    strongswan
    Docker进入主流,PaaS大有可为(转)
    Python 网页爬虫 & 文本处理 & 科学计算 & 机器学习 & 数据挖掘兵器谱(转)
    在IT网站上少花些时间
    Python 代码性能优化技巧(转)
  • 原文地址:https://www.cnblogs.com/Coolxxx/p/6011472.html
Copyright © 2011-2022 走看看