Hello,
I've been trying to solve the problem SQCOUNT. After failing to find any errors I checked the test data (by posting a program returning "1" if the problem occours). I am practically cerain that there are overlaping rooms in the test cases!
No only the problem states: "No two rooms will overlap", but if they do it's hard to say how to treat this kind of case. Should I reduce the number of squares but the number in the overlap? I know that many people have solved this and I guess it will work if You count with the O(n^2) algo, ignoring that the rooms intersect with more than just a side. Still it would be nice if this problem was resolved.
created
last reply
- 7
replies
- 197
views
- 6
users
- 2
links