hdu 1209 Clock

传送门。

There is an analog clock with two hands: an hour hand and a minute hand. The two hands form an angle. The angle is measured as the smallest angle between the two hands. The angle between the two hands has a measure that is greater than or equal to 0 and less than or equal to 180 degrees.

Given a sequence of five distinct times written in the format hh : mm , where hh are two digits representing full hours (00 <= hh <= 23) and mm are two digits representing minutes (00 <= mm <= 59) , you are to write a program that finds the median, that is, the third element of the sorted sequence of times in a nondecreasing order of their associated angles. Ties are broken in such a way that an earlier time precedes a later time.

For example, suppose you are given a sequence (06:05, 07:10, 03:00, 21:00, 12:55) of times. Because the sorted sequence is (12:55, 03:00, 21:00, 06:05, 07:10), you are to report 21:00.

Input

The input consists of T test cases. The number of test cases (T) is given on the first line of the input file. Each test case is given on a single line, which contains a sequence of five distinct times, where times are given in the format hh : mm and are separated by a single space.

Output

Print exactly one line for each test case. The line is to contain the median in the format hh : mm of the times given. The following shows sample input and output for three test cases.

Sample Input

3
00:00 01:00 02:00 03:00 04:00
06:05 07:10 03:00 21:00 12:55
11:05 12:05 13:05 14:05 15:05

Sample Output

02:00
21:00
14:05

【题意】

多组样例，每组样例给你五个时间点，然后按照时针和分针的角度差排序，相同的按照时间排序。输出中间的时间点。

【分析】

直接模拟即可。

【代码】

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<map>
#include<time.h>
#include<bits/stdc++.h>
using namespace std;
struct p
{
    int hh,mm;
    double ang;
    void cal()
    {
        double a = hh*30+mm*0.5;
        if(a>360) a-=360;
        double b = mm*6;
        a = abs(a-b);
        ang = min(a,360-a);
    }
}t[10];
bool cmp(p a,p b)
{
    if(a.ang!=b.ang) return a.ang<b.ang;
    if(a.hh!=b.hh) return a.hh<b.hh;
    return a.mm<b.mm;
}

int main()
{
//    freopen("in.txt","r",stdin);
    int T;
    scanf("%d",&T);
    while(T--)
    {
        for(int i = 0;i<5;i++)
        {
            scanf("%d:%d",&t[i].hh,&t[i].mm);
            t[i].cal();
        }
        sort(t,t+5,cmp);
        printf("%02d:%02d\n",t[2].hh,t[2].mm);
    }
    return 0;
}