1、TopcoderSRM438I【時空限制2【問題描述N M T1 TopcoderSRM438I【時空限制2【問題描述N M T1 【數據規(guī)模和約定N,【試】 【算法描述二【算法描述二【其他算法【實現情況【感謝【附錄ProblemFeudalias military is preparinga preemptive strike against Bananias military installations. Feudalia has number of missile silos. Each silo has an unlimited number of missiles at its al

2、, an only fire singlemissileime.Whenamissileisfired,itrequires takeOffTimesecondsbeforeitcantakeo its silo. Once itnumber of missile silos. Each silo has an unlimited number of missiles at its al, an only fire singlemissileime.Whenamissileisfired,itrequires takeOffTimesecondsbeforeitcantakeo its sil

3、o. Once it takes off, it requires distance/missileSpeed minutes to reach , where distance the Euclidean distance n the silo and . When the missile reaches , instantlydestroyed.Afteramissiletakesoff,itssilorequiresrechargeTimeminutesofpreparationbeforecanlaunchanotherTeralhas ordered you todestroyall

4、 of Bananias militarybases in as little time sible.Yous siloX, siloY, baseX and baseY which determine the locations of the missile silos and Feudalias i-th missile silo is located at (siloXi, siloYi) and Bananias j-th base is located at baseYj).Returntheminimuminutesrequiredtodestroyallenemydoublege

5、tMinimumTime( (besureyourmethodis- Thereturnedvaluemustbeaccuratetowithinarelativeorabsolutevalueof1E-s-takeOffTimewillberechargeTimewillben1and60,n5and1000,-missileSpeedwillbebaseXwillcontainbaseYwillhen1and2000,n 1 and 50 elements, inclusive. mberofelementsasbaseX.siloXwillcontainn1and50elements,-

6、siloYwillhemberofelementsas EachelementofbaseX,baseY,siloXandsiloYwill-siloYwillhemberofelementsas EachelementofbaseX,baseY,siloXandsiloYwillbeThelocationsforeachbaseandsilowillben0and1000000,1Returns:Anoptimalstrategywould00:00:Thesiloat(50,50)launchesanattackagainstthebaseat00:30:missilefinishesta

7、king20:30:Thesiloat(50,50)launchesitssecondmissile,thistimeagainstthebaseat21:00:Thesecondmissilefinishestaking41:30:Thesiloat(50,50)launchesitsthirdmissile,thistimeagainstthebaseat71:00:Thesecondmissilehitsthebaseat(0,50)(Thedistancewas71:12.6(Approx.):missilehitsthebaseat(0,0)(Thedistancewas91:30:

8、Thethirdmissilehitstheremaining1Returns:Since itnowtakes15hoursto prepareanew missile,usingthesame siloagainstthethreeenemy1Returns:Since itnowtakes15hoursto prepareanew missile,usingthesame siloagainstthethreeenemyis no longer the optimal strategy. Instead, each of the silos at (0,1000) and (1000,0) closestbasewhilethesiloatsthebaseatReturns:Returns:ThisproblemementistheexclusiveandproprietarypropertyofTopCoder,