Search found 8 matches

by DavidDeharbe
Sat Oct 06, 2007 12:30 am
Forum: Volume 112 (11200-11299)
Topic: 11290 - Gangs
Replies: 8
Views: 3189

(tentative) explanation

run R1 is more OG than a run R2 if and only if: R2 returns to the Green Line for the first time at an earlier point than when R1 returns to the Green Line, or R1 and R2 return to the Green Line at the same point, but the portion of R1 to that point (ignoring the initial E and final S) is more OG th...
by DavidDeharbe
Mon Oct 01, 2007 10:42 pm
Forum: Volume 112 (11200-11299)
Topic: 11290 - Gangs
Replies: 8
Views: 3189

emotional blind wrote:I need some critical inputs..
Check this:
http://plg.uwaterloo.ca/~acm00/

Good luck!

David.
--
by DavidDeharbe
Mon May 17, 2004 4:11 pm
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 39226

Thanks for pointing this to me. I enlarged the scope of my search and finally find some pieces of answers. I wonder if there is a web page where the "features" of the current C++ compiler are exhaustively documented.

Cheers,

David.
--
by DavidDeharbe
Mon May 17, 2004 4:07 pm
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 19983

Functional languages

As an educator, I tend to agree that contests should allow functional languages - they allow for quick experimentation of ideas and are a natural medium to practice programming as an art . In that sense, I would suggest SCHEME and OCAML. As for spending hours polishing code to shave milliseconds off...
by DavidDeharbe
Mon May 17, 2004 3:53 pm
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 39226

The search in a map container is too expensive (linear). As you may have as much as 1,000,000 searches in a map of up to 10,000 you exceed the time limits. I am not sure that the compiler accepts hash_map, but it should significantly decrease the execution time.

Best luck,

David.
by DavidDeharbe
Mon May 17, 2004 3:50 pm
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 39226

For each tree name, you scan the whole list of species. So assuming that you have S species, and are reading N names, of length L, then your complexity is roughly N*M*L. Now, if S = 10,000, N = 1,000,000, and L=30, there is no wonder that you get time limit exceeded. Note that even if you maintain t...
by DavidDeharbe
Mon May 17, 2004 3:47 pm
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 39226

For each tree name, you scan the whole list of species. So assuming that you have S species, and are reading N names, of length L, then your complexity is roughly N*M*L. Now, if S = 10,000, N = 1,000,000, and L=30, there is no wonder that you get time limit exceeded. Note that even if you maintain t...
by DavidDeharbe
Sun May 16, 2004 12:55 am
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 39226

ios_base not fully supported

I use the following code so that float are output as specified in problem 10226, e.g. 3.1416 for pi. [cpp] cout.flags(ios_base::fixed | ios_base::showpoint); cout.precision(4); [/cpp] I have included iostream and iomanip, and am using namespace std. This compiles fine with g++ (GCC) 3.2.2 (Mandrake ...

Go to advanced search