Helping the HR

http://codeforces.com/gym/102040 

思路：以0点位起点，那么就是一个数轴一样处理了；

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e5+9;
const int maxm=4e5+9;
const int mod=998244353;


int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int n;
    int ans=0;
    while(cin>>n&&n)
    {
        ans=0;
        char c;
        char s[30];
        int h1,h2,m1,m2,s1,s2;
        while(n--)
        {
            int st=0;
            int ed=0;
            bool f=0;
            //scanf("%c:%d:%d:%d:%d:%d:%d",&c,&h1,&m1,&s1,&h2,&m2,&s2);
            cin>>s;
            int lens=strlen(s);
            c=s[0];
            int k=0;
            int num=0;
            for(int i=2;i<lens;i++)
            {
                if(s[i]!=':'&&i!=lens-1)
                {
                    num=num*10+s[i]-'0';
                }
                else if(s[i]==':')
                {
                    k++;
                    if(k==1)
                    {
                        h1=num;
                        num=0;

                    }
                    else if(k==2)
                    {
                        m1=num;
                        num=0;
                    }
                    else if(k==3)
                    {
                        s1=num;
                        num=0;
                    }
                    else if(k==4)
                    {
                        h2=num;
                        num=0;

                    }
                    else if(k==5)
                    {
                        m2=num;
                        num=0;
                    }
                }
                if(i==lens-1)
                {
                    s2=num*10+s[i]-'0';
                    num=0;
                }
            }
            //cout<<c<<" "<<h1<<" "<<m1<<" "<<s1<<" "<<h2<<" "<<m2<<" "<<s2<<endl;
            st=s1+m1*60+h1*3600;
            ed=s2+m2*60+h2*3600;
            if(c=='D')
            {
                if(st>9*3600+30*60) f=1;
                int len;
                len=ed-max(8*3600+30*60,st);
                if(len<8*3600) f=1;
                ans+=f;
            }
            else
            {
                if(st>12*3600+30*60) f=1;
                int len=ed-max(st,8*3600+30*60);
                if(len<9*3600) f=1;
                ans+=f;
            }
        }
        if(ans>3) puts("Issue Show Cause Letter");
        else if(ans==0) puts("All OK");
        else printf("%d Point(s) Deducted\n",ans);
    }

    return 0;
}