POJ3484 Showstopper (二分+字符串处理)

/*
* Created:     2016年04月03日 20时06分30秒 星期日
* Author:      Akrusher
*
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <fstream>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define in(n) scanf("%d",&(n))
#define in2(x1,x2) scanf("%d%d",&(x1),&(x2))
#define in3(x1,x2,x3) scanf("%d%d%d",&(x1),&(x2),&(x3))
#define inll(n) scanf("%I64d",&(n))
#define inll2(x1,x2) scanf("%I64d%I64d",&(x1),&(x2))
#define inlld(n) scanf("%lld",&(n))
#define inlld2(x1,x2) scanf("%lld%lld",&(x1),&(x2))
#define inf(n) scanf("%f",&(n))
#define inf2(x1,x2) scanf("%f%f",&(x1),&(x2))
#define inlf(n) scanf("%lf",&(n))
#define inlf2(x1,x2) scanf("%lf%lf",&(x1),&(x2))
#define inc(str) scanf("%c",&(str))
#define ins(str) scanf("%s",(str))
#define out(x) printf("%d\n",(x))
#define out2(x1,x2) printf("%d %d\n",(x1),(x2))
#define outf(x) printf("%f\n",(x))
#define outlf(x) printf("%lf\n",(x))
#define outlf2(x1,x2) printf("%lf %lf\n",(x1),(x2));
#define outll(x) printf("%I64d\n",(x))
#define outlld(x) printf("%lld\n",(x))
#define outc(str) printf("%c\n",(str))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define mem(X,Y) memset(X,Y,sizeof(X));
typedef vector<int> vec;
typedef long long ll;
typedef pair<int,int> P;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const ll INF=1ll<<38;    //直接用1移位会爆int
const ll mod=1e9+7;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
const bool AC=true;

const int M_case=1000000+100;
ll x[M_case],y[M_case],z[M_case];//等差数列,x为首项,y是末项,z是公差
ll cnt;
char str[110];
//偶偶偶偶偶偶奇(mid)奇奇奇奇奇
ll C(ll mid){         //返回值用ll,否则会wa
    ll sum=0,temp;
    rep(i,0,cnt){
        if(mid<x[i]) continue;
        temp=min(mid,y[i])-x[i];
        sum+=temp/z[i]+1; //前缀和出现的次数,包括当前
        }
    return sum ; //奇数为true;
}
void solve(){
    ll lb,mid,ub;
    lb=1ll,ub=INF;
    while(ub>lb){
        mid=(lb+ub)>>1;
        if(C(mid)&1) ub=mid;
        else lb=mid+1;
    }
    if(lb==INF) printf("no corruption\n");
    else printf("%lld %lld\n",ub,C(ub)-C(ub-1));//计算次数
}
int main()
{
    cnt=0;
    while(gets(str)!=NULL){ 
        if(strlen(str)==0){
            if(cnt==0) continue; //注意输入数据之间可能又多行空格
            solve();
            cnt=0;
         }
         else{
             sscanf(str,"%I64d%I64d%I64d",&x[cnt],&y[cnt],&z[cnt]);
             cnt++;
         }
    }
    if(cnt)
        solve();//必须加上判断,否则会wa
    return 0;
}