Search found 34 matches

by ranjit
Wed Jan 18, 2006 10:10 am
Forum: Volume 109 (10900-10999)
Topic: 10981 - String Morphing
Replies: 31
Views: 13495

mf, you said you can find out what characters need to be merged in O(n^3) dp at every step. Can you please explain how to do that? If you use dp similar to CYK algorithm, then it need not be correct for finding out the characters to merge. because if you use dp[i,j] = function(dp[i,k],dp[k+1,j]), we...
by ranjit
Tue Jul 26, 2005 10:03 am
Forum: Volume 108 (10800-10899)
Topic: 10826 - Hot or Cold?
Replies: 26
Views: 13217

Hi

This is my output. 6 guess(es) required. 7 guess(es) required. 7 guess(es) required. 7 guess(es) required. 8 guess(es) required. 8 guess(es) required. 10 guess(es) required. 10 guess(es) required. 10 guess(es) required. 10 guess(es) required. 10 guess(es) required. 10 guess(es) required. 13 guess(es...
by ranjit
Fri Mar 04, 2005 2:39 pm
Forum: Volume 6 (600-699)
Topic: 687 - Lattice Practices
Replies: 8
Views: 5732

can you tell me the order of your algorithm?
by ranjit
Fri Feb 04, 2005 3:33 pm
Forum: Algorithms
Topic: Help
Replies: 3
Views: 1046

hi

Sumankar, I didnt exactly understand your solution. The polygon might have some area that is not in any triangle too. So you would have to be very careful in finding the various polygons first, something like finding the components in a graph where the nodes are represented by the traingles and the ...
by ranjit
Mon Jan 31, 2005 1:13 pm
Forum: Volume 107 (10700-10799)
Topic: 10745 - Dominant Strings
Replies: 38
Views: 17171

sorry

my j loop runs from i+1 to n. So no conflicts.

Also i just find out whether my mat[k]>mat[j][k]
or otherwise when i check for inequality.

Also, I didnt not sort the strings anywhere in my code.
That was the mistake.

Thanks to Christian for finding it out.

Thanks anyway.
ranjit
by ranjit
Sun Jan 30, 2005 7:49 pm
Forum: Volume 6 (600-699)
Topic: 687 - Lattice Practices
Replies: 8
Views: 5732

687 - Lattice Practices

687 is a very interesting problem. Though i am not able to either reduce the search space
or even find out all the possible configurations for the sample input.

Can anyone who is interested in this problem help ?

Thanks.
by ranjit
Sun Jan 30, 2005 7:46 pm
Forum: Volume 107 (10700-10799)
Topic: 10745 - Dominant Strings
Replies: 38
Views: 17171

What's wrong with my algorithm

I keep getting WA in 5sec with the foll. algorithm Can somebody point out the mistake. 1.mat[i][j] stores the number of occurrences of "j+'a' " character in string i. 2.loop overall i 2a. if i not marked dominated 3. loop overall j 3a. if j not marked if mat[i][k]!=mat[j][k] if i dominates j mark j ...
by ranjit
Sun Jan 30, 2005 8:44 am
Forum: Volume 102 (10200-10299)
Topic: 10261 - Ferry Loading
Replies: 41
Views: 19438

is there any greedy approach

is there any greedy solution to the problem. I see some zero memory and time solutions
by ranjit
Fri Jan 28, 2005 8:49 pm
Forum: Volume 102 (10200-10299)
Topic: 10201 - Adventures in Moving - Part IV
Replies: 23
Views: 11521

hi

hi abishek,
from your description of the solution,it is not clear whether you ensure that at the destination
the truck has fuel > 100 litres.

Also, print Impossible not -1.
by ranjit
Thu Jan 27, 2005 10:56 pm
Forum: Volume 100 (10000-10099)
Topic: 10091 - The Valentine's Day
Replies: 12
Views: 3723

10091 WA

I have got WA many times in this problem. I think there are many ambiguties. For eg. the problem says the persons are transferred every new month. Does that mean they shift over on the 1st of the new month or exactly one month later. Ofcourse the latter assumption is instantly proved inconsistent si...
by ranjit
Fri Jan 21, 2005 4:59 am
Forum: Volume 107 (10700-10799)
Topic: 10772 - Rose windows
Replies: 8
Views: 2200

Interesting ...

My ac code gives the o/p

Code: Select all

100.0000
100.0000
for both the cases.

Hope it helps
by ranjit
Thu Jan 20, 2005 4:54 am
Forum: Volume 107 (10700-10799)
Topic: 10737 - The Difference Engine
Replies: 4
Views: 1818

10737 WA please help

Can anyone verify these i/o and tell if there are any mistakes. I have been getting WA for tihis problem Thanks in advance. Input 23 23 ? ? ? 1 17 16 ? 6 17 9 17 ? 15 10 ? 8 12 16 11 2 3 1 16 41 28 38 18 9 13 3 ? ? 22 33 25 1 40 10 15 30 1 ? 31 ? ? ? 26 ? 29 ? 11 7 ? ? 27 ? 7 ? 36 16 29 ? ? ? 3 34 7...
by ranjit
Sat Jan 08, 2005 7:25 am
Forum: Volume 107 (10700-10799)
Topic: 10754 - Fantastic Sequence
Replies: 16
Views: 11024

Thanks. Even i didnt initialize properly !!
by ranjit
Thu Jan 06, 2005 3:07 pm
Forum: Other words
Topic: more input-output
Replies: 4
Views: 1587

it need not be critical i/o always. just tens of i/o can explain to the programmer atleast whether he is on the right track. If probably he finds that he is on the right track he atleast can look at the prospect of his pgms working/not working for the critical i/p. This is mainly in regard to proble...
by ranjit
Thu Jan 06, 2005 2:40 pm
Forum: Other words
Topic: more input-output
Replies: 4
Views: 1587

more input-output

Can it be made possible that more number of input-output are provided for the problems. Note that these may be separate from the test cases used to judge the program. This would possibly eliminate many wrong submissions resulting from trivial doubts (like whether to add a new line at the end ) withi...

Go to advanced search