OJ Board

hewei

From the sample input/output, I inferred that the author assumed the probability of Mr. Smith's waiting at certain intersection was totally (thus only) decided by the degree of the intersection, given that Mr. Smith had walked long enough before he stopped. However, I've got a different opinion that ...

hewei

Hello, windows2k!
The bug in your code is really difficult to trace,:)
See the sample:
input:
2
A
|
---
B C
#
A
|
---
B
#

output:
(A(B()C()))
(A(B()))

instead of yours:
(A(B()C()))
(A(B()C()))

Till now, you will have got to know what is all happening to your program. You forgot to ...

hewei

Well, as far as I see, to find a nice formula is as difficult as to solve the equation below:

(when x is not equal to y)
(x*x - l*l) * sqrt(y*y - l*l) - (y*y - l*l) * sqrt(x*x - l*l) = c*(x*x - y*y)

but, when x equals y, the problem becomes obviously trivial:
l = sqrt(x*x - 4*c*c)

hewei

Hi, Farid Ahmadov!
There was a fault in your proof:
From 6th line: a/b = a1/b1 = z
To 7th line: r/c = c/r1/ = z*z

The process 6th -> 7th requires the angle you noted in the graph to be right, i.e. 90 degrees.

That's why the formula is even not suitable for the sample, isn't it?

hewei

Hello, Subeen!
You have carelessly assumed:
1. All the labels of the tree is different since it was that in the sample.
2. Total number of nodes in a tree will not exceed 210 as you have declared the array "abc" to contain only 210 elements.

Theoretically, both of the two points above will stop you ...

hewei

But, kuasha, how to report the result on the status page for those who fails at the "volunteer judges"? Insufficient judge data may easily lead to improper status info.

hewei

2hewei
Actually, I used dynamic programming. The running time is O(N^4) (however the inner loop contains a few operations, so the constant is small and there is no TL), and the used memory is O(N^3) (at first I had array int [210][210][210] and that caused ML - it was quite annoying). If you want ...

hewei

Not at all,

hewei

Hi, sharklu2000. I noticed that you assume that the children of a same parent node will be at least a 'space' apart. But since this is not specially mentioned in the desciption, I think there could be such situations where the children are sticked together. For example:

The input

A
|
--
BC ...

hewei

Hi, Alexander. I fully agree with you that the OJ should be improved with its performance. By the way, if I may ask, how do you solve problem A Blocks? Do you make use of any heuristic searching strategy like A*? Thanks.

hewei

I'm sorry, sduval. I also made a mistake and I have corrected my last reply.

hewei

[quote="sduval"]Hi,

I found that output file for pb 2516 was wrong... The input/output files for
this problem seem to be the files I've found at http://www.cs.duke.edu/courses/fall02/cps149s/problems/see2002/Problems/.
I got AC with simply printing the 15 strings of the ouput file... ;-)
Actually ...

hewei

The memory usage of the following code shown on the OnlineJudge's status page is 64 kB! I believe there was something wrong.

Code: Select all

int A[1024][1024];

int main()
{
	int i, j;
	for (i = 0; i < 1024; i++)
	{
		for (j = 0; j < 1024; j++)
		{
			A[i][j] = i + j;
		}
	}
	return 0;
}

hewei

I found out that the test data for problem 2516 Sly Number might be the same as provided by the ACM/ICPC problem archive or something like that. But I think this set of test data for "Sly Number" is incorrect and the only two submitters who got AC on this problem probably printed out the "answer ...

OJ Board

Search found 14 matches

11025 - Mr. And Mrs. Hamilton

Is this a bug?

Test data for problem 2516 Sly Number may be incorrect!