| ENG RUS | Timus Online Judge |
Обсуждение задачи 1510. ПорядокDan.hu Heap solves all the problems!!! // Задача 1510. Порядок 3 фев 2007 11:13 KBTU_10 WA # 13. Need help [1] // Задача 1510. Порядок 8 дек 2006 09:47 I'm getting WA on 13th test. What's wrong with that test? I urgently need help. At least, I amnot getting TL. KBTU_10 Re: WA # 13. Need help // Задача 1510. Порядок 8 дек 2006 09:51 By the way, are there only 3 banknotes? Maybe test is not correct. And according to conditions of this problem, a number of some of them should be >= ( n / 2 ) if n = even; and > (n + 1) / 2 if n = odd. Is it right? lamer2 Crash [1] // Задача 1510. Порядок 7 дек 2006 13:08 I'm getting a Crash on test 2. What the hell is that test? Anyone knows? Plz help me... I could post my Java program. Alexander Sokolov [MAI] Re: Crash // Задача 1510. Порядок 7 дек 2006 23:08 try to use arrays some larger than the number of elements Alex_SyktSU Bug or something i can't understand [2] // Задача 1510. Порядок 6 ноя 2006 02:10 Code with this: for (int i=0; i<n; i++) { int t; scanf("%li", &t); ... gives wa1 Code with this: for (int i=0; i<n; i++) { int t; cin >> t; ... gives tl36. Help, please, if know what is the problem Anton [SUrSU] Re: Bug or something i can't understand [1] // Задача 1510. Порядок 6 ноя 2006 14:01 Use scanf("%d", &t). There is 32bit compilers. Alex_SyktSU Re: Bug or something i can't understand // Задача 1510. Порядок 6 ноя 2006 19:24 Tried, result is exactly the same: wa1 Ruslan Time Limit... [1] // Задача 1510. Порядок 5 ноя 2006 14:47 I use: 1)sort 2)count algorithm in the loop to get the number>N/2; that loop iterates each elem. of a container... How to avoid Time Limit..? Nechaev Ilya (Rybinsk SAAT) Re: Time Limit... // Задача 1510. Порядок 5 ноя 2006 15:25 I have three ideas: 1) Use fast sorting algorithm 2) Don't use containers. I don't like it because it is too hard to debug solutions while using it, and i think containers works slower. 3) Don't use sorting at all. Try to find O(N) algortihm. SPIRiT Did anyone solve this with mergesort on C++?(+) [1] // Задача 1510. Порядок 3 ноя 2006 16:15 I was getting WA for this task, when I used mergesort (and in other tasks too). But when I changed to binary heap sort, I got AC... Samsonov Alex [USU] Re: Did anyone solve this with mergesort on C++?(+) // Задача 1510. Порядок 3 ноя 2006 23:06 It seems that something is wrong with your mergesort. Certainly. What about problem 1090? HusanRustam 1510 // Задача 1510. Порядок 3 ноя 2006 19:00 what is the test 19? Alex Tyakunov Wazzup is WA by Test 9 [1] // Задача 1510. Порядок 3 ноя 2006 11:21 It's my program [code deleted] what??? Edited by moderator 29.12.2006 09:21 Anton [SUrSU] Re: Wazzup is WA by Test 9 // Задача 1510. Порядок 3 ноя 2006 11:48 If you correct all your bugs ur algo will get TL Intelligent_Design What's wrong with #6 test? [3] // Задача 1510. Порядок 30 окт 2006 01:25 Hey, I wrote this code, but it fails on the 6th test... What can be my error? [code deleted] Edited by moderator 29.12.2006 09:21 Sandro (USU) 6th test is correct. Test your code more carefully. (-) [2] // Задача 1510. Порядок 30 окт 2006 21:05 mai7 Re: 6th test is correct. Test your code more carefully. (-) [1] // Задача 1510. Порядок 1 ноя 2006 03:28 I don't know how I did it, I had same code and same was the trouble (WA 6)! I'd also taken into consideration the condition that more than half of numbers are equal. [code deleted] Edited by moderator 29.12.2006 09:21 Ilia S. Chm (Spb SU) Re: 6th test is correct. Test your code more carefully. (-) // Задача 1510. Порядок 3 ноя 2006 02:55 AC solution: use qsort(A) and then output A[n/2] Liceum#64_Yurik Why my program has WA on 1 test? [1] // Задача 1510. Порядок 29 окт 2006 14:33 my program has Wa on 1 test... [code deleted] Edited by moderator 29.12.2006 09:22 linuson Hints // Задача 1510. Порядок 29 окт 2006 16:17 if the answer is a0. delete a0 and a1 (a0!=a1) the answer is still a0 Edited by author 29.10.2006 16:21 deepesh red, green, and blue banknotes. [1] // Задача 1510. Порядок 29 окт 2006 12:44 Is only a maximum of 3 different varieties of bank notes possible? Nechaev Ilya (Rybinsk SAAT) Re: red, green, and blue banknotes. // Задача 1510. Порядок 29 окт 2006 14:46 I supposed that there are can be more than 3 banknote types and get AC. I think in both cases it is so easy. emotional blind Time Limit Exceeded [3] // Задача 1510. Порядок 28 окт 2006 17:38 What causes TLE #21 what is the trick? M@STeR.SoBG Re: Time Limit Exceeded [2] // Задача 1510. Порядок 29 окт 2006 12:47 I have the same problem. But I can't understand. Is such test correct? //-------------- 7 3 2 1 3 3 3 4 //-------------- I think it's wrong. Am I right? Anton [SUrSU] Re: Time Limit Exceeded // Задача 1510. Порядок 29 окт 2006 13:04 Use sort, then find longest sequence. Spieler (USU) Re: Time Limit Exceeded // Задача 1510. Порядок 29 окт 2006 14:01 It's correct. The answer is 3.
|