Search found 5 matches

by christephan
Mon Aug 25, 2008 11:47 am
Forum: Volume 104 (10400-10499)
Topic: 10465 - Homer Simpson
Replies: 75
Views: 23433

Re: 10465 - Homer Simpson

For this input

Code: Select all

17 18 99
435 159 4568
1 1 1
10 87 555
34 657 189
999 99 6544
10 100 1000
1000 10 1
54 65 98
6 4 21
3 7 1000
103 103 465
485 173 6548
6465 555 1551
34 7878 8484
321 456 9877
My AC output:

Code: Select all

5 9
20 8
1
17
5 19
57 1
100
0 1
1 33
5 1
332
4 53
18 2
2 441
249 18
24 13
by christephan
Sun Aug 24, 2008 5:28 pm
Forum: Volume 6 (600-699)
Topic: 605 - The Rotating Disk
Replies: 8
Views: 4712

Re: 605

Yu Fan wrote:in this problem,how can we detemine whether the track can be solved?
thanks in advance
You can write another programme to find out when the track can be solved.
by christephan
Wed Jan 30, 2008 10:16 pm
Forum: Volume 107 (10700-10799)
Topic: 10765 - Doves and bombs
Replies: 7
Views: 4662

I think I was sleepy..

When I get up today, I add backtracking to my DFS algorithm such that I can prevent re-calculating as much as posibble.
The algorithm now may be O(|E| + |V| log |V|), I'm not sure. (n log n is for heap sort), where |E| <= 10 |V|.

Then now AC with 0.03s
by christephan
Wed Jan 30, 2008 5:59 am
Forum: Volume 107 (10700-10799)
Topic: 10765 - Doves and bombs
Replies: 7
Views: 4662

10765 - Doves and bombs

My O(n^2) algorithm (DFS+heap) got TLE.

Any better solutions? THX.
by christephan
Fri Jan 25, 2008 9:29 pm
Forum: Volume 111 (11100-11199)
Topic: 11179 - Bit Stream
Replies: 11
Views: 5235

400000 5 1234567890 1987654320 1336952641
100000 100000 100000 100000 0

399990 5 1234567890 1987654320 1911114481
99999 99998 99997 99996 0

400000 5 4294967289 4294967295 110362555
100000 100000 100000 100000 0


All compressed OK.

Go to advanced search