Search found 32 matches

by tywok
Fri Nov 03, 2006 2:19 pm
Forum: Volume 111 (11100-11199)
Topic: 11139 - Counting Quadrilaterals
Replies: 13
Views: 4780

You can do it in O(n^3) :wink:
by tywok
Sun Sep 10, 2006 2:01 am
Forum: Volume 110 (11000-11099)
Topic: 11084 - Anagram Division
Replies: 19
Views: 9390

Well, it looks like that there is no entry with d larger than 8000, otherways, my solution shouldn't be accepted or i am waaaaay too lucky, hehe

EDIT: After investigating a little, it looks like there is no input with d larger than 1000 :wink:
by tywok
Sun Sep 10, 2006 1:59 am
Forum: Volume 110 (11000-11099)
Topic: 11084 - Anagram Division
Replies: 19
Views: 9390

but.. how do you get it pass through memory limitations? an array of 1024*10000 is too much!
by tywok
Sun Sep 03, 2006 1:46 am
Forum: Volume 110 (11000-11099)
Topic: 11081 - Strings
Replies: 35
Views: 19519

thanks Martin for your hint!
by tywok
Sat Sep 02, 2006 7:22 pm
Forum: Volume 110 (11000-11099)
Topic: 11081 - Strings
Replies: 35
Views: 19519

It is strange... during the contest i got ACed an n^4 algorithm, that of course, i can't get ACed now..
by tywok
Tue May 23, 2006 7:20 am
Forum: Algorithms
Topic: Line Sweep Algo, Closest Pairs, and Red-Black Trees
Replies: 9
Views: 4119

I don't think there is one in this judge, but there is one at SPOJ : http://www.spoj.pl/problems/CH3D/
by tywok
Mon May 15, 2006 10:44 am
Forum: Volume 110 (11000-11099)
Topic: 11031 - Looking for a Subset
Replies: 24
Views: 17330

It differs from my ACed output:

Code: Select all

I posted a not correct output and removed it. I run an old version which was WA.
by tywok
Tue Mar 28, 2006 8:33 am
Forum: Bugs and suggestions
Topic: people's info
Replies: 3
Views: 2494

The other thing i would really like is to be able to change my information. I know it has been deactivited for a while, but it would be really useful!
Thank you very much for your dedicated work!
by tywok
Wed Mar 08, 2006 3:11 pm
Forum: Volume 110 (11000-11099)
Topic: 11008 - Antimatter Ray Clearcutting
Replies: 81
Views: 38490

- Please please please don't post 58 kbs posts because they will surely slow the forums a lot and its a nightmare to see what the post is abut. You can use sites, where you can upload small files for free. Just now i can't find one, although i have used them - When doing test cases be sure they are ...
by tywok
Tue Mar 07, 2006 3:11 pm
Forum: Volume 110 (11000-11099)
Topic: 11008 - Antimatter Ray Clearcutting
Replies: 81
Views: 38490

frankhuhu: explain your algorithm in a more detailed way. If you do the most straightforward DP you have to consider only the shots where shoot all the trees that are collinear. That's probably the most common "bug" in this problem.
by tywok
Thu Mar 02, 2006 8:43 am
Forum: ACM ICPC Archive Board
Topic: 3408 - Unequalled Consumption
Replies: 2
Views: 1061

http://www.csc.kth.se/contest/nwerc/2005/solutions/

there is a small comment in the C++ solution from Per Austrin
by tywok
Mon Feb 27, 2006 8:22 pm
Forum: Volume 109 (10900-10999)
Topic: 10999 - Crabbles
Replies: 26
Views: 13914

I would say he uses a trie: http://en.wikipedia.org/wiki/Trie

This kind of data structures are those that just don't type and debug during a contest instead of using a previously written and tested code. Try to do it yourself and you could be much faster nextime!
by tywok
Mon Feb 27, 2006 8:43 am
Forum: Volume 109 (10900-10999)
Topic: 10999 - Crabbles
Replies: 26
Views: 13914

the judge input&output is somewhere on waterloo's server, that's why he got 0.002s. I really wonder if you can read 100000 words in 0.002s...
by tywok
Thu Feb 23, 2006 3:14 pm
Forum: Algorithms
Topic: Count number of points... ?
Replies: 2
Views: 1033

Go to advanced search