HDU 4768 Flyer （2013长春网络赛1010题，二分）

Flyer

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 386    Accepted Submission(s): 127

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

2 1 10 1 2 10 1 4 5 20 7 6 14 3 5 9 1 7 21 12

 

 

Sample Output

1 1 8 1

 

 

Source

2013 ACM/ICPC Asia Regional Changchun Online

 

 

Recommend

liuyiding

 

 

因为最多一个奇数的，所以总数是奇数的。

二分区间就可以了。

 

比赛时候二分的 l,r都是int存的，导致算mid = (l+r)/2的时候溢出了，TAT

这样TLE了好久，我艹。。。。。

 

水题一发

/* ***********************************************
Author        :kuangbin
Created Time  :2013/9/28 星期六 13:00:24
File Name     :2013长春网络赛\1010.cpp
************************************************ */

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

const int MAXN = 20010;
long long A[MAXN];
long long B[MAXN];
long long C[MAXN];
int n;
inline long long calc(long long  start,long long add,long long end)
{
    return (end-start+1 + add-1)/add;
}
inline bool check(long long l,long long r)
{
    long long sum = 0;
    for(int i = 0;i < n;i++)
    {
        long long end = min(B[i],r);
        if(end < A[i])continue;
        if(l >end)continue;
        long long s1;
        s1 = calc(A[i],C[i],end);
        if(l <= A[i])sum += s1;
        else sum += s1 - calc(A[i],C[i],l-1);

    }
    if(sum % 2 == 0)return false;
    return true;
}
long long ttt(long long l,long long r)
{
    long long sum = 0;
    for(int i = 0;i < n;i++)
    {
        long long end = min(B[i],r);
        if(end < A[i])continue;
        if(l > end)continue;
        long long s1,s2;
        s1 = calc(A[i],C[i],end);
        if(l <= A[i])sum += s1;
        else sum += s1 - calc(A[i],C[i],l-1);

    }
    return sum;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(scanf("%d",&n) == 1 && n)
    {
        long long l = 100000000000LL, r = 0;
        for(int i = 0;i < n;i++)
        {
            scanf("%I64d%I64d%I64d",&A[i],&B[i],&C[i]);
            l = min(l,A[i]);
            r = max(r,B[i]);
        }
        if(check(l,r) == false)
        {
            printf("DC Qiang is unhappy.\n");
            continue;
        }
        while(l < r)
        {
            long long mid = (l+r)/2;
            if(check(l,mid))
            {
                r = mid;
            }
            else l = mid+1;
        }
        printf("%d %d\n",(int)l,(int)ttt(l,l));
    }
    return 0;
}