【hihocoder编程练习赛9】闰秒

题目链接

 #include<stdio.h>
 #include<string.h>
 #include<algorithm>
 #include<math.h>
 #include<iostream>
 #include<stdlib.h>
 #include<set>
 #include<map>
 #include<queue>
 #include<vector>
 #include<bitset>
 #pragma comment(linker, "/STACK:1024000000,1024000000")
 template <class T>
 bool scanff(T &ret){ //Faster Input
     char c; int sgn; T bit=0.1;
     if(c=getchar(),c==EOF) return ;
     while(c!='-'&&c!='.'&&(c<''||c>'')) c=getchar();
     sgn=(c=='-')?-:;
     ret=(c=='-')?:(c-'');
     while(c=getchar(),c>=''&&c<='') ret=ret*+(c-'');
     if(c==' '||c=='\n'){ ret*=sgn; return ; }
     while(c=getchar(),c>=''&&c<='') ret+=(c-'')*bit,bit/=;
     ret*=sgn;
     return ;
 }
 #define inf 1073741823
 #define llinf 4611686018427387903LL
 #define PI acos(-1.0)
 #define lth (th<<1)
 #define rth (th<<1|1)
 #define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
 #define drep(i,a,b) for(int i=int(a);i>=int(b);i--)
 #define gson(i,root) for(int i=ptx[root];~i;i=ed[i].next)
 #define tdata int testnum;scanff(testnum);for(int cas=1;cas<=testnum;cas++)
 #define mem(x,val) memset(x,val,sizeof(x))
 #define mkp(a,b) make_pair(a,b)
 #define findx(x) lower_bound(b+1,b+1+bn,x)-b
 #define pb(x) push_back(x)
 #define lowbit(x) x&-x
 using namespace std;
 typedef long long ll;
 typedef pair<int,int> pii;
 int a[];
 int b[]={,,,,,,,,,,}; //
 int c[]={,,,,,,,,,,,,,,,}; //
 int days[]={,,,,,,,,,,,,};
 void gettime(int y1,int m1,int d1,int h1,int mi1,int s1,int &time1)
 {
     for(int i=;i<y1;i++){
         if(i%==&&i%!=||i%==){
             time1+=**;
         }
         else time1+=**;
         time1+=a[i];
    }

    for(int i=;i<m1;i++){
         time1+=days[i]***;
         if(y1%==&&y1%!=||y1%==)
         {
             if(i==)time1+=*;
         }
    }
   // printf(">>%d\n",time1);
    for(int i=;i<d1;i++)time1+=*;

    int pd=;
    for(int i=;i<;i++)if(y1==+b[i])pd=;
    if(m1>&&pd)time1++;

    for(int i=;i<h1;i++)time1+=;
    for(int i=;i<mi1;i++)time1+=;
    time1+=s1;
 }
 int main(){
    for(int i=;i<=;i++)
    {
         for(int j=;j<;j++)a[i]=a[i]+(+b[j]==i);
         for(int j=;j<;j++)a[i]=a[i]+(+c[j]==i);
    }
    int y1,m1,d1,h1,mi1,s1;
    int y2,m2,d2,h2,mi2,s2;
    scanf("%d-%d-%d %d:%d:%d",&y1,&m1,&d1,&h1,&mi1,&s1);
    scanf("%d-%d-%d %d:%d:%d",&y2,&m2,&d2,&h2,&mi2,&s2);
    int time1=,time2=;
    gettime(y1,m1,d1,h1,mi1,s1,time1);
    gettime(y2,m2,d2,h2,mi2,s2,time2);
    printf("%d\n",time2-time1);
 }