【杂题】HDOJ 4768 Flyer

因为解的个数最多只有1个。。。。所以可以用二分。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 500005
#define maxm 50005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

struct node
{
	LL a, b, c;
}p[maxn];

LL ok, mx, n, ans1, ans2;

void read(void)
{
	ok = 0;
	mx = 1;
	for(int i = 1; i <= n; i++) {
		scanf("%I64d%I64d%I64d", &p[i].a, &p[i].c, &p[i].b);
		if(p[i].b == 0) p[i].b = p[i].c;
		if(p[i].a == 0) p[i].a += p[i].b;
		mx = max(mx, p[i].c);
	}
}

LL calc(LL x)
{
	LL res = 0;
	for(int i = 1; i <= n; i++) {
		int t = min(x, p[i].c);
		if(t < p[i].a) continue;
		res += (t - p[i].a) / p[i].b + 1;
	}

	return res;
}

void dfs(LL L, LL R)
{
	if(L == R) {
		LL cnt = calc(L) - calc(L - 1);
		if(cnt % 2 == 1) {
			ok = 1;
			ans1 = L;
			ans2 = cnt;
		}
		return;
	}
	LL mid = (L + R) >> 1;
	LL cnt = calc(mid) - calc(L - 1);
	if(cnt % 2 == 1) dfs(L, mid);
	else dfs(mid+1, R);
}

void work(void)
{
	LL cnt = calc(mx);
	if(cnt % 2 == 0) {
		printf("DC Qiang is unhappy.\n");
		return;
	}
	dfs(1, mx);
	if(ok) printf("%I64d %I64d\n", ans1, ans2);
	else printf("DC Qiang is unhappy.\n");
}

int main(void)
{
	while(scanf("%I64d", &n)!=EOF) {
		read();
		work();
	}


	return 0;
}