11958 - Coming Home

truewt · Post by **truewt** » Thu Apr 14, 2011 9:37 am

Thanks AC!

Can anybody help? I am getting WA for this simple problem.. Or is this as simple as I thought it to be??

asif_iut · Post by **asif_iut** » Fri Apr 15, 2011 4:55 pm

your code fails for the following test case:

1 20:00
19:00 60

the correct output is 1440 mins ( 23 hrs till the bus comes and another 60 mins for travelling )

hope it helps

truewt · Post by **truewt** » Sun Apr 17, 2011 9:43 am

Thanks for the help! I wasn't expecting the case when it goes on to the next day... tricky!

Anm Arif · Post by **Anm Arif** » Wed Jul 06, 2011 10:56 am

Code: Select all

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
	double i,j,k,h1,D,A,m1,X,d1,l,t,H,M,g;
	char ch;
	cin>>t;
	if(t>0 && t<=100)
	{
		for(i=1;i<=t;i++)
		{
			cin>>k>>H>>ch>>M;
			if(k>=1 && k<=100 && H>=0 && H<=23 && M>=0 && M<=59)
			{
				for(l=0;l<k;l++)
				{
					cin>>h1>>ch>>m1>>d1;
					if(h1>=0 && h1<=23 && m1>=0 && m1<=59 && d1>=0 && d1<=1000)
					{
						if(m1>=M)
						{
							X=m1-M;
							if(h1>=H)
							{
								A=h1-H;
								A=A*60;
							}
							else
							{
								h1=h1+24;
								A=h1-H;
								A=A*60;
							}
							D=X+A+d1;
						}
						else
						{
							m1=m1+60;
							H++;
							X=m1-M;
							if(h1>=H)
							{
								A=h1-H;
								A=A*60;
							}
							else
							{
								h1=h1+24;
								A=h1-H;
								A=A*60;
							}
							D=X+A+d1;
						}
						if(l==0)
							g=D;
						if(l!=0 && D<g)
							g=D;
					}
				}
				cout<<"Case "<<i<<": "<<g<<endl;
			}
		}
	}
	return 0;
}

john_cu_cse · Post by **john_cu_cse** » Fri Jul 15, 2011 10:54 am

#include<stdio.h>
int main()
{
int a,b,c,d,e,f,g,h,k,dif,T,i,j;
char z;
scanf("%d",&T);
for(i=1;i<=T;i++)
{
scanf("%d%d%c%d",&a,&b,&z,&c);
g=b*60+c;
for(j=1;j<=a;j++)
{
scanf("%d%c%d%d",&d,&z,&e,&f);
if(j==a)
{
h=d*60+e;
dif=h-g+f;
if(d<=b)
{
k=24*60-g;
dif=d*60+e+k+f;
}
printf("Case %d: %d\n",i,dif);
}
}
}
return 0;
}
always found wrong answer...whats wrong in my code..

naseef_07cuet · Post by **naseef_07cuet** » Thu Jul 21, 2011 7:36 am

Its an easy problem....you can think in much simpler way....only tricky case is the bus might be in the next day....

Happy coding...

MarcoL · Post by **MarcoL** » Fri Feb 10, 2012 2:10 pm

How is the simpler way to think of it naseef?

EasterSudharta · Post by **EasterSudharta** » Tue Feb 21, 2012 7:44 am

I was simple than i thought it should be.

Nafis0001 · Post by **Nafis0001** » Fri Mar 23, 2012 10:28 pm

why wrong ans????Help!!!

#include<stdio.h>
int main()
{int n,a[105],b[105],c,d,i,j,k,f,h,g;char p,q;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d%d:%d",&k,&c,&f);
for(j=1;j<=k;j++)
scanf("%d:%d%d",&a[j],&b[j],&d);h=0;
for(j=1;j<=k;j++)
{if(a[j]<c)
a[j]=a[j]+24;
g=((a[j]*60+b[j])-(c*60+f));
g=g+d;
if(g>h)
h=g;}
printf("Case %d: %d\n",i,h);}
return 0;}

brianfry713 · Post by **brianfry713** » Wed Mar 28, 2012 12:00 am

Try the input in the second post of this thread.

shondhi · Post by **shondhi** » Fri Apr 12, 2013 4:23 pm

Code: Select all

Got AC

brianfry713 · Post by **brianfry713** » Sat Apr 13, 2013 2:04 am

See:http://acm.uva.es/board/viewtopic.php?t=53824

Try input:

Code: Select all

AC output:

Code: Select all

