|
|
Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | WA9 | Happyfeet | 1641. Дежурства | 28 сен 2019 16:11 | 2 | WA9 Happyfeet 11 апр 2011 10:49 I've implemented this problem two different ways and I have WA9 on both of them. I'm possibly interpreting the problem wrong, but I've read the problem over and over again and I cannot come up with an alternative interpretation. Can someone please shine some light? Если у кого ещё такая проблема есть, то это,как вариант, связано с нечетным n (последний человек ни разу не дежурит) | wa#12 | twocoldz | 1641. Дежурства | 24 июн 2015 14:07 | 1 | wa#12 twocoldz 24 июн 2015 14:07 i try use hungary to get some line use more student,than try the no use student,but wa on #12,pls help me! | ToAdmin-WA#7 | REVERSER | 1641. Дежурства | 24 янв 2015 23:54 | 1 | hi i tougth my code is correct,but it wrong on test7,plz give me a test case 7 ty | WA #1 | beginner1010 | 1641. Дежурства | 29 ноя 2013 06:10 | 3 | WA #1 beginner1010 8 июл 2011 13:30 that's so strange I`m getting WA on test 1 my code prints for sample input #1 1 2 3 1 2 1 2 1 3 1 5 2 3 and for second : 1 2 1 2 1 2 1 4 2 3 3 4 please help me ! thank you Accepted after reread the problem statement problem says : "Each student is assigned one classroom he is responsible for" My output was wrong for test #1 Re: WA #1 Spatarel Dan Constantin 29 ноя 2013 06:10 In your output for sample #1 student no. 4 is never on duty! "Each of the students should be on duty at least once during these [m] days." | 2 admins | Birne Ageev [USU] | 1641. Дежурства | 12 июл 2012 00:58 | 4 | 2 admins Birne Ageev [USU] 11 июл 2012 19:47 Try to fix checker, please. It's possible, that some programs output more than m pairs but got AC. Why do you think so? Do you have AC program that outputs more than m pairs? Yes. Now my last submit output... about 50 pairs on test 100 3 4. But test 100 3 4 is incorrect, because there is no correct plan of the duties for it. | wa43? | mikewu | 1641. Дежурства | 7 апр 2011 09:19 | 1 | wa43? mikewu 7 апр 2011 09:19 could you test it again? i've no idea whats wrong | 2 admins. | ftc | 1641. Дежурства | 17 ноя 2009 17:14 | 3 | Could you please verify test #5 and my program's output on it? I'm checking everything inside my program and it does not get OLE, but still it gets WA#5. Thanks. Now i've found my mistake. | Very, very easy problem... | Elisabeth | 1641. Дежурства | 18 окт 2009 18:13 | 1 | My AC: 0.015 121KB Try greedy ! | Nothing here (-) | Alexander Kouprin | 1641. Дежурства | 15 окт 2009 20:35 | 3 | Edited by author 29.10.2008 10:05 You are mistaken removing your message. I think that the problem is difficult, many solvers used random searh and brute forse and with n->1000 number of have solved will -> 10-30 So talk about algo was helpfull. I don't think this task will be that difficult... I do it in o ( n ^ 2 ) and it's not that hard and i thing i can do it n logn with some optimizations... | what is the maximum value of m? | partisan (Andrey Korotkov) | 1641. Дежурства | 25 окт 2008 20:05 | 2 | |
|
|
|