What time is it?【模拟】

题目链接 POJ - 1676

---

  题意：给你两个时间点，前一个时间点比后一个时间点快了15分钟，当然，也有可能是隔天的，现在要问是否唯一确定第一个时间？

  输入坑点：两个时间之间用一个空格隔开，所以一行一共可以有25个字符。

  我们可以枚举00:00～23:59的所有时间，来看它前一刻（15minutes）的时间是否满足第二个字符串的条件，先用一个记录每个数字对应的字符的3*3的三位数组即可。

  模拟。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
char dir[10][3][3] =
{
    ' ', '_', ' ',
    '|', ' ', '|',
    '|', '_', '|',
    
    ' ', ' ', ' ',
    ' ', ' ', '|',
    ' ', ' ', '|',
    
    ' ', '_', ' ',
    ' ', '_', '|',
    '|', '_', ' ',
    
    ' ', '_', ' ',
    ' ', '_', '|',
    ' ', '_', '|',
    
    ' ', ' ', ' ',
    '|', '_', '|',
    ' ', ' ', '|',
    
    ' ', '_', ' ',
    '|', '_', ' ',
    ' ', '_', '|',
    
    ' ', '_', ' ',
    '|', '_', ' ',
    '|', '_', '|',
    
    ' ', '_', ' ',
    ' ', ' ', '|',
    ' ', ' ', '|',
    
    ' ', '_', ' ',
    '|', '_', '|',
    '|', '_', '|',
    
    ' ', '_', ' ',
    '|', '_', '|',
    ' ', '_', '|',
};
char Model[3][26];
char s[3][26];
void Make_String(int h1, int m1, int h2, int m2)
{
    int n1, n2;
    for(int i=0; i<3; i++)
    {
        n1 = h1 / 10; n2 = h1 % 10;
        s[i][0] = dir[n1][i][0]; s[i][1] = dir[n1][i][1]; s[i][2] = dir[n1][i][2];
        s[i][3] = dir[n2][i][0]; s[i][4] = dir[n2][i][1]; s[i][5] = dir[n2][i][2];
        n1 = m1 / 10; n2 = m1 % 10;
        s[i][6] = dir[n1][i][0]; s[i][7] = dir[n1][i][1]; s[i][8] = dir[n1][i][2];
        s[i][9] = dir[n2][i][0]; s[i][10] = dir[n2][i][1]; s[i][11] = dir[n2][i][2];
        s[i][12] = ' ';
        n1 = h2 / 10; n2 = h2 % 10;
        s[i][13] = dir[n1][i][0]; s[i][14] = dir[n1][i][1]; s[i][15] = dir[n1][i][2];
        s[i][16] = dir[n2][i][0]; s[i][17] = dir[n2][i][1]; s[i][18] = dir[n2][i][2];
        n1 = m2 / 10; n2 = m2 % 10;
        s[i][19] = dir[n1][i][0]; s[i][20] = dir[n1][i][1]; s[i][21] = dir[n1][i][2];
        s[i][22] = dir[n2][i][0]; s[i][23] = dir[n2][i][1]; s[i][24] = dir[n2][i][2];
    }
}
inline bool check(int h1, int m1, int h2, int m2)
{
    Make_String(h1, m1, h2, m2);
    for(int i=0; i<3; i++)
    {
        for(int j=0; j<=24; j++)
        {
            if(Model[i][j] == ' ' || Model[i][j] == '\0' || !Model[i][j]) continue;
            if(Model[i][j] ^ s[i][j]) return false;
        }
    }
    return true;
}
int main()
{
    int T; scanf("%d", &T);
    getchar();
    while(T--)
    {
        char ch;
        for(int i=0, j = 0; i<3; i++)
        {
            j = 0;
            while((ch = getchar()) && (ch != '\n')) Model[i][j++] = ch;
        }
        int Fir[2], Sec[2], ans = 0, ans_Fir[2], ans_Sec[2];
        for(int i=0; i<15; i++)
        {
            Fir[0] = 0; Fir[1] = i;
            Sec[0] = 23; Sec[1] = 45 + i;
            if(check(Fir[0], Fir[1], Sec[0], Sec[1]))
            {
                ans ++;
                ans_Fir[0] = Fir[0]; ans_Fir[1] = Fir[1];
                ans_Sec[0] = Sec[0]; ans_Sec[1] = Sec[1];
                
            }
        }
        for(int i=15; i<60; i++)
        {
            Fir[0] = 0; Fir[1] = i;
            Sec[0] = 0; Sec[1] = i - 15;
            if(check(Fir[0], Fir[1], Sec[0], Sec[1]))
            {
                ans ++;
                ans_Fir[0] = Fir[0]; ans_Fir[1] = Fir[1];
                ans_Sec[0] = Sec[0]; ans_Sec[1] = Sec[1];
            }
        }
        for(int h=1; h<24; h++)
        {
            Fir[0] = h;
            for(int m=0; m<60; m++)
            {
                Fir[1] = m;
                Sec[0] = h - (m < 15 ? 1 : 0);
                Sec[1] = m < 15 ? 45 + m : m - 15;
                if(check(Fir[0], Fir[1], Sec[0], Sec[1]))
                {
                    ans ++;
                    ans_Fir[0] = Fir[0]; ans_Fir[1] = Fir[1];
                    ans_Sec[0] = Sec[0]; ans_Sec[1] = Sec[1];
                }
            }
        }
        if(ans == 1)
        {
            printf("%.2d%.2d\n", ans_Fir[0], ans_Fir[1]);
        }
        else printf("Not Sure\n");
    }
    return 0;
}