| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| AC! I love "Flower Tree". | samwang | 1099. Work Scheduling | 26 фев 2003 18:38 | 1 |
|
| 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 | 2 |
|
| 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 | 4 |
I wrote a program, and I also can't get AC, I have tested 4
days, but still...... I have written to the author, but no
reply..... [deleted by moderator]
Edited by moderator 11.04.2004 01:53 >
> [deleted by moderator]
Edited by moderator 11.04.2004 01:53 Because the judger use something like "fc" in dos, to
compare your output and right output directly.......
I tried to change "for u:=1 to n do" to "for u:=n downto 1
do", and a ACed program get WA....... So you'd better ask a
ACed person for program.......... |
| Acc (+) | Petar Zhivkov Petrov | 1099. Work Scheduling | 8 окт 2002 16:00 | 2 |
Acc (+) Petar Zhivkov Petrov 21 сен 2002 20:10 I got accepted, but I'm sure there exists a test, which my solution
will fail to solve. My solution is nothing but hungarian algo (
bipartite version ), but it passes the tests because of some greedies
assisting with it. It would be nice to code the real algo some day (
it seems pretty sophisticated :).
pesho > I got accepted, but I'm sure there exists a test, which my
solution
> will fail to solve. My solution is nothing but hungarian algo (
> bipartite version ), but it passes the tests because of some
greedies
> assisting with it. It would be nice to code the real algo some day
(
> it seems pretty sophisticated :).
>
> pesho |
| Bipartite graph + Maximum Flow, i get WA, why??? (+) | Miguel Angel | 1099. Work Scheduling | 21 сен 2002 15:55 | 2 |
[deleted by moderator]
Edited by moderator 11.04.2004 01:52 |
| 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 | 2 |
[deleted by moderator]
Edited by moderator 11.04.2004 01:52 This is general graph matching, and you cannot find augmenting path
in such way, that you use in bipartite graph matching. |
| Is there an algorithm of time complexity less than O(n^4)? | asif | 1099. Work Scheduling | 5 апр 2002 14:41 | 1 |
Is there an algorithm of time complexity less than O(n^4)? Edmond's
blossom algorithm with adjacency matrix of time complexity O(n^4)
gets TLE. |
| Please correct the mistake in the test-data! | RightAnswer | 1099. Work Scheduling | 14 авг 2001 08:11 | 1 |
There are two equal numbers in a line,
but this should not appear according to the problem. |
| 1099,Do we need blossoms? | Longman 2001 @Killer team ZJU | 1099. Work Scheduling | 4 июн 2001 19:50 | 3 |
I've used the algorithm for bipartite graph to this
problem,and it got WA.So i refer to some graph theory
book,it says that we must handle blossoms,but it did not
say why this!From my test data the bipartite graph
algorithm works fine!Can anybody explain this to me?Or give
out some counter examples that the bipartite graph
algorithm fails... I asked about this problem. There are some "flowers" things
that make the bipartite algorithm to fail. IT's based on
a true theorem, but the DFS fails. However, I do the
following thing - DFS, but observse the edges in random
way, not for(i=1;i<=n;i++) and things like that but a
permutation.
Damn, i think my English is not good :))) I have generated case(not randomly) where your solution
fails. But it is not uploaded, expect rejudge. |
| 1099,Are we need blossoms? | Longman 2001 @Killer team ZJU | 1099. Work Scheduling | 3 июн 2001 14:46 | 1 |
I've used the algorithm for bipartite graph to this
problem,and it got WA.So i refer to some graph theory
book,it says that we must handle blossoms,but it did not
say why this!From my test data the bipartite graph
algorithm works fine!Can anybody explain this to me?Or give
out some counter examples that the bipartite graph
algorithm fails... |