Case 1: 595
Case 2: 562
Case 3: 402
Case 4: 644
Case 5: 418
Case 6: 381
Case 7: 494
Case 8: 176
Case 9: 223
Case 10: 482
Case 11: 643
Case 12: 350
Case 13: 604
Case 14: 817
Case 15: 633
Case 16: 396
Case 17: 219
Case 18: 186
Case 19: 299
Case 20: 316
Case 21: 500
Case 22: 369
Case 23: 169
Case 24: 563
Case 25: 658
Case 26: 495
Case 27: 1079
Case 28: 819
Case 29: 520
Case 30: 285
Case 31: 515
Case 32: 469
Case 33: 640
Case 34: 400
Case 35: 500
Case 36: 565
Case 37: 590
Case 38: 932
Case 39: 1037
Case 40: 430
Case 41: 464
Case 42: 563
Case 43: 278
Case 44: 142
Case 45: 296
Case 46: 208
Case 47: 392
Case 48: 603
Case 49: 527
Case 50: 156
Case 51: 648
Case 52: 254
Case 53: 499
Case 54: 404
Case 55: 536
Case 56: 823
Case 57: 282
Case 58: 781
Case 59: 404
Case 60: 152
Case 61: 802
Case 62: 192
Case 63: 375
Case 64: 642
Case 65: 61
Case 66: 771
Case 67: 557
Case 68: 175
Case 69: 491
Case 70: 1278
Case 71: 447
Case 72: 930
Case 73: 644
Case 74: 322
Case 75: 588
Case 76: 684
Case 77: 536
Case 78: 589
Case 79: 923
Case 80: 369
Case 81: 816
Case 82: 361
Case 83: 653
Case 84: 420
Case 85: 764
Case 86: 188
Case 87: 320
Case 88: 516
Case 89: 10
Case 90: 426
Case 91: 333
Case 92: 957
Case 93: 334
Case 94: 848
Case 95: 1241
Case 96: 179
Case 97: 131
Case 98: 1038
Case 99: 215
Case 100: 163

shondhi · Post by **shondhi** » Sat Apr 13, 2013 6:05 pm

Thanks Brian Fry. Got AC!!

mahbubcseju · Post by **mahbubcseju** » Fri Apr 26, 2013 7:52 pm

#include<stdio.h>
int main()
{
int c,t,i,j,h1,h2,m1,m2,bus,nt,time,ti,minimal;
while(scanf("%d",&c)!=EOF)
{for(j=1;j<=c;j++){
minimal=1440;

scanf("%d",&bus);
scanf("%d:%d",&h1,&m1);
t=60*h1+m1;
for(i=1; i<=bus; i++)
{
scanf("%d:%d",&h2,&m2);
scanf("%d",&nt);
if(h2<h1){h2=24+h2;}
else if(h1==h2&&m2<m1){h2=h2+24;}
time=h2*60+m2+nt;

ti=time-t;

if(minimal>ti)
{
minimal=ti;
}

}printf("Case %d: %d\n",j,minimal);

}
}

return 0;
}
where is my wrong in this code

brianfry713 · Post by **brianfry713** » Sat Apr 27, 2013 2:02 am

Input:

Code: Select all

AC output:

Code: Select all

Case 1: 472
Case 2: 186
Case 3: 457
Case 4: 1100
Case 5: 475
Case 6: 946
Case 7: 220
Case 8: 933
Case 9: 578
Case 10: 123
Case 11: 82
Case 12: 355
Case 13: 252
Case 14: 1632
Case 15: 524
Case 16: 288
Case 17: 889
Case 18: 691
Case 19: 489
Case 20: 144
Case 21: 613
Case 22: 250
Case 23: 602
Case 24: 801
Case 25: 86
Case 26: 318
Case 27: 138
Case 28: 620
Case 29: 1034
Case 30: 331
Case 31: 485
Case 32: 766
Case 33: 409
Case 34: 331
Case 35: 184
Case 36: 1144
Case 37: 745
Case 38: 688
Case 39: 717
Case 40: 350
Case 41: 486
Case 42: 533
Case 43: 317
Case 44: 1099
Case 45: 1815
Case 46: 508
Case 47: 1390
Case 48: 328
Case 49: 805
Case 50: 331
Case 51: 1814
Case 52: 523
Case 53: 502
Case 54: 1219
Case 55: 163
Case 56: 287
Case 57: 847
Case 58: 55
Case 59: 1468
Case 60: 127
Case 61: 92
Case 62: 292
Case 63: 211
Case 64: 161
Case 65: 624
Case 66: 417
Case 67: 429
Case 68: 713
Case 69: 184
Case 70: 443
Case 71: 493
Case 72: 165
Case 73: 479
Case 74: 371
Case 75: 979
Case 76: 225
Case 77: 323
Case 78: 439
Case 79: 453
Case 80: 611
Case 81: 1272
Case 82: 259
Case 83: 79
Case 84: 718
Case 85: 910
Case 86: 353
Case 87: 646
Case 88: 691
Case 89: 524
Case 90: 258
Case 91: 607
Case 92: 608
Case 93: 369
Case 94: 678
Case 95: 325
Case 96: 297
Case 97: 261
Case 98: 389
Case 99: 745
Case 100: 436

OJ Board