HDU4768 Flyer 二分

最新推荐文章于 2021-10-26 09:24:42 发布

没有灵魂的程序员

最新推荐文章于 2021-10-26 09:24:42 发布

阅读量1.9k

点赞数

分类专栏：二分查找文章标签： acm 算法杭电

本文链接：https://blog.csdn.net/xky140610205/article/details/52173664

版权

二分查找专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Flyer

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2777 Accepted Submission(s): 1038

Problem Description

The new semester begins! Different kinds of student societies are all trying to advertise themselves, by giving flyers to the students for introducing the society. However, due to the fund shortage, the flyers of a society can only be distributed to a part of the students. There are too many, too many students in our university, labeled from 1 to 2^32. And there are totally N student societies, where the i-th society will deliver flyers to the students with label A_i, A_i+C_i,A_i+2*C_i,…A_i+k*C_i (A_i+k*C_i<=B_i, A_i+(k+1)*C_i>B_i). We call a student "unlucky" if he/she gets odd pieces of flyers. Unfortunately, not everyone is lucky. Yet, no worries; there is at most one student who is unlucky. Could you help us find out who the unfortunate dude (if any) is? So that we can comfort him by treating him to a big meal!

Input

There are multiple test cases. For each test case, the first line contains a number N (0 < N <= 20000) indicating the number of societies. Then for each of the following N lines, there are three non-negative integers A_i, B_i, C_i (smaller than 2^31, A_i <= B_i) as stated above. Your program should proceed to the end of the file.

Output

For each test case, if there is no unlucky student, print "DC Qiang is unhappy." (excluding the quotation mark), in a single line. Otherwise print two integers, i.e., the label of the unlucky student and the number of flyers he/she gets, in a single line.

Sample Input

Sample Output

Source

2013 ACM/ICPC Asia Regional Changchun Online

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

//题意

n个社团派发传单，有a,b,c三个参数，派发的规则是，派发给序号为a，a+c....a+k*c，序号要求是小于等于b

这其中，有一个学生只收到了奇数传单，要求找出这个学生的编号与得到的传单数目

// 二分原理也许不难难的是怎么去二分

// 2^31 __int64 不用说

// 突破点就是只有一个人拿到的是奇数的二分成左右区间 mid 算出左边区间各个社团发的次数总和如果是奇数则肯定在否者在右边

// 还有一个方法是异或法如果 0^a^b^a^b^c=c;

// 如果只有一个数异或了一次最后得数就是这个人了如果最后为0 则没有

// 代码链接 http://blog.csdn.net/libin56842/article/details/25741317

#include<stdio.h>
#include<algorithm>
using namespace std;
#define L 20005
#define ll __int64
ll n;
ll a[L],b[L],c[L],low,high;
ll binaryg(ll mid)           //函数返回值 保持一致
{
    ll sum=0,k;
    for(int i=0; i<n; i++)
    {
        k = min(mid,b[i]);
        if(k>=a[i])
            sum+=(k-a[i])/c[i]+1;
    }
    return sum;          //sum是ll型
}

int main()
{
    int i;
    while(~scanf("%d",&n))
    {
        for(i = 0; i<n; i++)
            scanf("%I64d%I64d%I64d",&a[i],&b[i],&c[i]);
        low=0,high = 1LL<<32; //注意要把1变成ll型 不然直接炸了 系统默认int
        ll mid;
        while(low<high)
        {
            mid = (low+high)>>1;
            if(binaryg(mid)&1) high= mid;
            else low= mid+1;
        }
        if(low == 1LL<<32)
            printf("DC Qiang is unhappy.\n");
        else
        {
            while(binaryg(low)%2==0) low--;//注意细节 最后只剩两个数肯定是low+1结束,所以那个数可能就是low
            // 或者比low小1;
            printf("%I64d %I64d\n",low,binaryg(low)-binaryg(low-1));
        }
    }

    return 0;
}

如果一个程序员不细心严谨,就是对自己残忍.