|
|
| Show all threads Hide all threads Show all messages Hide all messages | | What's the loser's purpose? | Ade | 1397. Points Game | 19 Feb 2023 13:59 | 1 | I got a question about the problem description.
In other games, the losers hope to last the game longer for as many turns/rounds/moves as possible.
In this game, is the losers' optimal move to
(1) to minimize the difference,
(2) to maximize theirselves' scores, or
(3) to minimize the opponents' scores?
Or are the 3 goals lead to the same move?
Thanks. | | Bad interpretation | hmcab | 1397. Points Game | 4 Jul 2019 18:44 | 1 | Why the second difference is 1.937 and no 2.000? | | python - runtime error test 1 | Kostya | 1397. Points Game | 30 Jan 2016 01:44 | 1 | u menja uzhe gorit
proboval ispravit' vse - ne pomogaet
zada4a to4no rewaetsja na pyhon? | | primeri | jjsdjfsdjfks | 1397. Points Game | 25 Nov 2014 16:00 | 1 | primeri jjsdjfsdjfks 25 Nov 2014 16:00 plz daite neskolko primerov | | what does this mean? | S.Hidayet [Qafqaz U.] | 1397. Points Game | 9 Jun 2010 20:35 | 2 | The first student makes odd moves, second student makes even moves. 1st student makes 1st move, the second one makes 2nd move, then first strudent makes third move and so on. | | Was happy to solve, but much interesting understanding why it'is right. [-] | Chmel_Tolstiy | 1397. Points Game | 6 Jul 2008 02:24 | 1 | | | To admins: Time Limit in Java | crdp | 1397. Points Game | 20 Sep 2007 15:17 | 4 | I have sent two solutions: one in Java, one in Pascal.
Java solution is more efficiently.
But Java solution got TL1, and Pascal solution got AC.
For optimization, i killed making instances of all classes in Java, but still TL1.
Can You change java time limit for this problem? There is no possibility to set different TL for different languages in Timus Online Judge. Your Java solution works more than 5 seconds on 1st test. Write more effective solution. By the way, try to avoid Math.hypot in your program; sqrt works faster. Thanks. But I think, that this situation is unfair for Java-programmers. Change Math.hypot to Math.sqrt and you'll get 20x acceleration! Solution will work even faster than your pascal solution.
So, this problem can be solved in Java with the same algorithm. | | N^2 * <test cases>? it tl #1? why? | EfremovAleksei | 1397. Points Game | 11 Mar 2007 14:41 | 3 | I find little bug in your old post
const NMAX=510;)
Edited by author 11.03.2007 01:56 | | any ideas? | Sid | 1397. Points Game | 26 Sep 2006 20:04 | 2 | It was the same task on previos CBOSS contest. Does anybody knows how to solve it. Yeah... CBOSS first contest was based on tasks from Ukrainian ACM.
Hint: Look at some greedy algo. | | NEW PROBLEM 1397 “Points game” has been added. (-) | Vladimir Yakovlev (USU) | 1397. Points Game | 23 Sep 2006 02:18 | 1 | |
|
|
|
