How convex hull and SAT algorithms will be useful in details below? -


in two-ball game, n > 4 kickers positioned on playing field , not move (i.e.\ change locations) during game. 4 of players distinguished: 2 of them, denoted s1 , s2, called starting players, , 2 others, denoted t1 , t2, called terminal players. @ beginning, player s1 has got white ball , s2 possesses black ball. each starting player can kick ball directly corresponding terminal player can kick ball other player on field , player can pass ball next one, , on. aim @ end white ball in possession of t1 , black ball in possession of t2. so, seems game quite simple. however, avoid ball collisions, constraint of game no ball trajectories cross each other , no player (including starting , terminal ones) has more 1 ball contact. simplicity, assume trajectory of ball moving 1 player next 1 line segment.

note:this problem on spoj , need suggestions algorithm required solve efficiently , why required.link problem spoj tbgame question


Comments

Popular posts from this blog

html - Outlook 2010 Anchor (url/address/link) -

javascript - Why does running this loop 9 times take 100x longer than running it 8 times? -

Getting gateway time-out Rails app with Nginx + Puma running on Digital Ocean -