Обсуждение @ 1099. Work Scheduling @ Timus Online Judge

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 7 апр 2003 19:22

Test Data 1:

8
1 2
1 7
1 8
2 5
2 6
3 4
3 7
4 5
5 6

Key: 4

Test Data 2:

8
1 2
1 3
1 6
2 3
2 4
4 7
4 8
5 6
5 7

Key: 4

Excuse me. Why are they 4?

Послано aa 12 апр 2003 09:49

Of the first test, we can match 1-2,3-4,5-6,it is 6.
Of the first test, we can match 1-2,4-7,5-6,it is 6,too.

Re: Excuse me. Why are they 4?

Послано aa 13 апр 2003 17:45

Sorry,I know your what you mean.

Not 4, but 8. You can matching 4 pairs of nodes.

Послано Maigo Akisame (maigoakisame@yahoo.com.cn) 6 окт 2004 20:17

Re: Not 4, but 8. You can matching 4 pairs of nodes.

Послано Yu YuanMing 9 окт 2004 21:03

Yes,you can match 4 pairs.
So the key is 4......

Re: 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?

Послано Chidori 7 ноя 2005 07:12

I passed your test and I use flower tree but i got wa on test 7

Обсуждение задачи 1099. Work Scheduling