## Search found 123 matches

Sun Feb 26, 2006 5:31 am
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 25382
david Most probably - yes. I think that the proof that R is indeed transitive will solve everything, once internals of this proof are given. Another noted thing which makes me feeling "unsafe" is that "unique resulting string means unique ordering of pieces". 123456 can be 123+456 or 12+34+56. Some...
Fri Feb 24, 2006 5:02 pm
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 25382
david I understand your way of proving it via "we have the only one possible answer", and then applying this property it to the original data. What "irritates" me a little is that whenever I tried to solve some other problems this way, I always found a flaw in my decisions like A -> B, and B -> A, ...
Thu Feb 09, 2006 2:46 am
Forum: Volume 108 (10800-10899)
Replies: 25
Views: 15809
lord_burgos
Please correct your forumlae... I don't see why 'S' stopped being an exponent
Mon Jan 23, 2006 4:20 am
Forum: Volume 109 (10900-10999)
Topic: 10905 - Children's Game
Replies: 66
Views: 25382
david 223++22 > 22++223 but 22 4 223 > 223 4 22 (if '4' is placed in between 'a' and 'b'), so this is not true for arbitrarily placed pairs. Porbably it still can be proven via adjacent swaps, but it is not obvious for me how to prove that bubble sort local maximums will yield global maximum (since...
Mon May 02, 2005 8:14 pm
Forum: Volume 108 (10800-10899)
Topic: 10805 - Cockroach Escape Networks
Replies: 38
Views: 12984

My AC solution performed edge-split (described earlier in this topic) on every edge. All weaker efforts failed, although they were more time-effective.
Sun May 01, 2005 8:18 am
Forum: Volume 108 (10800-10899)
Topic: 10805 - Cockroach Escape Networks
Replies: 38
Views: 12984
My solution outputs
2
2
run-time-error (duplicate edge)

Without that checking it outputs 2-2-1-2-2-5
Fri Apr 08, 2005 10:25 am
Forum: Volume 107 (10700-10799)
Topic: 10755 - Garbage Heap
Replies: 20
Views: 10559
This should be TL, but not WA... Check your loops. Is it O(N^9)?
Fri Apr 08, 2005 10:22 am
Forum: Volume 108 (10800-10899)
Topic: 10806 - Dijkstra, Dijkstra.
Replies: 24
Views: 17687
You have to find 2 paths from S to T, such that they don't share any edge (but may share some nodes). Sum of their lengths must be minimal possible.
Wed Apr 06, 2005 2:23 am
Forum: Volume 107 (10700-10799)
Topic: 10786 - Qualify for the Champions League
Replies: 9
Views: 3227
Adrian, My thoughts told that it is better to give wins to teams who are above us to ensure most zeroes behind. Kinda greedy method. Then distribute draws as much as possible. Give as much wins to yourself as possible, and so, and so... I tried to write this 4 times, and each time threw everything a...
Tue Apr 05, 2005 9:41 pm
Forum: Volume 107 (10700-10799)
Topic: 10786 - Qualify for the Champions League
Replies: 9
Views: 3227
As you may see in my previous message, try to guess the formula. It's much easier than all simulation code behind it... It appears like sin(asin(sqrt(x^2))) = (?) = x. Not that easy formula, but close.
Tue Mar 22, 2005 9:47 am
Forum: Volume 106 (10600-10699)
Topic: 10659 - Fitting Text into Slides
Replies: 17
Views: 7912

Code: Select all

No solution
10
No solution
14
Mon Mar 07, 2005 10:23 am
Forum: Volume 107 (10700-10799)
Topic: 10727 - Practice
Replies: 10
Views: 3307
I used 2D ternary search (nestes 1D's).
Mon Mar 07, 2005 10:20 am
Forum: Volume 108 (10800-10899)
Replies: 25
Views: 15809
With O(n*4^s) DP I got TL during the contest. It's better to index back and forth all 3^s states into 4^s map.
Mon Mar 07, 2005 10:15 am
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 174992
Age 21 (almost 22), registered AFAIK in 1999 (too lazy to check my INFO ). I usually solve about 200 problems in 2-6 weeks, then I understand that it's really time to get back to work, and evantually 6-12 months gap follows.

P.S: my ID is prime (4153)
Thu Mar 03, 2005 1:09 am
Forum: Volume 106 (10600-10699)
Topic: 10629 - Truckin'
Replies: 10
Views: 5039
ihi,

Try to find some easy to calculate lower and upper bounds for result and check if your real algorithm's result fits into this range.