ENG
RUS
Timus 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
Discussion of Problem
1478
. Spy Satellites
Show all threads
Hide all threads
Show all messages
Hide all messages
Great problem!
Denis Koshman
1478
. Spy Satellites
1 Oct 2023 13:22
5
Great problem!
Denis Koshman
26 Aug 2008 06:35
Thanks to authors :)
Re: Great problem!
svr
30 Nov 2009 10:31
It became such when true claster analysis began
or inner structure of each claster is forgotten and clasters are simple poins again.
Some time I was tried to trace complicated inner structure but failed.
Re: Great problem!
Shen Yang
20 Nov 2017 11:06
is there simpler solution?? I use brute_force search....
Re: Great problem!
TruMen [Lviv NU]
16 Dec 2021 15:33
Yes, O(n^3) solution (maybe can be optimized to O(n^2*log(n)) with nice tree merging) based on MST.
Great problem!!!
Re: Great problem!
Ade
1 Oct 2023 13:22
yes. love the problem.
some tests:
5 0 0 0 1 0 2 0 4 0 5
5 0 0 0 1 0 3 0 4 0 5
0
Help!!!!
Rudolf [Sumy SU]
1478
. Spy Satellites
26 Aug 2008 04:57
2
Help!!!!
Rudolf [Sumy SU]
19 Jun 2008 16:37
The answer for test
4
1 1
1 4
1 7
1 8
will be
1111
or
1011
???????????
Re: Help!!!!
Denis Koshman
26 Aug 2008 04:57
1011
Distance must be strictly less
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2026
Timus Online Judge Team
. All rights reserved.