2017多校联合四1011/hdu6077Time To Get Up(模拟)
来源:互联网 发布:淘宝会员怎么注册 编辑:程序博客网 时间:2024/06/15 09:37
Time To Get Up
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 235 Accepted Submission(s): 193
Problem DescriptionLittle 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.
InputThe first line of the input contains an integer T(1≤T≤1440) , denoting the number of test cases.
In each test case, there is an 7×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.
OutputFor 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 Input1.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 Output02:38
Source2017 Multi-University Training Contest - Team 4
Recommendliuyiding | We have carefully selected several similar problems for you: 6079 6078 6077 6076 6075
Statistic | Submit | Discuss | Note
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.
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.
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.
02:38
题意:就是一个简单的模拟,队友写的时候不小心干到八百多行了,把我吓坏了,然后我又重新写了一个。
#include <iostream>#include <algorithm>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <string.h>#include <map>#include <set>#include <queue>#include <deque>#include <list>#include <bitset>#include <stack>#include <stdlib.h>#define lowbit(x) (x&-x)#define e exp(1.0)//ios::sync_with_stdio(false);// auto start = clock();// cout << (clock() - start) / (double)CLOCKS_PER_SEC;typedef long long ll;typedef long long LL;using namespace std;string s[7];int main(){ int T; cin>>T; int a,b,c,d; while(T--) { for(int i=0;i<7;i++) cin>>s[i];//&& s[][]=='X' if(s[0][1]=='X'&&s[1][0]=='X'&& s[1][3]=='X'&& s[3][1]=='.'&& s[4][0]=='X'&& s[4][3]=='X'&& s[6][1]=='X')a=0; else if(s[0][1]=='.'&&s[1][0]=='.'&& s[1][3]=='X'&& s[3][1]=='.'&& s[4][0]=='.'&& s[4][3]=='X'&& s[6][1]=='.')a=1; else a=2; if(s[0][6]=='X'&&s[1][5]=='X'&& s[1][8]=='X'&& s[3][6]=='.'&& s[4][5]=='X'&& s[4][8]=='X'&& s[6][6]=='X')b=0; else if(s[0][6]=='.'&&s[1][5]=='.'&& s[1][8]=='X'&& s[3][6]=='.'&& s[4][5]=='.'&& s[4][8]=='X'&& s[6][6]=='.')b=1; else if(s[0][6]=='X'&&s[1][5]=='.'&& s[1][8]=='X'&& s[3][6]=='X'&& s[4][5]=='X'&& s[4][8]=='.'&& s[6][6]=='X')b=2; else if(s[0][6]=='X'&&s[1][5]=='.'&& s[1][8]=='X'&& s[3][6]=='X'&& s[4][5]=='.'&& s[4][8]=='X'&& s[6][6]=='X')b=3; else if(s[0][6]=='.'&&s[1][5]=='X'&& s[1][8]=='X'&& s[3][6]=='X'&& s[4][5]=='.'&& s[4][8]=='X'&& s[6][6]=='.')b=4; else if(s[0][6]=='X'&&s[1][5]=='X'&& s[1][8]=='.'&& s[3][6]=='X'&& s[4][5]=='.'&& s[4][8]=='X'&& s[6][6]=='X')b=5; else if(s[0][6]=='X'&&s[1][5]=='X'&& s[1][8]=='.'&& s[3][6]=='X'&& s[4][5]=='X'&& s[4][8]=='X'&& s[6][6]=='X')b=6; else if(s[0][6]=='X'&&s[1][5]=='.'&& s[1][8]=='X'&& s[3][6]=='.'&& s[4][5]=='.'&& s[4][8]=='X'&& s[6][6]=='.')b=7; else if(s[0][6]=='X'&&s[1][5]=='X'&& s[1][8]=='X'&& s[3][6]=='X'&& s[4][5]=='X'&& s[4][8]=='X'&& s[6][6]=='X')b=8; else b=9; if(s[0][13]=='X'&&s[1][12]=='X'&& s[1][15]=='X'&& s[3][13]=='.'&& s[4][12]=='X'&& s[4][15]=='X'&& s[6][13]=='X')c=0; else if(s[0][13]=='.'&&s[1][12]=='.'&& s[1][15]=='X'&& s[3][13]=='.'&& s[4][12]=='.'&& s[4][15]=='X'&& s[6][13]=='.')c=1; else if(s[0][13]=='X'&&s[1][12]=='.'&& s[1][15]=='X'&& s[3][13]=='X'&& s[4][12]=='X'&& s[4][15]=='.'&& s[6][13]=='X')c=2; else if(s[0][13]=='X'&&s[1][12]=='.'&& s[1][15]=='X'&& s[3][13]=='X'&& s[4][12]=='.'&& s[4][15]=='X'&& s[6][13]=='X')c=3; else if(s[0][13]=='.'&&s[1][12]=='X'&& s[1][15]=='X'&& s[3][13]=='X'&& s[4][12]=='.'&& s[4][15]=='X'&& s[6][13]=='.')c=4; else if(s[0][13]=='X'&&s[1][12]=='X'&& s[1][15]=='.'&& s[3][13]=='X'&& s[4][12]=='.'&& s[4][15]=='X'&& s[6][13]=='X')c=5; else c=6; if(s[0][18]=='X'&&s[1][17]=='X'&& s[1][20]=='X'&& s[3][18]=='.'&& s[4][17]=='X'&& s[4][20]=='X'&& s[6][18]=='X')d=0; else if(s[0][18]=='.'&&s[1][17]=='.'&& s[1][20]=='X'&& s[3][18]=='.'&& s[4][17]=='.'&& s[4][20]=='X'&& s[6][18]=='.')d=1; else if(s[0][18]=='X'&&s[1][17]=='.'&& s[1][20]=='X'&& s[3][18]=='X'&& s[4][17]=='X'&& s[4][20]=='.'&& s[6][18]=='X')d=2; else if(s[0][18]=='X'&&s[1][17]=='.'&& s[1][20]=='X'&& s[3][18]=='X'&& s[4][17]=='.'&& s[4][20]=='X'&& s[6][18]=='X')d=3; else if(s[0][18]=='.'&&s[1][17]=='X'&& s[1][20]=='X'&& s[3][18]=='X'&& s[4][17]=='.'&& s[4][20]=='X'&& s[6][18]=='.')d=4; else if(s[0][18]=='X'&&s[1][17]=='X'&& s[1][20]=='.'&& s[3][18]=='X'&& s[4][17]=='.'&& s[4][20]=='X'&& s[6][18]=='X')d=5; else if(s[0][18]=='X'&&s[1][17]=='X'&& s[1][20]=='.'&& s[3][18]=='X'&& s[4][17]=='X'&& s[4][20]=='X'&& s[6][18]=='X')d=6; else if(s[0][18]=='X'&&s[1][17]=='.'&& s[1][20]=='X'&& s[3][18]=='.'&& s[4][17]=='.'&& s[4][20]=='X'&& s[6][18]=='.')d=7; else if(s[0][18]=='X'&&s[1][17]=='X'&& s[1][20]=='X'&& s[3][18]=='X'&& s[4][17]=='X'&& s[4][20]=='X'&& s[6][18]=='X')d=8; else d=9; cout<<a<<b<<':'<<c<<d<<endl; } return 0;}
阅读全文
0 0
- 2017多校联合四1011/hdu6077Time To Get Up(模拟)
- HDU6077Time To Get Up(模拟)
- hdu6077Time To Get Up(高校第四场模拟)
- 2017杭电多校第四场 1011 Time To Get Up(模拟)HDU 6077
- HDU6077 Time To Get Up(模拟,2017 HDU多校联赛 第4场)
- (hdu6077)2017杭电多校联赛第四场-Time To Get Up 模拟题
- HDU 6077 Time To Get Up 模拟
- HDU 2017 多校联赛4 1011 Time To Get Up
- HDU 6077 Time To Get Up【模拟题】【水题】
- hdu 6077 Time To Get Up(简单模拟)
- 2017多校4 1011 Time To Get Up
- hdu 多校联赛 Time To Get Up
- Hdu6077 Time To Get Up(2017多校第4场)
- 2017多校训练Contest4: 1011 Time To Get Up hdu6077
- HDU 6077 Time To Get Up -暴力枚举-2017多校联盟4 第11题
- Time To Get Up(枚举)
- Time To Get Up
- Time To Get Up
- linux 配置网络
- java 多态
- 策略模式(Strategy Pattern)
- ConcurrentHashMap实现原理
- 【Java编程】编写一个计算N个整数平均值的程序
- 2017多校联合四1011/hdu6077Time To Get Up(模拟)
- Fence Repair-OJ
- union
- Impala 2、Impala Shell 和 Impala SQL
- sketchup/su模型导入到Unity3D
- Aladdin and the Flying Carpet LightOJ
- Impala 1、Impala理论
- 记一次脑残的入手nexus 5x
- HDU1863-畅通工程