Search found 28 matches

by Anindya
Fri Oct 03, 2008 8:09 pm
Forum: Volume 114 (11400-11499)
Topic: 11492 - Babel
Replies: 18
Views: 10238

Re: 11492 - Babel

Thanks a lot neilor & helloneo . I thought that when i am updating a vertex from source,i need not to check whether this value is smaller than previous stored value. I forgot the following line: The same pair of languages may have several words associated to it. From my WA it is clear that they may ...
by Anindya
Mon Sep 29, 2008 11:12 am
Forum: Volume 114 (11400-11499)
Topic: 11492 - Babel
Replies: 18
Views: 10238

Re: 11492 - Babel

I can't understand why my code gets WA.
Plz someone tell me some cases where my code may fail.
I used dijkstra.Help me.Thanks in advance.

Code: Select all

Code removed after AC.
by Anindya
Sun Sep 28, 2008 8:05 am
Forum: Volume 115 (11500-11599)
Topic: 11504 - Dominos
Replies: 55
Views: 19885

Re: 11504 - Dominos

For the following input:

Code: Select all

1
10 13
1 2
2 1
3 4
4 3
5 6
6 5
4 6
7 8
8 7
9 10
10 9
5 10
10 1
the output should be 2.
AC code outputs 3.
The input is taken from waterloo site.
Then how the case is not included in UVa?
by Anindya
Thu May 29, 2008 8:33 am
Forum: Volume 111 (11100-11199)
Topic: 11125 - Arrange Some Marbles
Replies: 20
Views: 12617

Re: 11125 - Arrange Some Marbles

Those who got WA check the data set given below:
Input:

Code: Select all

12
1 7
1 6
1 5
1 3
1 1
1 0
2 0 0
3 0 0 0
4 7 7 7 7
2 7 6
2 7 7
4 0 3 4 5
Output:

Code: Select all

0
0
0
0
0
1
1
1
688022064
6
0
174
wish u get AC.
by Anindya
Sat Mar 08, 2008 7:41 am
Forum: Volume 109 (10900-10999)
Topic: 10907 - Art Gallery
Replies: 22
Views: 9438

Can anybody help me on this problem?
I have tried every i/o posted in this forum & passed them all.
I can't find any error in my codes.
Can any one give me some test cases?
by Anindya
Thu Mar 06, 2008 7:46 pm
Forum: Volume 6 (600-699)
Topic: 609 - Metal Cutting
Replies: 4
Views: 3733

PLZ someone help me about this problem.
The brute force O(n!) approach gets TLE.
There are more than 10 people who got AC in <=0.010 sec.
I do want to know the algo.
PLZ help.Thanks in advance.
by Anindya
Thu Feb 28, 2008 7:45 am
Forum: Volume 114 (11400-11499)
Topic: 11404 - Palindromic Subsequence
Replies: 25
Views: 13559

RTE

I am getting RTE,can any one help?

Robert,how for the input:

Code: Select all

pqrodtkwpfyycjphtijvdnjc
u get:

Code: Select all

dtpaaptd
PLZ expain.I can't see any 'a' in the input string.
Does ur AC code produces this output?
by Anindya
Sat Feb 02, 2008 8:07 pm
Forum: Volume 109 (10900-10999)
Topic: 10917 - Walk Through the Forest
Replies: 19
Views: 10017

Oh that was fully because of a small mistake in the implementation of dijkstra. :oops:
Now got AC :D
Jan's first set of output should be like this:

Code: Select all

6 9 
1 6 2995 
6 3 4827 
3 1 32391  
3 5 12382 
5 4 18716 
4 3 19895  
6 1 1869 
1 5 25667 
5 2 17035
Ouput is the same as given by him.
by Anindya
Fri Feb 01, 2008 8:52 am
Forum: Volume 109 (10900-10999)
Topic: 10917 - Walk Through the Forest
Replies: 19
Views: 10017

Sclo wrote: Try this: Let d(u) be the distance between vertice u and 2. then f(u) = sum of f(v) such that u,v are adjacent and d(v)<d(u) where f(u) is the number of path from u to 2 I have implemented this & getting WA. This is my function : int f(int u) { int cnt=0,v; if(u==2) return 1; if(ct[u]>=0...
by Anindya
Thu Jan 17, 2008 6:13 pm
Forum: Volume 6 (600-699)
Topic: 675 - Convex Hull of the Polygon
Replies: 12
Views: 5350

This is a peculiar problem->must be a fault of the judge.
The following code gets AC:

Code: Select all

#include<stdio.h>

int main()
{
char s[100];
while(gets(s))
{
printf("Its ok\n");
}
return 0;
}
And my actual programme gets continuous RTE,don't know the reason.
Thanks for ur reply DJWS.
by Anindya
Thu Jan 17, 2008 5:35 pm
Forum: Algorithms
Topic: becoming a maestro of DP
Replies: 7
Views: 4366

Well,I think the following ones may help you: 10910 - Marks Distribution 10911 - Forming Quiz Teams 10912 10913 - Walking on a Grid 10918 - Tri Tiling 10930 - A-Sequence 10943 10954 - Add All 10980 - Lowest Price in Town 10990 - Another New Function 11000 - Bee 11002 - Towards Zero 11008 - Antimatte...
by Anindya
Tue Jan 08, 2008 9:40 pm
Forum: Volume 6 (600-699)
Topic: 675 - Convex Hull of the Polygon
Replies: 12
Views: 5350

675 - Convex Hull of the Polygon

I am getting continuous RTE in this simple(most probably) convex-hull problem. Can anyone tell me what can be the number of points? I have tried with number of points=2*10^6,but that also resulted in a RTE. My code of convex-hull is tested , I got AC in almost 10-12 convex-hull problems of UVa. This...
by Anindya
Fri Dec 21, 2007 8:07 pm
Forum: Algorithms
Topic: MST !!!
Replies: 6
Views: 5326

Another One:

11267
by Anindya
Fri Dec 21, 2007 8:05 pm
Forum: Algorithms
Topic: MST !!!
Replies: 6
Views: 5326

More MST problems:

10462
10600
10842
by Anindya
Fri Dec 21, 2007 1:57 pm
Forum: Algorithms
Topic: Need expert's view for geometry algos.
Replies: 23
Views: 9124

Hello everyone. I have solved 137 & some other problems on polygon clipping. But what can you say about 10321 & 805 ? I have used a code (Sutherland-Hodgman algorithm according to Laszlo's book of computational geometry) which can determine the common area of two polygons if the clipper polygon is c...

Go to advanced search