|
|
| Тема | Автор | Задача | Обновлено | Ответов |
|---|
| Страница 1 | | Why I always got WA on test 15?(+) | Sky | 1099. Work Scheduling | 14 май 2004 17:20 | 0 | | Hmm interesting.... | Ignas B. | 1099. Work Scheduling | 16 апр 2004 23:34 | 0 | | What is Flower Tree? any algo. else Maximum matching? | Aidin Nassiri | 1099. Work Scheduling | 7 апр 2004 00:27 | 0 | | I have created a especial test data which some bad "Flower Tree" algorithm can not pass easily. Would you like to test your programs with my test data? | xreborner | 1099. Work Scheduling | 28 июн 2004 15:32 | 1 | | Please, give me any hint to solve this problem! | Grebnov Ilya[ISPU] | 1099. Work Scheduling | 20 апр 2003 23:05 | 0 | | Please, give me any hint to solve this problem! | Grebnov Ilya[ISPU] | 1099. Work Scheduling | 17 апр 2003 22:12 | 0 | | The test data of URAL1099 is so weak that most programs which use BFS can easely pass. Would you like to test your programs with my own test datas? | xreborner | 1099. Work Scheduling | 7 ноя 2005 07:12 | 5 | | After 8h i got AC. I will post here some tests. Have a look. | Alexandru Mosoi | 1099. Work Scheduling | 3 авг 2003 17:12 | 1 | | hey world !! give some hints (what exactly are Flower Trees?) (thanks in advance) | Silviu Ganceanu | 1099. Work Scheduling | 19 мар 2003 02:54 | 0 | | AC! I love "Flower Tree". | samwang | 1099. Work Scheduling | 26 фев 2003 18:38 | 0 | | Help!I used blossom in my program but i get TLE. How to beat the time limit? | abc | 1099. Work Scheduling | 16 фев 2003 20:40 | 1 | | Could anybody help me to test your ACed program. My friend's ACed program can't get AC now, and...(See in) | Innovative Cat. | 1099. Work Scheduling | 10 янв 2003 17:08 | 3 | | Acc (+) | Petar Zhivkov Petrov | 1099. Work Scheduling | 8 окт 2002 16:00 | 1 | | Bipartite graph + Maximum Flow, i get WA, why??? (+) | Miguel Angel | 1099. Work Scheduling | 21 сен 2002 15:55 | 1 | | What is wrong in my program, I got WA. Please give me some test | Algorithmus_UA(algorithmus@univ.kiev.ua) | 1099. Work Scheduling | 20 июн 2002 12:48 | 1 | | Is there an algorithm of time complexity less than O(n^4)? | asif | 1099. Work Scheduling | 5 апр 2002 14:41 | 0 | Does anybody want to know the best algorithm for this problem.My program use only 0.03 sec to get accepted.
[ Страницы: 1, 2, 3 ] | Huang Yizheng | 1099. Work Scheduling | 2 май 2014 01:12 | 59 | | Please correct the mistake in the test-data! | RightAnswer | 1099. Work Scheduling | 14 авг 2001 08:11 | 0 | | 1099,Do we need blossoms? | Longman 2001 @Killer team ZJU | 1099. Work Scheduling | 4 июн 2001 19:50 | 2 | | 1099,Are we need blossoms? | Longman 2001 @Killer team ZJU | 1099. Work Scheduling | 3 июн 2001 14:46 | 0 |
Страницы: Следующая 3 2 1 |
|
|
