UVa : 11958 (Coming Home)



// http://uva.onlinejudge.org/external/119/11958.html
// Runtime: 0.012s
// Tag: Adhoc, time

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000005
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

int dr [] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc [] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;

int convertToMinute (char *ch)
{
    int hr = (ch [0] - '0') * 10 + (ch [1] - '0');
    int min = (ch [3] - '0') * 10 + (ch [4] - '0');

    return hr * 60 + min;
}

int main ()
{
    int testCase; scanf ("%d", &testCase);
    int cases = 0;

    while ( testCase-- ) {
        int numOfBuses; scanf ("%d", &numOfBuses);
        char ch [20]; scanf ("%s", ch);

        int currTime = convertToMinute (ch);
        int minTime = INF_MAX;

        for ( int i = 0; i < numOfBuses; i++ ) {
            scanf ("%s", ch);
            int arrivalTime = convertToMinute (ch);

            if ( arrivalTime < currTime ) arrivalTime += 1440;

            int travelTime; scanf ("%d", &travelTime);
            int reachTime = arrivalTime + travelTime;

            if ( reachTime - currTime < minTime ) minTime = reachTime - currTime;
        }

        printf ("Case %d: %d\n", ++cases, minTime);

    }

	return 0;
}

// @END_OF_SOURCE_CODE

2 thoughts on “UVa : 11958 (Coming Home)

  1. in c my code is:

    #include
    int main()

    {
    int i,t,j,a,b,min,c,reach,arri,m,n,o,curr;
    char ch;
    scanf(“%d”,&t);
    for(j=1;j<=t;j++)
    {
    scanf("%d",&a);
    scanf("%d%c%d",&b,&ch,&c);
    curr=b*60+c;
    min=1000000;
    for( i=1;i<=a;i++)
    {
    scanf("%d%c%d %d",&m,&ch,&n,&o);
    arri=m*60+n;
    if(arri<curr) arri+=1440;
    reach=arri+o;
    if(reach-curr<min) min=reach-curr;
    }
    printf("Case %d: %d\n",j,min);
    }
    return 0;
    }

  2. In c:

    #include
    int main()

    {
    int i,t,j,a,b,min,c,reach,arri,m,n,o,curr;
    char ch;
    scanf(“%d”,&t);
    for(j=1;j<=t;j++)
    {
    scanf("%d",&a);
    scanf("%d%c%d",&b,&ch,&c);
    curr=b*60+c;
    min=1000000;
    for( i=1;i<=a;i++)
    {
    scanf("%d%c%d %d",&m,&ch,&n,&o);
    arri=m*60+n;
    if(arri<curr) arri+=1440;
    reach=arri+o;
    if(reach-curr<min) min=reach-curr;
    }
    printf("Case %d%c %d\n",j,ch,min);
    }
    return 0;
    }

    RT:0.008

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s