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
2091
. Natural Selection
Show all threads
Hide all threads
Show all messages
Hide all messages
WA4
Badr
2091
. Natural Selection
7 May 2019 20:38
1
WA4
Badr
7 May 2019 20:38
If you have WA4, try a 100x100 matrix with all 1 or with all 0.
Edited by author 12.05.2019 20:53
this problem should really have lower complexity
imaginary friend
2091
. Natural Selection
11 Sep 2018 05:11
1
this problem should really have lower complexity
imaginary friend
11 Sep 2018 05:11
it's just about implementation, the complexity is too high for these problem, imho
If you have WA #9
Smilodon_am [Obninsk INPE]
2091
. Natural Selection
15 Sep 2016 17:11
1
If you have WA #9
Smilodon_am [Obninsk INPE]
15 Sep 2016 17:11
So try below test. It helped me:
6 4
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
Correct answer (and similar):
6
1 2
Conditions of the problem
Vitaly
2091
. Natural Selection
9 Jul 2016 18:11
3
Conditions of the problem
Vitaly
9 Jul 2016 15:45
What is the criterion of optimality of the partition ?
Re: Conditions of the problem
aslan7470
9 Jul 2016 16:07
Minimum of maximum of 4 numbers, read problem
Re: Conditions of the problem
Jane Soboleva (SumNU)
9 Jul 2016 18:11
Also, instead of «The i-th number in the j-th row» there should be «The j-th number in the i-th row» (unless, judging by the title, this is intended, haha)
New topic
Style:
flat
|
tree
|
nested
Thread Order:
bubble
|
fixed
© 2000–2024
Timus Online Judge Team
. All rights reserved.