## Search found 85 matches

Thu Aug 27, 2009 7:15 pm
Forum: Volume 116 (11600-11699)
Topic: 11654 - Arithmetic Subsequence
Replies: 6
Views: 2814

### Re: 11654 - Arithmetic Subsequence

crip121 wrote:my run time complexity is N^3. its a pretty straight forward DP problem.
Could you explain it?
Thu Aug 27, 2009 7:12 pm
Forum: Volume 116 (11600-11699)
Topic: 11654 - Arithmetic Subsequence
Replies: 6
Views: 2814

### Re: 11654 - Arithmetic Subsequence

Chimed wrote:Same as yours got 0.364sec.
Do you use stl in your solution?
Wed Aug 26, 2009 6:43 pm
Forum: Volume 116 (11600-11699)
Topic: 11654 - Arithmetic Subsequence
Replies: 6
Views: 2814

### 11654 - Arithmetic Subsequence

Hi!
I solved this problem, but my runtime is very large(1.040 sec). I'm interesting in your solutions, what method do you use and what is the complexity of your algo? My algo is - O(n^3 logN).
Mon Aug 24, 2009 8:42 am
Forum: Volume 116 (11600-11699)
Topic: 11636 - Hello World!
Replies: 30
Views: 7036

### Re: Gettign W/A on problem 11636

Sat Aug 15, 2009 8:31 pm
Forum: Volume 116 (11600-11699)
Topic: 11624 - Fire!
Replies: 54
Views: 15367

### Re: 11624 - Fire!

Try to think how to solve this problem with one BFS!!!
Tue Aug 11, 2009 9:03 pm
Forum: Volume 116 (11600-11699)
Topic: 11610 - Reverse Prime
Replies: 7
Views: 3324

### Re: 11610 - Reverse Prime

Thanks for your test it really help me to find a bug and to correct my solution!
Mon Jul 27, 2009 7:12 pm
Forum: Volume 116 (11600-11699)
Topic: 11610 - Reverse Prime
Replies: 7
Views: 3324

### Re: 11610 - Reverse Prime

Hi, could somebody help me? my solution got WA ((

Code: Select all

///CUT......
Fri Jul 24, 2009 5:52 pm
Forum: Volume 8 (800-899)
Topic: 850 - Crypt Kicker II
Replies: 77
Views: 37555

### Re: 850 - Crypt Kicker II

This test help to find my bug:

Code: Select all

1

xnm ceuob lrtzv ita hegfd tsmr xnm ypwq ktj x
Ansewr should be: No solution.
Wed Jul 22, 2009 8:30 am
Forum: Volume 115 (11500-11599)
Topic: 11579 - Triangle Trouble
Replies: 20
Views: 10523

### Re: 11579 - Triangle Trouble

Don't break your code! find max area and all will be ok!!!!
And of course delete your code!
Mon Jul 13, 2009 8:45 pm
Forum: Volume 110 (11000-11099)
Topic: 11029 - Leading and Trailing
Replies: 43
Views: 18009

### Re: 11029 - Leading and Trailing

Hi!!!
I think there is a bug in this problem!
Here such input:
1
2 3

I think that answer should be : 008...008, but my accepted programm return 800...008
What do you think about it?
Wed May 20, 2009 7:55 pm
Forum: Volume 116 (11600-11699)
Topic: 11601 - Avoiding Overlaps
Replies: 11
Views: 5226

### Re: 11601 - Avoiding Overlaps

Somebody please tell me what is a complexity of your algo(accepted )???
Sun May 17, 2009 2:18 pm
Forum: Volume 115 (11500-11599)
Topic: 11504 - Dominos
Replies: 55
Views: 21846

### Re: 11504 - Dominos

First I try to find scc(strongly connected components),with such algo: 1) Topologic sort(with dfs) 2) make graph inverse 3) dfs2 with inverse graph, this algo was written in Knuth's book, but it gived me wrang answer. Then I don't inverse a graph and work with initial graph, this idea was right, and...
Mon May 04, 2009 7:14 pm
Forum: Volume 116 (11600-11699)
Topic: 11601 - Avoiding Overlaps
Replies: 11
Views: 5226

### Re: 11601 WA

What algo do you use??????
Sun Apr 26, 2009 7:23 pm
Forum: Volume 116 (11600-11699)
Topic: 11601 - Avoiding Overlaps
Replies: 11
Views: 5226

### Re: 11601 WA

I think that 5 sec is gived for a one test case,so if max n=10000, n^2=100 000 000 , it should run about 1 sec.
Wed Apr 22, 2009 7:58 pm
Forum: Volume 116 (11600-11699)
Topic: 11601 - Avoiding Overlaps
Replies: 11
Views: 5226

### Re: 11601 WA

I use O(n^2)algo and got TLE, please tell me why? I think that this algo should work ok...