ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1382. Game with Cards

1382 tests are not full
Posted by svr 12 Feb 2007 22:08
Potentialy very interesting but with too weak tests problem
I got Ac very unexpected on halphway of solution.
MY prog can't process test
4
1 2 1
2 1 2
3 4 3
4 3 4
with answer
1 1 1 1
This specific case most interesting case when
there are K~100-250 unintersecting circles in given
graph. We should build forest consist of such
circles and process each tree from the root.
Circles are bound throught whome each statement belong.
All this situation is unreflected because weak tests.

Edited by author 12.02.2007 22:08

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:09

Edited by author 12.02.2007 22:11
Re: 1382 tests are not full
Posted by Denis Koshman 21 Aug 2008 14:07
There is an easier greedy solution.

Edited by author 21.08.2008 16:04