HDU 5611 Baby Ming and phone number (水)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5611

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define read(x,y) scanf("%d%d",&x,&y)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
const int  maxn =1e5+5;
const int mod=1e9+7;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll n,a,b;
ll ans=0;
ll xx;
bool judge1(ll x)
{
    int mod=100000;x%=mod;
    return (x%11111==0);
}
bool judge2(ll x)
{
    int mod=100000;x%=mod;
    int tmp=x;

    int pre=x%10,flag1=1,flag2=1;

    int tim=4;
    x/=10;
    while(tim--)
    {
        if(pre-1==x%10) pre=x%10;
        else {flag1=0;break;}
        x/=10;
    }

    x=tmp,pre=x%10,x/=10;
    tim=4;
    while(tim--)
    {
        if(pre+1==x%10) pre=x%10;
        else {flag2=0;break;}
        x/=10;
    }
    return flag1||flag2;
}
int ub1[]={0,31,29,31,30,31,30,31,31,30,31,30,31};///闰年多一次
int ub2[]={0,31,28,31,30,31,30,31,31,30,31,30,31};///
bool isrun(int x)
{
    ///if(x%400&&x%4==0) return true;
    if(x%100!=0  &&  x%4==0) return true;
    if(x%400==0) return true;
    return false;
}
bool judge3(ll x)
{
    x%=100000000;///cout<<x<<" ";
    int year=x/10000;///cout<<x<<" ";
    x%=10000;
    int month=x/100;///cout<<x<<" ";
    x%=100;
    int day=x;///cout<<x<<endl;
    if(year<1980||year>2016) return false;
    if(month<1||month>12) return false;
    if(isrun(year))
    {
        if(day<1||day>ub1[month]) return false;
    }
    else
    {
        if(day<1||day>ub2[month]) return false;
    }
    return true;
}
int main()
{
    int t;scanf("%d",&t);
    while(t--)
    {
        scanf("%lld",&n);
        scanf("%lld%lld",&a,&b);
        ans=0;
        while(n--)
        {
            scanf("%lld",&xx);
            if(judge1(xx)||judge2(xx)||judge3(xx)) ans+=a;
            else ans+=b;
        }
        printf("%lld\n",ans);
    }
    return 0;
}