【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 0;
    while(c!='-'&&c!='.'&&(c<'0'||c>'9')) c=getchar();
    sgn=(c=='-')?-1:1;
    ret=(c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
    if(c==' '||c=='
'){ ret*=sgn; return 1; }
    while(c=getchar(),c>='0'&&c<='9') ret+=(c-'0')*bit,bit/=10;
    ret*=sgn;
    return 1;
}
#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[2222];
int b[23]={72,81,82,83,85,92,93,94,97,112,115}; //11
int c[23]={72,73,74,75,76,77,78,79,87,89,90,95,98,105,108,116}; //16
int days[33]={0,31,28,31,30,31,30,31,31,30,31,30,31};
void gettime(int y1,int m1,int d1,int h1,int mi1,int s1,int &time1)
{
    for(int i=1970;i<y1;i++){
        if(i%4==0&&i%100!=0||i%400==0){
            time1+=24*3600*366;
        }
        else time1+=24*3600*365;
        time1+=a[i];
   }

   for(int i=1;i<m1;i++){
        time1+=days[i]*24*60*60;
        if(y1%4==0&&y1%100!=0||y1%400==0)
        {
            if(i==2)time1+=24*3600;
        }
   }
  // printf(">>%d
",time1);
   for(int i=1;i<d1;i++)time1+=24*3600;

   int pd=0;
   for(int i=0;i<11;i++)if(y1==1900+b[i])pd=1;
   if(m1>6&&pd)time1++;

   for(int i=0;i<h1;i++)time1+=3600;
   for(int i=0;i<mi1;i++)time1+=60;
   time1+=s1;
}
int main(){
   for(int i=1970;i<=2017;i++)
   {
        for(int j=0;j<11;j++)a[i]=a[i]+(1900+b[j]==i);
        for(int j=0;j<16;j++)a[i]=a[i]+(1900+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=0,time2=0;
   gettime(y1,m1,d1,h1,mi1,s1,time1);
   gettime(y2,m2,d2,h2,mi2,s2,time2);
   printf("%d
",time2-time1);
}