Search found 84 matches

by FAQ
Wed Sep 05, 2007 6:17 am
Forum: Volume 112 (11200-11299)
Topic: 11262 - Weird Fence
Replies: 16
Views: 7557

I found my bug :-? Misunderstood the problem statement, the word "linear distance", I thought it's Manhattan :o Anyway, some tests for who still get WA 12 2 1 5 0 red 1 2 blue 3 1 -1000 -1000 blue 0 0 blue 1000 1000 red 4 20 -1000 -1000 blue -1000 1000 red 1000 -1000 red 1000 1000 blue 4 2 -1000 -10...
by FAQ
Wed Sep 05, 2007 3:18 am
Forum: Volume 112 (11200-11299)
Topic: 11262 - Weird Fence
Replies: 16
Views: 7557

that's what I did but WA :(
by FAQ
Tue Sep 04, 2007 3:33 pm
Forum: Volume 112 (11200-11299)
Topic: 11262 - Weird Fence
Replies: 16
Views: 7557

in 10804, I got a lot of WAs too, but after fixed a precision error it worked.
This problem...no 'real/float/double' numbers so I don't know what the trick is
by FAQ
Tue Sep 04, 2007 7:44 am
Forum: Volume 112 (11200-11299)
Topic: 11262 - Weird Fence
Replies: 16
Views: 7557

11262 - Weird Fence

I tried this problem with binary search and matching but got tons of WAs :(
If you know some tricky tests, please tell me

Thanks
by FAQ
Sun Apr 22, 2007 7:39 am
Forum: C++
Topic: Set heap size and stack size in C++
Replies: 1
Views: 6043

Set heap size and stack size in C++

Hi,
I want to ask, in Pascal we have a way to extend the limit of stack size and heap size
like

Code: Select all

Turbo Pascal:
{$M 65520, 0, 1024}
Free Pascal:
{$M 100000, 1000000}
How about C++? can we do it?

Thanks
by FAQ
Mon Feb 19, 2007 6:01 am
Forum: Volume 111 (11100-11199)
Topic: 11170 - Cos(NA)
Replies: 22
Views: 13493

if you use DevC++, you can try printf("%I64d", x)
by FAQ
Mon Feb 12, 2007 10:42 am
Forum: Volume 101 (10100-10199)
Topic: 10190 - Divide, But Not Quite Conquer!
Replies: 105
Views: 24428

Thanks a lot! I use GCC so I often use iostream for both printf and cout...
by FAQ
Mon Feb 12, 2007 7:07 am
Forum: Volume 101 (10100-10199)
Topic: 10190 - Divide, But Not Quite Conquer!
Replies: 105
Views: 24428

please help me, why I got CE here :( I compiled with GCC it's ok for all tests on the board

Code: Select all

Aced
by FAQ
Sun Feb 11, 2007 4:28 pm
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 40885

I still got a lot of WAs, please help me some tests :( thanks
by FAQ
Sat Feb 10, 2007 4:11 am
Forum: Volume 111 (11100-11199)
Topic: 11156 - Continuous Drawing
Replies: 10
Views: 5474

I passed all above tests but still got a lot of WAs :( please help me some more tests

Thanks
by FAQ
Tue Jan 23, 2007 7:41 am
Forum: Volume 111 (11100-11199)
Topic: 11164 - Kingdom Division
Replies: 6
Views: 3128

Thanks a lot for joy's tests !!

To paulmcvn: try to split the polygon AFXE into 2 triangles, called x, y
Find the relationship between a, b, c, x, y. You will see the solution
And please remove your spoiler here http://online-judge.uva.es/board/viewtopic.php?t=14068
by FAQ
Fri Jan 05, 2007 7:03 am
Forum: Volume 111 (11100-11199)
Topic: 11148 - Moliu Fractions
Replies: 19
Views: 12452

artie, try to avoid all 'runerror(200)' in your code
by FAQ
Sun Dec 31, 2006 6:40 am
Forum: Volume 111 (11100-11199)
Topic: 11151 - Longest Palindrome
Replies: 65
Views: 33367

I still got WA

Here is my trying input 12 ADAM MADAM qweqweqwedadqweqweqwe aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
by FAQ
Sun Dec 10, 2006 3:15 pm
Forum: Algorithms
Topic: Plane Division
Replies: 0
Views: 1094

Plane Division

Given N segments on a 2-d plane, each one has 2 end-points with coordinates (x1, y1) (x2, y2). Counting number of places on that plane which enclosed completely by segments (and their intersection points)

I want to ask, how fast can we solve this problem?

Thanks
by FAQ
Sun Oct 29, 2006 3:39 am
Forum: Volume 111 (11100-11199)
Topic: 11146 - Insurrection
Replies: 11
Views: 3896

I'm trapped in the part building that graph :(
I check every (u, v) and find the smallest simple path (or cycle if there is) between them, but it's quite slow
Any hints please?

Go to advanced search