Search found 225 matches

by Caesum
Thu Dec 11, 2003 10:04 pm
Forum: Volume 100 (10000-10099)
Topic: 10096 - The Richest Man of the Universe
Replies: 42
Views: 16511

I am also WA on this. Why in the last case is it not 'not enough space' since the original one will not fit in the box ?
by Caesum
Wed Dec 10, 2003 8:57 pm
Forum: ACM ICPC Archive Board
Topic: 2684
Replies: 2
Views: 1036

2684

How about more than 10 seconds for this, or reduce the input ? I mean look at the stats...... lowest time is like 8.1 seconds, and nearly everyone times out on it...... If you think that the current time is adequate, then I suggest lowering the time on problems like 10290 where 100 seconds is way to...
by Caesum
Tue Dec 09, 2003 1:12 am
Forum: Volume 100 (10000-10099)
Topic: 10053 - Envelopes
Replies: 12
Views: 3389

two points: firstly only one card can go in one envelope, which the above program is not doing. secondly i finally passed this through formulating an inequality in the lengths and widths of the card and the envelope and evaluated it with multi-precision arithmetic. maybe its not necessary but i coul...
by Caesum
Sun Dec 07, 2003 6:51 pm
Forum: Other words
Topic: programming challenges book & convex hull code
Replies: 7
Views: 2549

As an example, if you compile the convex hull program from their site and give it input like: 8 0 1 0 2 1 2 2 2 2 1 2 0 1 0 0 0 then you get a convex hull of: (2.000000,0.000000) (2.000000,2.000000) (0.000000,2.000000) which is clearly wrong. and this after all the trouble they go to in the book poi...
by Caesum
Sun Dec 07, 2003 6:02 pm
Forum: Other words
Topic: programming challenges book & convex hull code
Replies: 7
Views: 2549

programming challenges book & convex hull code

Has anyone else bought this ? Their website seems a bit dead and you cannot register there properly or retrieve old passwords for the forum, etc since all you get is error messages.

Out of interest though, has anyone got their convex hull code to work as it seems a bit buggy to me ?
by Caesum
Mon Dec 01, 2003 9:27 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13894

nevermind.... i think i have it...... writing that helped me sort it out in my mind........
by Caesum
Mon Dec 01, 2003 9:14 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13894

sounds interesting but...... your pseudo code loses me, i tried implementing this but can't get it to work....... (4) x=LIS[last], for i = 1 ... last { answer =a[x], z=b[x] }, (5) what is z doing here ? do you mean x ? (2) if a[n]>LIS[last] shouldnt this be a[n]>a[LIS[last]] ? I still don't understa...
by Caesum
Sun Nov 30, 2003 6:29 pm
Forum: Volume 4 (400-499)
Topic: 481 - What Goes Up
Replies: 82
Views: 13894

481 what goes up

My current algorithm for this is O(n^2) worse case and O(n) best case but it fails with TLE on this problem - each time it adds a new element it looks back through an array to find where it can be added to a sequence to make a longer one. It appears that the array size is somewhere between 100000 an...
by Caesum
Sun Nov 30, 2003 2:20 pm
Forum: Volume 104 (10400-10499)
Topic: 10478 - The Falling Pillars
Replies: 23
Views: 7731

nevermind, thats not a good example of what i was looking for....... is it possible that as successive blocks fall on each other then one block misses the corner of the one to the right and ends up resting on the underside of the the one to its right ? anyway my code should handle this case but its ...
by Caesum
Sat Nov 29, 2003 8:23 pm
Forum: Volume 104 (10400-10499)
Topic: 10478 - The Falling Pillars
Replies: 23
Views: 7731

Can someone give the output for this case:

10 7.99 4 4

thanks
by Caesum
Fri Nov 28, 2003 7:32 pm
Forum: ACM ICPC Archive Board
Topic: "I Think I Need a Houseboat" problem 2363 input wr
Replies: 2
Views: 1293

looks to me like there is definitely a problem with the input file, perhaps someone can check it out ???? no one is ac on this and there are loads of OLE's on it.....
by Caesum
Wed Nov 26, 2003 7:49 pm
Forum: Volume 2 (200-299)
Topic: 286 - Dead Or Not -- That Is The Question
Replies: 19
Views: 5063

286

Is the third example wrong ?

I mean:
Kqnqqbrnrnqpqrbnrnnrqprqkrrpbqqnbqbbnqqbrprnpppnbrnrnqrbbbnpbbbr

so the corner of the board is:

rnq
Kq

so the K is attacked by q and r, the nearest q is protecting the r and n and the other q protects the first q. So how can this be 'game is not over' ?
by Caesum
Tue Nov 18, 2003 8:30 pm
Forum: Other words
Topic: the judge is down?
Replies: 5
Views: 1885

looks more like cgi is broken, maybe some configuration change on the server ?
by Caesum
Tue Nov 18, 2003 8:28 pm
Forum: Volume 3 (300-399)
Topic: 334 - Identifying Concurrent Events
Replies: 7
Views: 1783

Well, I am totally fed up with this problem. I finally got an AC-PE on it after many many submissions, but only by printing a space at the end of every line.... no idea how to get AC on it.
by Caesum
Mon Nov 17, 2003 8:38 pm
Forum: Volume 8 (800-899)
Topic: 837 - Light and Transparencies
Replies: 25
Views: 14093

having finally solved this, the correct reply to the input above is: 3 -inf -0.300 1.000 -0.300 1.500 1.000 1.500 +inf 1.000 3 -inf -0.300 1.000 -0.300 1.500 0.800 1.500 +inf 1.000 5 -inf -0.300 1.000 -0.300 0.000 1.000 0.000 1.500 0.700 1.500 2.000 0.700 2.000 +inf 1.000 5 -inf -0.300 1.000 -0.300 ...

Go to advanced search