ural 1070. Local Time

1070. Local Time

Time limit: 1.0 second
Memory limit: 64 MB

Soon the USU team will go to Vancouver to participate in the final of the ACM International Collegiate Programming Contest. They will be to take four different planes (three changes on the way)!

By the way, our team plans to return from Vancouver, so the two-way tickets are bought. The departure time (local time of the airport of departure) and the time of the arrival (local time of the destination airport) are printed on the tickets.

For example, the departure at 15.42 and the arrival at 16.23, and a return flight departs at 08.10 and arrives at 17.51.

Your task is to help to our team to find out how much does the time of the first airport differs from the one of the second. It is known that time in different airports differs by an integer amount of hours. The time of flights there and back may differ from each other not more than by 10 minutes.

The duration of a flight doesn't exceed 6 hours. The difference between airport local times is not greater than 5 hours.

Input

There are two lines, each of them contains two numbers. The first line consists of the departure time and the arrival time of the flight there, the second one — the departure and the arrival times of the back flight. Numbers in the lines are separated with a space, an amount of minutes is separated from an amount of hours with a point.

Output

Your program should write a non-negative integer (without extra zeroes) that corresponds to the difference in time between the two airports.

Sample

input	output
23.42 00.39 08.10 17.11	4

Problem Author: Magaz Asanov & Stanislav Vasilyev
Problem Source: Ural State Univerisity Personal Contest Online February'2001 Students Session

Tags: none  (hide tags for unsolved problems)

Difficulty: 585

 

题意：从一个地方到另一个地方去，再回来，中间有间隔。

给出去的和回来的起飞时间，降落时间。

问时差。

分析：暴力枚举。

 /**
 Create By yzx - stupidboy
 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <cmath>
 #include <deque>
 #include <vector>
 #include <queue>
 #include <iostream>
 #include <algorithm>
 #include <map>
 #include <set>
 #include <ctime>
 #include <iomanip>
 using namespace std;
 typedef long long LL;
 typedef double DB;
 #define MIT (2147483647)
 #define INF (1000000001)
 #define MLL (1000000000000000001LL)
 #define sz(x) ((int) (x).size())
 #define clr(x, y) memset(x, y, sizeof(x))
 #define puf push_front
 #define pub push_back
 #define pof pop_front
 #define pob pop_back
 #define ft first
 #define sd second
 #define mk make_pair

 inline int Getint()
 {
     int Ret = ;
     char Ch = ' ';
     bool Flag = ;
     while(!(Ch >= '' && Ch <= ''))
     {
         if(Ch == '-') Flag ^= ;
         Ch = getchar();
     }
     while(Ch >= '' && Ch <= '')
     {
         Ret = Ret *  + Ch - '';
         Ch = getchar();
     }
     return Flag ? -Ret : Ret;
 }

 const int DAY =  * , MAXFLIGHT =  * , MAXDELTA =  * ;
 int b1, e1, b2, e2;

 inline int GetTime()
 {
     int x = Getint();
     int y = Getint();
     return x *  + y;
 }

 inline void Input()
 {
     b1 = GetTime();
     e1 = GetTime();
     b2 = GetTime();
     e2 = GetTime();
 }

 inline void Solve()
 {
     int ans = -INF;
     for(int flight = ; flight <= MAXFLIGHT; flight++)
     {
         for(int delay = -MAXDELTA; delay <= MAXDELTA; delay++)
         {
             int x = b1;
             x = x + flight - delay;
             x = ((x % DAY) + DAY) % DAY;
             if(x != e1) continue;

             x = b2;
             x = x + delay;
             int left = x + flight - , right = x + flight + ;
             left = ((left % DAY) + DAY) % DAY;
             right = ((right % DAY) + DAY) % DAY;
             if(!(left <= e2 && e2 <= right)) continue;

             ans = delay;
             break;
         }
         if(ans != -INF) break;
     }

     printf("%.0lf\n", abs(ans) / 60.0);
 }

 int main()
 {
     freopen("a.in", "r", stdin);
     Input();
     Solve();
     return ;
 }