hdu6077Time To Get Up(高校第四场模拟)
来源:互联网 发布:sql server约束 编辑:程序博客网 时间:2024/06/05 02:54
Time To Get Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 466 Accepted Submission(s): 370
Problem Description
Little Q's clock is alarming! It's time to get up now! However, after reading the time on the clock, Little Q lies down and starts sleeping again. Well, he has 5 alarms, and it's just the first one, he can continue sleeping for a while.
Little Q's clock uses a standard 7-segment LCD display for all digits, plus two small segments for the '':'', and shows all times in a 24-hour format. The '':'' segments are on at all times.
Your job is to help Little Q read the time shown on his clock.
Little Q's clock uses a standard 7-segment LCD display for all digits, plus two small segments for the '':'', and shows all times in a 24-hour format. The '':'' segments are on at all times.
Your job is to help Little Q read the time shown on his clock.
Input
The first line of the input contains an integer T(1≤T≤1440) , denoting the number of test cases.
In each test case, there is an7×21 ASCII image of the clock screen.
All digit segments are represented by two characters, and each colon segment is represented by one character. The character ''X'' indicates a segment that is on while ''.'' indicates anything else. See the sample input for details.
In each test case, there is an
All digit segments are represented by two characters, and each colon segment is represented by one character. The character ''X'' indicates a segment that is on while ''.'' indicates anything else. See the sample input for details.
Output
For each test case, print a single line containing a string t in the format of HH:MM , where t(00:00≤t≤23:59) , denoting the time shown on the clock.
Sample Input
1.XX...XX.....XX...XX.X..X....X......X.X..XX..X....X.X....X.X..X......XX.....XX...XX.X..X.X....X....X.X..XX..X.X.........X.X..X.XX...XX.....XX...XX.
Sample Output
02:38
Source
2017 Multi-University Training Contest - Team 4
计算时间,取七个点进行判断
#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <queue>#include <iostream>using namespace std;int a[10][25];int check(int k){ if(a[0][1+k]&&a[1][0+k]&&a[3][1+k]&&a[4][0+k]&&a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 8; if(!a[0][1+k]&&!a[1][0+k]&&!a[3][1+k]&&!a[4][0+k]&&!a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 1; if(a[0][1+k]&&!a[1][0+k]&&a[3][1+k]&&a[4][0+k]&&a[6][1+k]&&a[1][3+k]&&!a[4][3+k]) return 2; if(a[0][1+k]&&!a[1][0+k]&&a[3][1+k]&&!a[4][0+k]&&a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 3; if(!a[0][1+k]&&a[1][0+k]&&a[3][1+k]&&!a[4][0+k]&&!a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 4; if(a[0][1+k]&&a[1][0+k]&&a[3][1+k]&&!a[4][0+k]&&a[6][1+k]&&!a[1][3+k]&&a[4][3+k]) return 5; if(a[0][1+k]&&a[1][0+k]&&a[3][1+k]&&a[4][0+k]&&a[6][1+k]&&!a[1][3+k]&&a[4][3+k]) return 6; if(a[0][1+k]&&!a[1][0+k]&&!a[3][1+k]&&!a[4][0+k]&&!a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 7; if(a[0][1+k]&&a[1][0+k]&&a[3][1+k]&&!a[4][0+k]&&a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 9; if(a[0][1+k]&&a[1][0+k]&&!a[3][1+k]&&a[4][0+k]&&a[6][1+k]&&a[1][3+k]&&a[4][3+k]) return 0;}int main(){ int n; char map[30]; scanf("%d",&n); while(n--) { //memset(a,0,sizeof(a)); memset(map,0,sizeof(map)); for(int i=0; i<7; i++) { scanf("%s",map); for(int j=0;j<21;j++) { if(map[j]=='X') a[i][j]=1; } } int a=check(0); int b=check(5); int c=check(12); int d=check(17); printf("%d%d:%d%d\n",a,b,c,d); //if(map[1][3]=='X')cout<<1; /*if(map[1][3]=='X'&&map[4][3]=='.'&&map[7][3]=='X'&&map[2][4]=='X'&&map[2][1]=='X'&&map[5][1]=='X'&&map[5][4]=='X') cout<<0; else if(map[1][3]=='.'&&map[4][3]=='.'&&map[7][3]=='.'&&map[2][4]=='X'&&map[2][1]=='.'&&map[5][1]=='.'&&map[5][4]=='X') cout<<1; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='X'&&map[2][1]=='.'&&map[5][1]=='X'&&map[5][4]=='.') cout<<2; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='X'&&map[2][1]=='.'&&map[5][1]=='.'&&map[5][4]=='X') cout<<3; else if(map[1][3]=='.'&&map[4][3]=='X'&&map[7][3]=='.'&&map[2][4]=='X'&&map[2][1]=='X'&&map[5][1]=='.'&&map[5][4]=='X') cout<<4; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='.'&&map[2][1]=='X'&&map[5][1]=='.'&&map[5][4]=='X') cout<<5; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='.'&&map[2][1]=='X'&&map[5][1]=='X'&&map[5][4]=='X') cout<<6; else if(map[1][3]=='X'&&map[4][3]=='.'&&map[7][3]=='.'&&map[2][4]=='X'&&map[2][1]=='.'&&map[5][1]=='.'&&map[5][4]=='X') cout<<7; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='X'&&map[2][1]=='X'&&map[5][1]=='X'&&map[5][4]=='X') cout<<8; else if(map[1][3]=='X'&&map[4][3]=='X'&&map[7][3]=='X'&&map[2][4]=='X'&&map[2][1]=='.'&&map[5][1]=='.'&&map[5][4]=='.') cout<<9; ///1 if(map[1][3+5]=='X'&&map[4][3+5]=='.'&&map[7][3+5]=='X'&&map[2][4+5]=='X'&&map[2][1+5]=='X'&&map[5][1+5]=='X'&&map[5][4+5]=='X') cout<<0; else if(map[1][3+5]=='.'&&map[4][3+5]=='.'&&map[7][3+5]=='.'&&map[2][4+5]=='X'&&map[2][1+5]=='.'&&map[5][1+5]=='.'&&map[5][4+5]=='X') cout<<1; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='X'&&map[2][1+5]=='.'&&map[5][1+5]=='X'&&map[5][4+5]=='.') cout<<2; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='X'&&map[2][1+5]=='.'&&map[5][1+5]=='.'&&map[5][4+5]=='X') cout<<3; else if(map[1][3+5]=='.'&&map[4][3+5]=='X'&&map[7][3+5]=='.'&&map[2][4+5]=='X'&&map[2][1+5]=='X'&&map[5][1+5]=='.'&&map[5][4+5]=='X') cout<<4; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='.'&&map[2][1+5]=='X'&&map[5][1+5]=='.'&&map[5][4+5]=='X') cout<<5; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='.'&&map[2][1+5]=='X'&&map[5][1+5]=='X'&&map[5][4+5]=='X') cout<<6; else if(map[1][3+5]=='X'&&map[4][3+5]=='.'&&map[7][3+5]=='.'&&map[2][4+5]=='X'&&map[2][1+5]=='.'&&map[5][1+5]=='.'&&map[5][4+5]=='X') cout<<7; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='X'&&map[2][1+5]=='X'&&map[5][1+5]=='X'&&map[5][4+5]=='X') cout<<8; else if(map[1][3+5]=='X'&&map[4][3+5]=='X'&&map[7][3+5]=='X'&&map[2][4+5]=='X'&&map[2][1+5]=='.'&&map[5][1+5]=='.'&&map[5][4+5]=='.') cout<<9; ///2 cout<<':'; if(map[1][3+12]=='X'&&map[4][3+12]=='.'&&map[7][3+12]=='X'&&map[2][4+12]=='X'&&map[2][1+12]=='X'&&map[5][1+12]=='X'&&map[5][4+12]=='X') cout<<0; else if(map[1][3+12]=='.'&&map[4][3+12]=='.'&&map[7][3+12]=='.'&&map[2][4+12]=='X'&&map[2][1+12]=='.'&&map[5][1+12]=='.'&&map[5][4+12]=='X') cout<<1; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='X'&&map[2][1+12]=='.'&&map[5][1+12]=='X'&&map[5][4+12]=='.') cout<<2; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='X'&&map[2][1+12]=='.'&&map[5][1+12]=='.'&&map[5][4+12]=='X') cout<<3; else if(map[1][3+12]=='.'&&map[4][3+12]=='X'&&map[7][3+12]=='.'&&map[2][4+12]=='X'&&map[2][1+12]=='X'&&map[5][1+12]=='.'&&map[5][4+12]=='X') cout<<4; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='.'&&map[2][1+12]=='X'&&map[5][1+12]=='.'&&map[5][4+12]=='X') cout<<5; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='.'&&map[2][1+12]=='X'&&map[5][1+12]=='X'&&map[5][4+12]=='X') cout<<6; else if(map[1][3+12]=='X'&&map[4][3+12]=='.'&&map[7][3+12]=='.'&&map[2][4+12]=='X'&&map[2][1+12]=='.'&&map[5][1+12]=='.'&&map[5][4+12]=='X') cout<<7; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='X'&&map[2][1+12]=='X'&&map[5][1+12]=='X'&&map[5][4+12]=='X') cout<<8; else if(map[1][3+12]=='X'&&map[4][3+12]=='X'&&map[7][3+12]=='X'&&map[2][4+12]=='X'&&map[2][1+12]=='.'&&map[5][1+12]=='.'&&map[5][4+12]=='.') cout<<9; ///3 if(map[1][3+17]=='X'&&map[4][3+17]=='.'&&map[7][3+17]=='X'&&map[2][4+17]=='X'&&map[2][1+17]=='X'&&map[5][1+17]=='X'&&map[5][4+17]=='X') cout<<0; else if(map[1][3+17]=='.'&&map[4][3+17]=='.'&&map[7][3+17]=='.'&&map[2][4+17]=='X'&&map[2][1+17]=='.'&&map[5][1+17]=='.'&&map[5][4+17]=='X') cout<<1; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='X'&&map[2][1+17]=='.'&&map[5][1+17]=='X'&&map[5][4+17]=='.') cout<<2; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='X'&&map[2][1+17]=='.'&&map[5][1+17]=='.'&&map[5][4+17]=='X') cout<<3; else if(map[1][3+17]=='.'&&map[4][3+17]=='X'&&map[7][3+17]=='.'&&map[2][4+17]=='X'&&map[2][1+17]=='X'&&map[5][1+17]=='.'&&map[5][4+17]=='X') cout<<4; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='.'&&map[2][1+17]=='X'&&map[5][1+17]=='.'&&map[5][4+17]=='X') cout<<5; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='.'&&map[2][1+17]=='X'&&map[5][1+17]=='X'&&map[5][4+17]=='X') cout<<6; else if(map[1][3+17]=='X'&&map[4][3+17]=='.'&&map[7][3+17]=='.'&&map[2][4+17]=='X'&&map[2][1+17]=='.'&&map[5][1+17]=='.'&&map[5][4+17]=='X') cout<<7; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='X'&&map[2][1+17]=='X'&&map[5][1+17]=='X'&&map[5][4+17]=='X') cout<<8; else if(map[1][3+17]=='X'&&map[4][3+17]=='X'&&map[7][3+17]=='X'&&map[2][4+17]=='X'&&map[2][1+17]=='.'&&map[5][1+17]=='.'&&map[5][4+17]=='.') cout<<9; cout<<endl;*/ } return 0;}/*...X..XX.....XX...XX....X....X...X..X.X..X...X....X.X.X..X.X..X......XX..........XX....X.X....X.X..X.X..X...X.X......X..X.X..X...X..XX.....XX...XX.*/
阅读全文
0 0
- hdu6077Time To Get Up(高校第四场模拟)
- HDU6077Time To Get Up(模拟)
- 2017多校联合四1011/hdu6077Time To Get Up(模拟)
- (hdu6077)2017杭电多校联赛第四场-Time To Get Up 模拟题
- 2017杭电多校第四场 1011 Time To Get Up(模拟)HDU 6077
- HDU6077 2017杭电多校联赛第四场-Time To Get Up
- hdu6075Questionnaire(高校第四场)
- Hdu6077 Time To Get Up(2017多校第4场)
- HDU6077 Time To Get Up(模拟,2017 HDU多校联赛 第4场)
- HDU 6077 Time To Get Up 模拟
- HDU 6077 Time To Get Up【模拟题】【水题】
- hdu 6077 Time To Get Up(简单模拟)
- GDOI2017模拟 第四场(4.24~4.26)
- Time To Get Up(枚举)
- Time To Get Up
- Time To Get Up
- Time To Get Up
- Time To Get Up
- pthread_cancel函数注意事项
- 线段树练习3
- MyCAT简易入门
- (1)sql 学习 :DISTINCT ,AND & OR 运算符 ,INSERT,正则表达式
- HDU 6069 Counting Divisors(求因子)
- hdu6077Time To Get Up(高校第四场模拟)
- 如何使用百度地图API在地图上批量添加点标注
- HDU-1503 Advanced Fruits(DP LCS)
- 一些题目的特殊思路
- plsqldev32位链接ORACL64位数据库 免客户端安装
- Oracle安装与卸载
- poj2478 Farey Sequence
- leetcode[Heaters]
- HDU6070 2017杭电多校联赛第四场-Dirt Ratio